Computer Science – Information Theory
Scientific paper
2010-01-02
Computer Science
Information Theory
30 pages
Scientific paper
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entries. We show that properly constrained nuclear-norm minimization stably recovers a low-rank matrix from a constant number of noisy measurements per degree of freedom; this seems to be the first result of this nature. Further, the recovery error from noisy data is within a constant of three targets: 1) the minimax risk, 2) an oracle error that would be available if the column space of the matrix were known, and 3) a more adaptive oracle error which would be available with the knowledge of the column space corresponding to the part of the matrix that stands above the noise. Lastly, the error bounds regarding low-rank matrices are extended to provide an error bound when the matrix has full rank with decaying singular values. The analysis in this paper is based on the restricted isometry property (RIP) introduced in [6] for vectors, and in [22] for matrices.
Candes Emmanuel J.
Plan Yaniv
No associations
LandOfFree
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-222673