Restricted strong convexity and weighted matrix completion: Optimal bounds with noise

Journal of Machine Learning Research

Volumn 13, Issue , 2012, Pages 1665-1697

  Negahban, Sahand ^a   Wainwright, Martin J ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Collaborative filtering; Convex optimization; Matrix completion

Indexed keywords

COLLABORATIVE FILTERING; ERROR BOUND; FROBENIUS NORM; HIGH PROBABILITY; INFORMATION-THEORETIC METHODS; LOW-RANK MATRICES; M-ESTIMATORS; MATRIX COMPLETION; MATRIX COMPLETION PROBLEMS; NON-ASYMPTOTIC; OBSERVATION OPERATOR; OPTIMAL BOUNDS;

CONVEX OPTIMIZATION; ERROR ANALYSIS; INFORMATION THEORY;

OPTIMIZATION;

EID: 84862020232     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (36)

1. A. Agarwal, S. Negahban, and M. J. Wainwright. Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions. Annals of Statistics, 2011. To appear.
2. R. Ahlswede and A. Winter. Strong converse for identification via quantum channels. IEEE Transactions on Information Theory, 48(3):569-579, March 2002. (Pubitemid 34239788)
3. F. Bach. Consistency of trace norm minimization. Journal of Machine Learning Research, 9:1019-1048, June 2008.
4. D. P. Bertsekas. Nonlinear programming. Athena Scientific, Belmont, MA, 1995.
5. E. Candes and Y. Plan. Matrix completion with noise. Proceedings of the IEEE, 98(6):925-936, 2010.
6. E. J. Candes and B. Recht. Exact matrix completion via convex optimization. Found. Comput. Math., 9(6):717-772, 2009.
7. E. J. Candes and T. Tao. The power of convex relaxation: Near-optimal matrix completion. IEEE Transactions on Information Theory, 56(5):2053-2080, 2010.
8. K. R. Davidson and S. J. Szarek. Local operator theory, random matrices, and Banach spaces. In Handbook of Banach Spaces, volume 1, pages 317-336. Elsevier, Amsterdam, NL, 2001.
9. M. Deza and M. Laurent. Geometry of Cuts and Metric Embeddings. Springer-Verlag, New York, 1997.
10. M. Fazel. Matrix Rank Minimization with Applications. PhD thesis, Stanford, 2002. Available online: http://faculty.washington. edu/mfazel/thesis-final.pdf.
11. D. Gross. Recovering low-rank matrices from few coefficients in any basis. IEEE Transactions on Information Theory, 57(3):1548-1566, March 2011.
12. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985.
13. R. H. Keshavan, A. Montanari, and S. Oh. Matrix completion from few entries. IEEE Transactions on Information Theory, 56(6):2980-2998, June 2010a.
14. R. H. Keshavan, A. Montanari, and S. Oh. Matrix completion from noisy entries. Journal of Machine Learning Research, 11:2057-2078, July 2010b.
15. M. Laurent. Matrix completion problems. In The Encyclopedia of Optimization, pages 221-229. Kluwer Academic, 2001.
16. M. Ledoux. The Concentration of Measure Phenomenon. Mathematical Surveys and Monographs. American Mathematical Society, Providence, RI, 2001.
17. M. Ledoux and M. Talagrand. Probability in Banach Spaces: Isoperimetry and Processes. Springer-Verlag, New York, NY, 1991.
18. Z. Lin, A. Ganesh, J. Wright, L. Wu, M. Chen, and Y. Ma. Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix. Technical Report UILU-ENG-09-2214, Univ. Illinois, Urbana-Champaign, July 2009.
19. R. Mazumber, T. Hastie, and R. Tibshirani. Spectral regularization algorithms for learning large incomplete matrices. Journal of Machine Learning Research, 11:2287-2322, August 2010.
20. S. Negahban and M. J. Wainwright. Estimation of (near) low-rank matrices with noise and highdimensional scaling. Annals of Statistics, 39(2):1069-1097, 2011.
21. S. Negahban, P. Ravikumar, M. J. Wainwright, and B. Yu. A unified framework for highdimensional analysis of M-estimators with decomposable regularizers. In Neural Information Processing Systems (NIPS), Vancouver, Canada, December 2009. To appear in Statistical Science.
22. Y. Nesterov. Gradient methods for minimizing composite objective function. Technical Report 2007/76, CORE, Universit'e catholique de Louvain, 2007.
23. G. Pisier. The Volume of Convex Bodies and Banach Space Geometry, volume 94 of Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge, UK, 1989.
24. B. Recht. A simpler approach to matrix completion. Journal of Machine Learning Research, 12:3413-3430, 2011.
25. B. Recht, M. Fazel, and P. Parrilo. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review, 52(3):471-501, 2010.
26. A. Rohde and A. Tsybakov. Estimation of high-dimensional low-rank matrices. Annals of Statistics, 39(2):887-930, 2011.
27. R. Salakhutdinov and N. Srebro. Collaborative filtering in a non-uniform world: Learning with the weighted trace norm. Technical Report abs/1002.2780v1, Toyota Institute of Technology, 2010.
28. N. Srebro. Learning with Matrix Factorizations. PhD thesis, MIT, 2004. Available online: http://ttic.uchicago.edu/nati/Publications/thesis.pdf.
29. N. Srebro, J. Rennie, and T. S. Jaakkola. Maximum-margin matrix factorization. In Neural Information Processing Systems (NIPS), Vancouver, Canada, December 2004.
30. N. Srebro, N. Alon, and T. S. Jaakkola. Generalization error bounds for collaborative prediction with low-rank matrices. In Neural Information Processing Systems (NIPS), Vancouver, Canada, December 2005.
31. S. J. Szarek. The finite dimensional basis problem with an appendix on nets of grassmann manifolds. Acta Mathematica, 151:153-179, 1983.
32. J. Tropp. User-friendly tail bounds for matrix martingales. Technical report, Caltech, April 2010.
33. R. Vershynin. A note on sums of independent random matrices after Ahlswede-Winter. Technical report, Univ. Michigan, December 2009.
34. R. Vershynin. Introduction to the non-asymptotic analysis of random matrices. Compressed Sensing: Theory and Applications, 2012. Available at http://www-personal.umich.edu/~romanv/papers/non-asymptotic-rmt-plain.pdf.
35. Y. Yang and A. Barron. Information-theoretic determination of minimax rates of convergence. Annals of Statistics, 27(5):1564-1599, 1999.
36. B. Yu. Assouad, Fano and Le Cam. In Festschrift for Lucien Le Cam, pages 423-435. Springer-Verlag, Berlin, 1997.