Completing Any Low-rank Matrix, Provably
From MaRDI portal
Publication:2788394
zbMath1351.62107arXiv1306.2979MaRDI QIDQ2788394
Sujay Sanghavi, Yudong Chen, Rachel Ward, Srinadh Bhojanapalli
Publication date: 19 February 2016
Full work available at URL: https://arxiv.org/abs/1306.2979
62H12: Estimation in multivariate analysis
90C90: Applications of mathematical programming
15A83: Matrix completion problems
Related Items
Unnamed Item, Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries, Estimating Leverage Scores via Rank Revealing Methods and Randomization, Stochastic Gradients for Large-Scale Tensor Decomposition, Unnamed Item, Matrix Denoising for Weighted Loss Functions and Heterogeneous Signals, Tensor theta norms and low rank recovery, Robust non-parametric regression via incoherent subspace projections, An adaptation for iterative structured matrix completion, Optimal prediction in the linearly transformed spiked model, Relaxed leverage sampling for low-rank matrix completion, The Expected Norm of a Sum of Independent Random Matrices: An Elementary Approach