Improved Algorithms for Matrix Recovery from Rank-One Projections
arXiv:1705.07469
Abstract
We consider the problem of estimation of a low-rank matrix from a limited number of noisy rank-one projections. In particular, we propose two fast, non-convex \emph{proper} algorithms for matrix recovery and support them with rigorous theoretical analysis. We show that the proposed algorithms enjoy linear convergence and that their sample complexity is independent of the condition number of the unknown true low-rank matrix. By leveraging recent advances in low-rank matrix approximation techniques, we show that our algorithms achieve computational speed-ups over existing methods. Finally, we complement our theory with some numerical experiments.
References in corpus (7)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- An overview of low-rank matrix recovery from incomplete observations
- A Field Guide to Forward-Backward Splitting with a FASTA Implementation
- Large-Scale Convex Minimization with a Low-Rank Constraint
- FASTA: A Generalized Implementation of Forward-Backward Splitting
- Sketching Sparse Matrices
- The Second Order Linear Model