Nonconvex relaxation approaches to robust matrix recovery

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 1764-1770

  Wang, Shusen ^a   Liu, Dehua ^a   Zhang, Zhihua ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

AUGMENTED LAGRANGE MULTIPLIERS; LOCAL OPTIMAL SOLUTION; LOW-RANK MATRIX RECOVERIES; NON-CONVEX LOSS FUNCTION; NONCONVEX OPTIMIZATION; NONCONVEX PENALTIES; ROBUST PRINCIPAL COMPONENT ANALYSIS; STATE-OF-THE-ART ALGORITHMS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; LAGRANGE MULTIPLIERS; PRINCIPAL COMPONENT ANALYSIS;

RECOVERY;

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

References (26)

1. P. Breheny and J. Huang. Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection. The Annals of Applied Statistics, 5(1):232-253, 2011.
2. J-F. Cai, E. Candès, and Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4):1956-1982, 2010.
3. E. Candès, X. Li, Y. Ma, and J. Wright. Robust principal component analysis? Journal of the ACM, 58(3), May 2011.
4. B. Cheng, G. Liu, J. Wang, Z. Huang, and S. Yan. Multi-task low-rank affinity pursuit for image segmentation. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2011.
5. J. Fan and R. Li. Variable selection via nonconcave penalized likelihood and its Oracle properties. Journal of the American Statistical Association, 96:1348-1361, 2001.
6. M. Fazel, H. Hindi, and S.P. Boyd. Logdet heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices. In Proceedings of the American Control Conference. IEEE, 2003.
7. P. Gong, J. Ye, and C. Zhang. Multistage multi-task feature learning. In Advances in Neural Information Processing Systems (NIPS), 2012.
8. R. Hunter and R. Li. Variable selection using MM algorithm. Annals of Statistics, pages 1617-1642, 2005.
9. A. Kyrillidis and V. Cevher. Matrix ALPS: Accelerated low rank and sparse matrix reconstruction. arXiv preprint arXiv:1203.3864, 2012.
10. Z. Lin, M. Chen, L. Wu, and Y. Ma. The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. UIUC Technical Report, UILU-ENG-09-2215, 2009.
11. G. Liu, Z. Lin, and Y. Yu. Robust subspace segmentation by low-rank representation. In International Conference on Machine Learning (ICML), 2010.
12. D. Martin, C. Fowlkes, D. Tal, and J. Malik. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In International Conference on Computer Vision (ICCV), volume 2, pages 416- 423, July 2001.
13. R. Mazumder, T. Hastie, and R. Tibshirani. Spectral regularization algorithms for learning large incomplete matrices. Journal of Machine Learning Research, 11(2):2287-2322, 2010.
14. Y. Peng, A. Ganesh, J. Wright, W. Xu, and Y. Ma. RASL: Robust alignment by sparse and lowrank decomposition for linearly correlated images. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2010.
15. J. Shi, X. Ren, G. Dai, J. Wang, and Z. Zhang. A non-convex relaxation approach to sparse dictionary learning. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2011.
16. R. Tibshirani. Regression shrinkage and selection via the LASSO. Journal of the Royal Statistical Society B, pages 267-288, 1996.
17. S. Wang and Z. Zhang. Colorization by matrix completion. In AAAI Conference on Artificial Intelligence (AAAI), 2012.
18. A.E. Waters, A.C. Sankaranarayanan, and R.G. Baraniuk. SpaRCS: Recovering low-rank and sparse matrices from compressive measurements. In Advances in Neural Information Processing Systems (NIPS), 2011.
19. J. Wright, A. Ganesh, S. Rao, Y. Peng, and Y. Ma. Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization. In Advances in Neural Information Processing Systems (NIPS), 2009.
20. S. Xiang, X. Shen, and J. Ye. Efficient sparse group feature selection via nonconvex optimization. arXiv preprint arXiv:1205.5075, 2012.
21. Z. Zhang and B. Tu. Nonconvex penalization using laplace exponents and concave conjugates. In Advances in Neural Information Processing Systems (NIPS), 2012.
22. Z. Zhang, Y. Matsushita, and Y. Ma. Camera calibration with lens distortion from low-rank textures. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2011.
23. Z. Zhang, S. Wang, D. Liu, and M. I. Jordan. EP-GIG priors and applications in Bayesian sparse learning. Journal of Machine Learning Research, 13:2031-2061, 2012.
24. C.-H. Zhang. Nearly unbiased variable selection under minimax concave penalty. The Annals of Statistics, 38:894-942, 2010.
25. T. Zhang. Analysis of multi-stage convex relaxation for sparse regularization. Journal of Machine Learning Research, 11:1081-1107, 2010.
26. H. Zou and R. Li. One-step sparse estimates in nonconcave penalized likelihood models. The Annals of Statistics, 36(4):1509-1533, 2008.