Minimal shrinkage for noisy data recovery using Schatten-p norm objective

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8189 LNAI, Issue PART 2, 2013, Pages 177-193

  Kong, Deguang ^a   Zhang, Miao ^a   Ding, Chris ^a  

^a University of Texas at Arlington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COLLABORATIVE PREDICTIONS; NOISY DATA; NOISY DATASETS; OPTIMAL SOLUTIONS; RANK CONSTRAINTS; SHRINKAGE MODEL; SINGULAR VALUES; TRACE-NORMS;

ALGORITHMS; LEARNING SYSTEMS; OPTIMAL SYSTEMS; SHRINKAGE;

RECOVERY;

EID: 84886493829     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40991-2_12     Document Type: Conference Paper

References (29)

1. Cai, J., Candès, E., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization 20, 1956-1982 (2010)
2. Candès, E., Recht, B.: Exact matrix completion via convex optimization. Communications of the ACM 55, 111-119 (2012)
3. Recht, B., Fazel, M., Parrilo, P.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review 52, 471-501 (2010)
4. Rennie, J.M., Srebro, N.: Fast maximum margin matrix factorization for collaborative prediction. In: ICML, pp. 713-719 (2005)
5. Abernethy, J., Bach, F., Evgeniou, T., Paristech, M., Jaakkola, T.: A new approach to collaborative filtering: Operator estimation with spectral regularization. Journal of Machine Learning Research 10, 803-826 (2009)
6. Liu, J., Musialski, P., Wonka, P., Ye, J.: Tensor completion for estimating missing values in visual data. In: ICCV, pp. 2114-2121 (2009)
7. Jolliffe, I.: Principal Component Analysis. Springer (1986)
8. Donoho, D.: Compressed sensing. IEEE Transactions on Information Theory 52, 1289-1306 (2006)
9. 1-norm principal component analysis for robust subspace factorization. In: ICML, pp. 281-288 (2006)
10. Wright, J., Ganesh, A., Rao, S., Peng, Y.,Ma, Y.: Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization. In: NIPS (2009)
11. Peng, Y., Ganesh, A., Wright, J., Xu, W., Ma, Y.: Rasl: Robust alignment by sparse and low-rank decomposition for linearly correlated images. In: CVPR, pp. 763-770 (2010)
12. Fazel, M.: Matrix rank minimization with applications. PhD thesis, Stanford University, pp. 1-130 (2002)
13. Candès, E., Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Transactions on Information Theory 56, 2053-2080 (2010)
14. Chandrasekaran, V., Sanghavi, S., Parrilo, P., Willsky, A.: Sparse and low-rank matrix decompositions. In: Allerton 2009 Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing, pp. 962-967 (2009)
15. Ma, S., Goldfarb, D., Chen, L.: Fixed point and bregman iterative methods for matrix rank minimization. Mathematical Programming: Series A and B 128, 321-353 (2011)
16. Toh, K., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pacific Journal of Optimization (2010)
17. Pong, T., Tseng, P., Ji, S., Ye, J.: Trace norm regularization: Reformulations, algorithms, and multi-task learning. SIAM Journal on Optimization 20, 3465-3489 (2010)
18. Golub, G.H., Reinsch, C.: Singular value decomposition and least squares solutions. Numerische Mathematik 14, 403-420 (1970)
19. Lin, Z., Chen, M., Ma, Y.: The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. In: UIUC Tech. Rep., UILU-ENG-09-2214 (2010)
20. Bertsekas, D.: Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific (1996)
21. Tibshirani, R.: Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B 58, 267-288 (1994)
22. Argyriou, A., Micchelli, C., Pontil, M., Ying, Y.: A spectral regularization framework for multi-task structure learning. In: NIPS (2007)
23. Jain, P., Meka, R., Dhillon, I.: Guaranteed rank minimization via singular value projection. In: NIPS (2010)
24. Nie, F., Huang, H., Ding, C.: Low-rank matrix recovery via efficient schatten p-norm minimization. In: Twenty-Sixth AAAI Conference on Artificial Intelligence (2012)
25. Mohan, K., Fazel, M.: Iterative reweighted least squares for matrix rank minimization. In: 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 653-661. IEEE (2010)
26. Keshavan, R., Montanari, A., Oh, S.: Matrix completion from noisy entries. The Journal of Machine Learning Research 11, 2057-2078 (2010)
27. Wipf, D.: Non-convex rank minimization via an empirical bayesian approach. In: UAI, pp. 914-923 (2012)
28. Georghiades, A., Belhumeur, P., Kriegman, D.: From few to many: Illumination cone models for face recognition under variable lighting and pose. PAMI, 643-660 (2001)
29. Lecun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proceedings of the IEEE, 2278-2324 (1998)