Collaborative filtering in a non-uniform world: Learning with the weighted trace norm

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Salakhutdinov, Ruslan ^a   Srebro, Nathan ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

MATRIX; MATRIX COMPLETION; NETFLIX; NON-UNIFORM; NONUNIFORM SAMPLING; REGULARISATION; REGULARIZER; TRACE-NORMS;

COLLABORATIVE FILTERING;

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

References (21)

1. J. Abernethy, F. Bach, T. Evgeniou, and J.P. Vert. A new approach to collaborative filtering: Operator estimation with spectral regularization. Journal of Machine Learning Research, 10:803-826, 2009.
2. S. Burer and R.D.C. Monteiro. Local minima and convergence in low-rank semidefinite programming. Mathematical Programming, 103(3):427-444, 2005.
3. J.F. Cai, E.J. Candès, and Z. Shen. A Singular Value Thresholding Algorithm for Matrix Completion. SIAM Journal on Optimization, 20:1956, 2010.
4. E.J. Candes and Y. Plan. Matrix completion with noise. Proceedings of the IEEE (to appear), 2009.
5. E.J. Candes and B. Recht. Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9, 2009.
6. E.J. Candes and T. Tao. The power of convex relaxation: Near-optimal matrix completion. IEEE Trans. Inform. Theory (to appear), 2009.
7. M. Fazel, H. Hindi, and S.P. Boyd. A rank minimization heuristic with application to minimum order system approximation. In Proceedings American Control Conference, volume 6, 2001.
8. Yehuda Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In ACM SIGKDD, pages 426-434, 2008.
9. Z. Liu and L. Vandenberghe. Interior-point method for nuclear norm approximation with application to system identification. SIAM Journal on Matrix Analysis and Applications, 31(3):1235-1256, 2009.
10. S. Ma, D. Goldfarb, and L. Chen. Fixed point and Bregman iterative methods for matrix rank minimization. Mathematical Programming, pages 1-33, 2009.
11. R. Mazumder, T. Hastie, and R. Tibshirani. Spectral Regularization Algorithms for Learning Large IncompleteMatrices. Journal of Machine Learning Research, 11:2287-2322, 2010.
12. R. Meka, P. Jain, and I. S. Dhillon. Matrix completion from power-law distributed samples. In Advances in Neural Information Processing Systems, volume 21, 2009.
13. B. Recht. A simpler approach to matrix completion. preprint, available from author'swebpage, 2009.
14. J.D.M. Rennie and N. Srebro. Fast maximum margin matrix factorization for collaborative prediction. In ICML, page 719, 2005.
15. Ruslan Salakhutdinov and Andriy Mnih. Probabilistic matrix factorization. In Advances in Neural Information Processing Systems, volume 20, 2008.
16. N. Srebro, N. Alon, and T. Jaakkola. Generalization error bounds for collaborative prediction with low-rank matrices. In Advances In Neural Information Processing Systems 17, 2005.
17. N. Srebro, J. Rennie, and T. Jaakkola. Maximum margin matrix factorization. In Advances In Neural Information Processing Systems 17, 2005.
18. N. Srebro and A. Shraibman. Rank, trace-norm and max-norm. In COLT, 2005.
19. Gábor Takács, István Pilászy, Bottyán Németh, and Domonkos Tikk. Scalable collaborative filtering approaches for large recommender systems. Journal of Machine Learning Research, 10:623-656, 2009.
20. R. Tomioka, T. Suzuki,M. Sugiyama, and H. Kashima. A fast augmented lagrangian algorithm for learning low-rank matrices. In ICML, pages 1087-1094, 2010.
21. M.Weimer, A. Karatzoglou, and A. Smola. Improving maximum margin matrix factorization. Machine Learning, 72(3):263-276, 2008.