Harmonic Mean Iteratively Reweighted Least Squares for Low-Rank Matrix Recovery
arXiv:1703.05038
Abstract
We propose a new iteratively reweighted least squares (IRLS) algorithm for the recovery of a matrix of rank from incomplete linear observations, solving a sequence of low complexity linear problems. The easily implementable algorithm, which we call harmonic mean iteratively reweighted least squares (HM-IRLS), optimizes a non-convex Schatten- quasi-norm penalization to promote low-rankness and carries three major strengths, in particular for the matrix completion setting. First, we observe a remarkable global convergence behavior of the algorithm's iterates to the low-rank matrix for relevant, interesting cases, for which any other state-of-the-art optimization approach fails the recovery. Secondly, HM-IRLS exhibits an empirical recovery probability close to even for a number of measurements very close to the theoretical lower bound , i.e., already for significantly fewer linear observations than any other tractable approach in the literature. Thirdly, HM-IRLS exhibits a locally superlinear rate of convergence (of order ) if the linear observations fulfill a suitable null space property. While for the first two properties we have so far only strong empirical evidence, we prove the third property as our main theoretical result.
arXiv comment47 pages, 6 figures
References in corpus (10)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Quantum state tomography via compressed sensing
- An overview of low-rank matrix recovery from incomplete observations
- Guaranteed Matrix Completion via Non-convex Factorization
- Global Optimality of Local Search for Low Rank Matrix Recovery
- Matrix Completion has No Spurious Local Minimum
- A Partial Derandomization of PhaseLift using Spherical Designs
- The Phase Transition of Matrix Recovery from Gaussian Measurements Matches the Minimax MSE of Matrix Denoising
- Stability of low-rank matrix recovery and its connections to Banach space geometry
- A generalisation of Mirsky's singular value inequalities
Cited by in corpus (7)
- Rank iterative least squares: efficient recovery of ill-conditioned low rank matrices from few entries
- Iteratively Reweighted Least Squares for Basis Pursuit with Global Linear Convergence Rate
- Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-order Convergence
- Escaping Saddle Points in Ill-Conditioned Matrix Completion with a Scalable Second Order Method
- Approximation, Gelfand, and Kolmogorov numbers of Schatten class embeddings
- Denoising and Completion of Structured Low-Rank Matrices via Iteratively Reweighted Least Squares
- Low Rank Regularization: A Review