Name
Abstract | ||
|---|---|---|
We investigate the robust PCA problem of decomposing an observed matrix into the sum of a low-rank and a sparse error matrices via convex programming Principal Component Pursuit (PCP). In contrast to previous studies that assume the support of the error matrix is generated by uniform Bernoulli sampling, we allow non-uniform sampling, i.e., entries of the low-rank matrix are corrupted by errors with unequal probabilities. We characterize conditions on error corruption of each individual entry based on the local incoherence of the low-rank matrix, under which correct matrix decomposition by PCP is guaranteed. Such a refined analysis of robust PCA captures how robust each entry of the low rank matrix combats error corruption. In order to deal with non-uniform error corruption, our technical proof introduces a new weighted norm and develops/exploits the concentration properties that such a norm satisfies. |
Year | Venue | Field |
|---|---|---|
2015 | Annual Conference on Neural Information Processing Systems | Sparse PCA,Mathematical optimization,Bernoulli sampling,Matrix (mathematics),Computer science,Matrix decomposition,Low-rank approximation,Principal component pursuit,Artificial intelligence,Sampling (statistics),Convex optimization,Machine learning |
DocType | Volume | ISSN |
Conference | 28 | 1049-5258 |
Citations | PageRank | References |
2 | 0.35 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huishuai Zhang | 1 | 34 | 12.56 |
| Yi Zhou | 2 | 65 | 17.55 |
| Yingbin Liang | 3 | 1646 | 147.64 |