Robust PCA via outlier pursuit

IEEE Transactions on Information Theory

Volumn 58, Issue 5, 2012, Pages 3047-3064

  Xu, Huan ^a   Caramanis, Constantine ^b   Sanghavi, Sujay ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COLLABORATIVE FILTERING; COLUMN SPACE; DIMENSIONALITY REDUCTION; LOW-DIMENSIONAL APPROXIMATION; LOW-DIMENSIONAL SUBSPACE; MALICIOUS AGENT; MATRIX COMPLETION; MATRIX DECOMPOSITION; OPTIMALITY; OPTIMIZATION-BASED ALGORITHM; PRINCIPAL COMPONENT ANALYSIS (PCA); ROBUST PCA;

CONVEX OPTIMIZATION; GENES; OPTIMIZATION; PRINCIPAL COMPONENT ANALYSIS; STATISTICS;

BIOINFORMATICS;

EID: 84860244942     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2173156     Document Type: Conference Paper

References (43)

1. H. Xu, C. Caramanis, and S. Sanghavi, "Robust PCA via outlier pursuit," in Advances in Neural Information Processing Systems. Cambridge, MA: MIT Press, 2010.
2. I. T. Jolliffe, Principal Component Analysis. Berlin, Germany: Springer-Verlag, 1986, Springer Series in Statistics.
3. P. J. Huber, Robust Statistics. New York: Wiley, 1981.
4. L. Xu and A. L. Yuille, "Robust principal component analysis by selforganizing rules based on statistical physics approach," IEEE Trans. Neural Netw., vol. 6, no. 1, pp. 131-143, Jan. 1995.
5. V. Chandrasekaran, S. Sanghavi, P. Parrilo, and A. Willsky, Rank- Sparsity Incoherence for Matrix Decomposition 2009 [Online]. Available: http://arxiv.org/abs/0906.2220
6. E. Candés, X. Li, Y. Ma, and J. Wright, "Robust principal component analysis?," J. ACM, 2011, to be published.
7. S. J. Devlin, R. Gnanadesikan, and J. R. Kettenring, "Robust estimation of dispersion matrices and principal components," J. Am. Statist. Assoc., vol. 76, no. 374, pp. 354-362, 1981.
8. T. N. Yang and S. D. Wang, "Robust algorithms for principal component analysis," Pattern Recognit. Lett., vol. 20, no. 9, pp. 927-933, 1999.
9. C. Croux and G. Hasebroeck, "Principal component analysis based on robust estimators of the covariance or correlation matrix: Influence functions and efficiencies," Biometrika, vol. 87, no. 3, pp. 603-618, 2000.
10. F. De la Torre and M. J. Black, "Robust principal component analysis for computer vision," in Proc. 8th Int. Conf. Comput. Vis., 2001, pp. 362-369.
11. F. De la Torre and M. J. Black, "A framework for robust subspace learning," Int. J. Comput. Vis., vol. 54, no. 1-3, pp. 117-142, 2003.
12. C. Croux, P. Filzmoser, and M. Oliveira, "Algorithms for projection- Pursuit robust principal component analysis," Chemometr. Intell. Lab. Syst., vol. 87, no. 2, pp. 218-225, 2007.
13. S. C. Brubaker, "Robust PCA and clustering on noisy mixtures," in Proc. 19th Annu. ACM-SIAM Symp. Discrete Algorithms, 2009, pp. 1078-1087.
14. D. L. Donoho, Breakdown Properties of Multivariate Location Estimators. Cambridge, MA: Harvard Univ., 1982, Qualifying Paper.
15. R. Maronna, "Robust g-estimators of multivariate location and scatter," Ann. Statist., vol. 4, pp. 51-67, 1976.
16. V. Barnett, "The ordering of multivariate data," J. Royal Statist. Soc. Ser. A, vol. 138, pp. 318-344, 1976.
17. D. Titterington, "Estimation of correlation coefficients by ellipsoidal trimming," Appl. Statist., vol. 27, pp. 227-234, 1978.
18. V. Barnett and T. Lewis, Outliers in Statistical Data. New York: Wiley, 1978.
19. A. Dempster and M. Gasko-Green, "New tools for residual analysis," Ann. Statist., vol. 9, no. 5, pp. 945-959, 1981.
20. S. J. Devlin, R. Gnanadesikan, and J. R. Kettenring, "Robust estimation and outlier detection with correlation coefficients," Biometrika, vol. 62, pp. 531-545, 1975.
21. G. Li and Z. Chen, "Projection-pursuit approach to robust dispersion matrices and principal components: Primary theory and Monte Carlo," J. Am. Statist. Assoc., vol. 80, no. 391, pp. 759-766, 1985.
22. C. Croux and A. Ruiz-Gazen, "High breakdown estimators for principal components: The projection-pursuit approach revisited," J. Multivariate Anal., vol. 95, no. 1, pp. 206-226, 2005.
23. M. Fazel, "Matrix rank minimization with applications," Ph.D. dissertation, Dept. Elect. Eng., Stanford Univ., Stanford, CA, 2002.
24. B. Recht, M. Fazel, and P. Parrilo, "Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization," SIAM Rev., to be published.
25. S. Cotter, B. Rao, K. Engan, and K. Kreutz-delgado, "Sparse solutions to linear inverse problems with multiple measurement vectors," IEEE Trans. Signal Process., vol. 53, no. 7, pp. 2477-2488, Jul. 2005.
26. E. J. Candés, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
27. E. Candés and B. Recht, "Exact matrix completion via convex optimization," Found. Comput. Math., vol. 9, pp. 717-772, 2009.
28. E. Candés and T. Tao, "The power of convex relaxation: Near-optimal matrix completion," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2053-2080, May 2010.
29. H. Xu, C. Caramanis, and S. Mannor, "Principal component analysis with contaminated data: The high-dimensional case," in Proc. 23rd Annu. Conf. Learn. Theory, 2010, pp. 490-502.
30. M. Wainwright, "Sharp thresholds for noisy and high-dimensional recovery of sparsity using v-constrained quadratic programming (Lasso)," IEEE Trans. Inf. Theory, vol. 55, no. 5, pp. 2183-2202, May 2009.
31. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
32. D. Donoho, M. Elad, and V. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 6-18, Jan. 2006.
33. G. Watson, "Characterization of the subdifferential of some matrix norms," Linear Algebra Appl., vol. 170, pp. 33-45, 1992.
34. R. T. Rockafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
35. P. Wedin, "Perturbation bounds in connection with singular value decomposition," BIT Numer. Math., vol. 12, no. 1, pp. 99-111, 1972.
36. G. W. Stewart and G. W. Stewart, "Perturbation theory for the singular value decomposition," in SVD and Signal Processing-Part II: Algorithms, Analysis and Applications. New York: Elsevier, 1990, pp. 99-109.
37. R. Bhatia, Matrix Analysis. New York: Springer-Verlag, 1997.
38. P. Tseng, "On accelerated proximal gradient methods for convex-concave optimization," SIAM J. Optim., 2008, submitted for publication.
39. Y. Nesterov, "A method of solving a convex programming problem with convergence ratev gvm1G=7.8," Sov. Math. Dokl., vol. 27, pp. 372-376, 1983.
40. J.-F. Cai, E. Candés, and Z. Shen, "A singular value thresholding algorithm for matrix completion," SIAM J. Optim., vol. 20, pp. 1956-1982, 2008.
41. M. McCoy and J. Tropp, private communication, Oct. 2010.
42. C. Rasmussen and C. Williams, Gaussian Processes for Machine Learning. Cambridge, MA: MIT Press, 2006.
43. Y. Chen, H. Xu, C. Caramanis, and S. Sanghavi, "Robust matrix completion with corrupted columns," in Proc. 28th Int. Conf. Mach. Learn., 2011, pp. 873-880.