Probabilistic low-rank matrix completion on finite alphabets

Advances in Neural Information Processing Systems

Volumn 2, Issue January, 2014, Pages 1727-1735

  Lafond, Jean ^a   Klopp, Olga ^b   Moulines, Éric ^a   Salmon, Joseph ^a  

^a PARISTECH   (France)

^b CREST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLASSIFIERS; COLLABORATIVE FILTERING; IMAGE PROCESSING; INFORMATION SCIENCE; LEARNING SYSTEMS; RECOMMENDER SYSTEMS;

DIMENSIONALITY REDUCTION; HIGH-DIMENSIONAL; KULLBACK LEIBLER DIVERGENCE; LOW-RANK MATRICES; LOW-RANK MATRIX COMPLETIONS; MATRIX COMPLETION PROBLEMS; MULTI-CLASS CLASSIFICATION; SAMPLING SCHEMES;

CLASSIFICATION (OF INFORMATION);

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

References (22)

1. R. Bhatia. Matrix analysis, Volume 169 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1997.
2. J. Bobadilla, F. Ortega, A. Hernando, and A. Gutiérrez. Recommender systems survey. Knowledge-Based Systems, 46(0): 109-132, 2013.
3. S. Boyd and L. Vandenberghe. Convex optimization. Cambridge University Press, Cambridge, 2004.
4. J-F. Cai, E. J. Candès, and Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4): 1956-1982, 2010.
5. T. T. Cai and W-X. Zhou. Matrix completion via max-norm constrained optimization. CoRR, abs/1303.0341, 2013.
6. T. T. Cai and W-X. Zhou. A max-norm constrained minimization approach to 1-bit matrix completion. J. Mach. Learn. Res., 14: 3619-3647, 2013.
7. E. J. Candès and Y. Plan. Matrix completion with noise. Proceedings of the IEEE, 98(6): 925-936, 2010.
8. M. A. Davenport, Y. Plan, E. van den Berg, and M. Wootters. 1-bit matrix completion. CoRR, abs/1209.3672, 2012.
9. M. Dudík, Z. Harchaoui, and J. Malick. Lifted coordinate descent for learning with trace-norm regularization. In AISTATS, 2012.
10. M. Fazel. Matrix rank minimization with applications. PhD thesis, Stanford University, 2002.
11. R. Foygel, R. Salakhutdinov, O. Shamir, and N. Srebro. Learning with the weighted trace-norm under arbitrary sampling distributions. In NIPS, pages 2133-2141, 2011.
12. G. H. Golub and C. F. van Loan. Matrix computations. Johns Hopkins University Press, Baltimore, MD, fourth edition, 2013.
13. D. Gross. Recovering low-rank matrices from few coefficients in any basis. Information Theory, IEEE Transactions on, 57(3): 1548-1566, 2011.
14. Z. Harchaoui, A. Juditsky, and A. Nemirovski. Conditional gradient algorithms for norm-regularized smooth convex optimization. Mathematical Programming, pages 1-38, 2014.
15. R. H. Keshavan, A. Montanari, and S. Oh. Matrix completion from noisy entries. J. Mach. Learn. Res., 11: 2057-2078, 2010.
16. O. Klopp. Noisy low-rank matrix completion with general sampling distribution. Bernoulli, 2(1): 282-303, 02 2014.
17. V. Koltchinskii, A. B. Tsybakov, and K. Lounici. Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion. Ann. Statist., 39(5): 2302-2329, 2011.
18. Y. Koren, R. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. Computer, 42(8): 30-37, 2009.
19. R. Mazumder, T. Hastie, and R. Tibshirani. Spectral regularization algorithms for learning large incomplete matrices. J. Mach. Learn. Res., 11: 2287-2322, 2010.
20. S. Negahban and M. J. Wainwright. Restricted strong convexity and weighted matrix completion: optimal bounds with noise. J. Mach. Learn. Res., 13: 1665-1697, 2012.
21. B. Recht and C. Ré. Parallel stochastic gradient algorithms for large-scale matrix completion. Mathematical Programming Computation, 5(2): 201-226, 2013.
22. A. Todeschini, F. Caron, and M. Chavent. Probabilistic low-rank matrix completion with adaptive spectral regularization algorithms. In NIPS, pages 845-853, 2013.