GoDec: Randomized low-rank & sparse matrix decomposition in noisy case

Proceedings of the 28th International Conference on Machine Learning, ICML 2011

Volumn , Issue , 2011, Pages 33-40

  Zhou, Tianyi ^a   Tao, Dacheng ^a  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETION TOOLS; COMPRESSED SENSING; EMPIRICAL STUDIES; LOCAL MINIMUMS; LOCAL OPTIMUM; LOW RANK APPROXIMATIONS; MATRIX; MATRIX COMPLETION; MATRIX DECOMPOSITION; RANDOM PROJECTIONS; ROBUST PCA; SPARSE APPROXIMATIONS; SPARSE MATRICES;

APPROXIMATION ALGORITHMS; DATA HANDLING; LEARNING SYSTEMS;

MATRIX ALGEBRA;

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

References (15)

1. Bredies, K. and Lorenz, D. A. Iterated hard shrinkage for minimization problems with sparsity constraints. SIAM Journal on Scientific Computing, 30(2):657-683, 2008.
2. Cai, J., Candès, E. J., and Shen, Z. A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4):1956-1982, 2010.
3. Candès, E. J. and Tao, T. The power of convex relaxation: Near-optimal matrix completion. arXiv: 0903.1476, 2009.
4. Candès, E. J., Li, X., Ma, Y., and Wright, J. Robust principal component analysis? Journal of the ACM (submitted), 2009.
5. Chandrasekaran, Venkat, Sanghavi, Sujay, Parrilo, Pablo A, and Willsky, Alan S. Rank-sparsity incoherence for matrix decomposition. arXiv: 0906.2220, 2009.
6. Cheng, L., Gong, M., Schuurmans, D., and Caelli, T. Real-time discriminative background subtraction. to appear in IEEE Trans on Image Processing, 2010.
7. Donoho, D. L. Compressed sensing. IEEE Trans on Information Theory, 52(4):1289-1306, 2006.
8. Fazel, M., Candès, E. J., Recht, B., and Parrilo, P. Compressed sensing and robust recovery of low rank matrices. In 42nd Asilomar Conference on Signals, Systems and Computers, 2008.
9. Halko, N., Martinsson, P. G., and Tropp, J. A. Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions. arXiv: 0909.4061, 2009.
10. Keshavan, R. and Oh, S. Optspace: A gradient descent algorithm on grassman manifold for matrix completion. Submitted to IEEE Trans on Signal Processing, 2009.
11. Lewis, A. S. and Malick, J. Alternating projections on manifolds. Mathematics of Operations Research, 33(1):216-234, 2008.
12. Roweis, S. Em algorithms for pca and spca. In NIPS, pp. 626-632, 1998.
13. Zhou, T. and Tao, D. Bilateral random projection based low-rank approximation. Technical report, 2010.
14. Zhou, T., Tao, D., and Wu, X. Manifold elastic net: a unified framework for sparse dimension reduction. Data Mining and Knowledge Discovery (Springer), 22(3):340-371, 2011.
15. Zhou, Z., Li, X., Wright, J., Candès, E. J., and Ma, Y. Stable principal component pursuit. In ISIT, 2010.