Pages that link to "Item:Q2933966"
From MaRDI portal
The following pages link to A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion (Q2933966):
Displaying 18 items.
- Main effects and interactions in mixed and incomplete data frames (Q146484) (← links)
- Matrix completion via max-norm constrained optimization (Q302432) (← links)
- Adaptive multinomial matrix completion (Q902226) (← links)
- 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation (Q1640399) (← links)
- Flexible low-rank statistical modeling with missing data and side information (Q1799348) (← links)
- Online optimization for max-norm regularization (Q2014582) (← links)
- Imputation and low-rank estimation with missing not at random data (Q2209726) (← links)
- One-bit tensor completion via transformed tensor singular value decomposition (Q2242530) (← links)
- Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions (Q2313281) (← links)
- Generalized high-dimensional trace regression via nuclear norm regularization (Q2323374) (← links)
- Joint maximum likelihood estimation for high-dimensional exploratory item factor analysis (Q2331148) (← links)
- (Q4998876) (← links)
- Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming (Q5043284) (← links)
- A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data (Q5070506) (← links)
- Structured Latent Factor Analysis for Large-scale Data: Identifiability, Estimability, and Their Implications (Q5146028) (← links)
- (Q5148935) (← links)
- (Q5214181) (← links)
- (Q5214241) (← links)