Provable non-convex robust PCA

Advances in Neural Information Processing Systems

Volumn 2, Issue January, 2014, Pages 1107-1115

  Netrapalli, Praneeth ^a   Niranjan, U N ^b   Sanghavi, Sujay ^c   Anandkumar, Animashree ^b   Jain, Prateek ^d  

^a MICROSOFT RESEARCH   (United Kingdom)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^d MICROSOFT RESEARCH   (United States)

Author keywords

Alternating projections; Matrix decomposition; Non convex methods; Robust PCA

Indexed keywords

CONVEX OPTIMIZATION;

ALTERNATING PROJECTIONS; EXACT RECOVERIES; LOW-RANK MATRICES; MATRIX DECOMPOSITION; NON-CONVEX METHODS; ROBUST PCA; SPARSE MATRICES; SYNTHETIC AND REAL DATA;

ITERATIVE METHODS;

EID: 84937876583     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. A. Agarwal, A. Anandkumar, P. Jain, P. Netrapalli, and R. Tandon. Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization. Available on arXiv: 1310.7991, Oct. 2013.
2. A. Anandkumar, R. Ge, D. Hsu, S. M. Kakade, and M. Telgarsky. Tensor Methods for Learning Latent Variable Models. Available at arXiv: 1210.7559, Oct. 2012.
3. A. Agarwal, S. Negahban, and M. Wainwright. Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions. The Annals of Statistics, 40(2): 1171-1197, 2012.
4. Rajendra Bhatia. Matrix Analysis. Springer, 1997.
5. Y. Chen. Incoherence-Optimal Matrix Completion. ArXiv e-prints, October 2013.
6. Emmanuel J. Candès, Xiaodong Li, Yi Ma, and John Wright. Robust principal component analysis? J. ACM, 58(3): 11, 2011.
7. Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Parrilo, and Alan S. Willsky. Rank-sparsity incoherence for matrix decomposition. SIAM Journal on Optimization, 21(2): 572-596, 2011.
8. Yudong Chen, Sujay Sanghavi, and Huan Xu. Clustering sparse graphs. In Advances in neural information processing systems, pages 2204-2212, 2012.
9. László Erdos, Antti Knowles, Horng-Tzer Yau, and Jun Yin. Spectral statistics of Erdos-Rényi graphs I: Local semicircle law. The Annals of Probability, 2013.
10. Moritz Hardt. On the provable convergence of alternating minimization for matrix completion. arXiv: 1312.0925, 2013.
11. Daniel Hsu, Sham M Kakade, and Tong Zhang. Robust matrix decomposition with sparse corruptions. ITIT, 2011.
12. Prateek Jain, Praneeth Netrapalli, and Sujay Sanghavi. Low-rank matrix completion using alternating minimization. In STOC, 2013.
13. Anastasios Kyrillidis and Volkan Cevher. Matrix alps: Accelerated low rank and sparse matrix reconstruction. In SSP Workshop, 2012.
14. Raghunandan H. Keshavan. Efficient algorithms for collaborative filtering. PhD Thesis, Stanford University, 2012.
15. Zhouchen Lin, Minming Chen, and Yi Ma. The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv: 1009.5055, 2010.
16. Liyuan Li, Weimin Huang, IY-H Gu, and Qi Tian. Statistical modeling of complex backgrounds for foreground object detection. ITIP, 2004.
17. Hossein Mobahi, Zihan Zhou, Allen Y. Yang, and Yi Ma Holistic 3d reconstruction of urban structures from low-rank textures. In ICCV Workshops, pages 593-600, 2011.
18. Praneeth Netrapalli, Prateek Jain, and Sujay Sanghavi. Phase retrieval using alternating minimization. In NIPS, pages 2796-2804, 2013.
19. H. Sedghi, A. Anandkumar, and E. Jonckheere. Guarantees for Stochastic ADMM in High Dimensions. Preprint., Feb. 2014.
20. Lei Shi. Sparse additive text models with low rank background. In Advances in Neural Information Processing Systems, pages 172-180, 2013.
21. X. Wang, M. Hong, S. Ma, and Z. Luo. Solving multiple-block separable convex minimization problems using two-block alternating direction method of multipliers. arXiv: 1308.5294, 2013.
22. Huan Xu, Constantine Caramanis, and Sujay Sanghavi. Robust pca via outlier pursuit. IEEE Transactions on Information Theory, 58(5): 3047-3064, 2012.