Stable Principal Component Pursuit
Authors:
Preprint
Abstract
In this paper, we study the problem of recovering a low-rank matrix (the principal components) from a high-dimensional data matrix despite both small entry-wise noise and gross sparse errors. Recently, it has been shown that a convex program, named Principal Component Pursuit (PCP), can recover the low-rank matrix when the data matrix is corrupted by gross sparse errors. We further prove that the solution to a related convex program (a relaxed PCP) gives an estimate of the low-rank matrix that is simultaneously stable to small entrywise noise and robust to gross sparse errors. More precisely, our result shows that the proposed convex program recovers the low-rank matrix even though a positive fraction of its entries are arbitrarily corrupted, with an error bound proportional to the noise level. We present simulation results to support our result and demonstrate that the new convex program accurately recovers the principal components (the low-rank matrix) under quite broad conditions. To our knowledge, this is the first result that shows the classical Principal Component Analysis (PCA), optimal for small i.i.d. noise, can be made robust to gross sparse errors; or the first that shows the newly proposed PCP can be made stable to small entry-wise perturbations.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- A Unified Framework for High-Dimensional Analysis of $M$-Estimators with Decomposable RegularizersStatistical Science, 2012
- Rank-Sparsity Incoherence for Matrix DecompositionSIAM Journal on Optimization, 2011
- Matrix Completion With NoiseProceedings of the IEEE, 2010
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm MinimizationSIAM Review, 2010
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solutionCommunications on Pure and Applied Mathematics, 2006
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Stable recovery of sparse overcomplete representations in the presence of noiseIEEE Transactions on Information Theory, 2005
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- The Approximation of One Matrix by Another of Lower RankPsychometrika, 1936