Learning with the weighted trace-norm under arbitrary sampling distributions

Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011, NIPS 2011

Volumn , Issue , 2011, Pages

  Foygel, Rina ^a   Salakhutdinov, Ruslan ^b   Shamir, Ohad ^c   Srebro, Nathan ^d  

^a UNIVERSITY OF CHICAGO   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c MICROSOFT RESEARCH   (United States)

^d TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL DISTRIBUTIONS; PRODUCT DISTRIBUTIONS; SAMPLING DISTRIBUTION; TRACE-NORMS;

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

References (20)

1. M. Fazel. Matrix rank minimization with applications. PhD Thesis, Stanford University, 2002.
2. N. Srebro, J. Rennie, and T. Jaakkola. Maximum-margin matrix factorization. Advances in Neural Information Processing Systems, 17, 2004.
3. R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. Advances in Neural Information Processing Systems, 20, 2007.
4. F. Bach. Consistency of trace-norm minimization. Journal of Machine Learning Research, 9:1019-1048, 2008.
5. E. Candès and T. Tao. The power of convex relaxation: Near-optimal matrix completion. IEEE Trans. Inform. Theory, 56(5):2053-2080, 2009.
6. N. Srebro and A. Shraibman. Rank, trace-norm and max-norm. 18th Annual Conference on Learning Theory (COLT), pages 545-560, 2005.
7. B. Recht. A simpler approach to matrix completion. arXiv:0910.0651, 2009.
8. R. Keshavan, A. Montanari, and S. Oh. Matrix completion from noisy entries. Journal of Machine Learning Research, 11:2057-2078, 2010.
9. V. Koltchinskii, A. Tsybakov, and K. Lounici. Nuclear norm penalization and optimal rates for noisy low rank matrix completion. arXiv:1011.6256, 2010.
10. S. Negahban and M.Wainwright. Restricted strong convexity and weighted matrix completion: Optimal bounds with noise. arXiv:1009.2118, 2010.
11. R. Foygel and N. Srebro. Concentration-based guarantees for low-rank matrix reconstruction. 24th Annual Conference on Learning Theory (COLT), 2011.
12. R. Salakhutdinov and N. Srebro. Collaborative Filtering in a Non-Uniform World: Learning with theWeighted Trace Norm. Advances in Neural Information Processing Systems, 23, 2010.
13. O. Shamir and S. Shalev-Shwartz. Collaborative filtering with the trace norm: Learning, bounding, and transducing. 24th Annual Conference on Learning Theory (COLT), 2011.
14. P. Bartlett and S. Mendelson. Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3:463-482, 2002.
15. J.A. Tropp. User-friendly tail bounds for sums of random matrices. arXiv:1004.4389, 2010.
16. J. Bennett and S. Lanning. The netflix prize. In Proceedings of KDD Cup and Workshop, volume 2007, page 35. Citeseer, 2007.
17. MovieLens Dataset. Available at http://www.grouplens.org/node/73. 2006.
18. Yehuda Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. ACM Int. Conference on Knowledge Discovery and Data Mining (KDD'08), pages 426-434, 2008.
19. J. Lee, B. Recht, R. Salakhutdinov, N. Srebro, and J. Tropp. Practical Large-Scale Optimization for Max-Norm Regularization. Advances in Neural Information Processing Systems, 23, 2010.
20. R. Mazumder, T. Hastie, and R. Tibshirani. Spectral regularization algorithms for learning large incomplete matrices. Journal of Machine Learning Research, 11:2287-2322, 2010.