Dense Error Correction for Low-Rank Matrices via Principal Component Pursuit

Details Dense Error Correction for Low-Rank Matrices via Principal Component Pursuit Dense Error Correction for Low-Rank Matrices via Principal Component Pursuit

2010-01-14

arxiv.org/abs/1001.2362v2

Computer Science

Information Theory

Submitted to ISIT 2010

Scientific paper

We consider the problem of recovering a low-rank matrix when some of its entries, whose locations are not known a priori, are corrupted by errors of arbitrarily large magnitude. It has recently been shown that this problem can be solved efficiently and effectively by a convex program named Principal Component Pursuit (PCP), provided that the fraction of corrupted entries and the rank of the matrix are both sufficiently small. In this paper, we extend that result to show that the same convex program, with a slightly improved weighting parameter, exactly recovers the low-rank matrix even if "almost all" of its entries are arbitrarily corrupted, provided the signs of the errors are random. We corroborate our result with simulations on randomly generated matrices and errors.

Affiliated with

Also associated with

No associations

Rating

Dense Error Correction for Low-Rank Matrices via Principal Component Pursuit 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 Dense Error Correction for Low-Rank Matrices via Principal Component Pursuit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dense Error Correction for Low-Rank Matrices via Principal Component Pursuit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-567684