Low-rank Matrix Completion in a General Non-orthogonal Basis
arXiv:1812.05786
Abstract
This paper considers theoretical analysis of recovering a low rank matrix given a few expansion coefficients with respect to any basis. The current approach generalizes the existing analysis for the low-rank matrix completion problem with sampling under entry sensing or with respect to a symmetric orthonormal basis. The analysis is based on dual certificates using a dual basis approach and does not assume the restricted isometry property (RIP). We introduce a condition on the basis called the correlation condition. This condition can be computed in time and holds for many cases of deterministic basis where RIP might not hold or is NP hard to verify. If the correlation condition holds and the underlying low rank matrix obeys the coherence condition with parameter , under additional mild assumptions, our main result shows that the true matrix can be recovered with very high probability from uniformly random expansion coefficients.
arXiv comment28 pages
References in corpus (6)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A Simpler Approach to Matrix Completion
- Matrix Completion on Graphs
- Note on sampling without replacing from a finite collection of matrices
- Learning with the Weighted Trace-norm under Arbitrary Sampling Distributions
- Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-rank Matrix Completion