Low-rank Matrix Recovery from Errors and Erasures

Details Low-rank Matrix Recovery from Errors and Erasures Low-rank Matrix Recovery from Errors and Erasures

2011-04-03

arxiv.org/abs/1104.0354v2

Computer Science

Information Theory

27 pages, 3 figures. Appeared in ISIT 2011

Scientific paper

This paper considers the recovery of a low-rank matrix from an observed version that simultaneously contains both (a) erasures: most entries are not observed, and (b) errors: values at a constant fraction of (unknown) locations are arbitrarily corrupted. We provide a new unified performance guarantee on when the natural convex relaxation of minimizing rank plus support succeeds in exact recovery. Our result allows for the simultaneous presence of random and deterministic components in both the error and erasure patterns. On the one hand, corollaries obtained by specializing this one single result in different ways recover (up to poly-log factors) all the existing works in matrix completion, and sparse and low-rank matrix recovery. On the other hand, our results also provide the first guarantees for (a) recovery when we observe a vanishing fraction of entries of a corrupted matrix, and (b) deterministic matrix completion.

Affiliated with

Also associated with

No associations

Rating

Low-rank Matrix Recovery from Errors and Erasures 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 Low-rank Matrix Recovery from Errors and Erasures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low-rank Matrix Recovery from Errors and Erasures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131737