A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization

Journal of Machine Learning Research

Volumn 10, Issue , 2009, Pages 803-826

  Abernethy, Jacob ^a   Bach, Francis ^b   Evgeniou, Theodoros ^c   Vert, Jean Philippe ^d,e  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c INSEAD   (France)

^d PSL RESEARCH UNIVERSITY   (France)

^e INSERM U900   (France)

Author keywords

Collaborative filtering; Kernel methods; Matrix completion; Spectral regularization

Indexed keywords

COLLABORATIVE FILTERING; DATA SETS; ESTIMATION METHODS; GENERAL APPROACHES; KERNEL METHODS; LINEAR OPERATORS; LOW-RANK DECOMPOSITIONS; MATRIX COMPLETION; MATRIXES; MULTI-TASK LEARNING; NEW APPROACHES; REPRESENTER THEOREMS; SPECTRAL REGULARIZATION;

LEARNING SYSTEMS; MATHEMATICAL OPERATORS; PHOTOMAPPING; SIGNAL FILTERING AND PREDICTION; STATISTICAL TESTS;

LEARNING ALGORITHMS;

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

References (29)

1. J. Abernethy, F. Bach, T. Evgeniou, and J.-P. Vert. Low-rank matrix factorization with attributes. Technical Report N24/06/MM, Ecole des Mines de Paris, 2006.
2. Y. Amit, M. Fink, N. Srebro, and S. Ullman. Uncovering shared structures in multiclass classification. In Z. Ghahramani, editor, ICML '07: Proceedings of the 24th International Conference on Machine Learning, pages 17-24, New York, NY, USA, 2007. ACM.
3. A. Argyriou, T. Evgeniou, and M. Pontil. Convex multi-task feature learning. Mach. Learn., 73(3): 243-272, 2008.
4. N. Aronszajn. Theory of reproducing kernels. Trans. Am. Math. Soc., 68:337 - 404, 1950.
5. F. R. Bach. Consistency of trace norm minimization. J. Mach. Learn. Res., 9:1019-1048, 2008.
6. F. R. Bach and M. I. Jordan. Predictive low-rank decomposition for kernel methods. In ICML '05: Proceedings of the 22nd International Conference on Machine Learning, pages 33-40, New York, NY, USA, 2005. ACM.
7. F. R. Bach, G. R. G. Lanckriet, and M. I. Jordan. Multiple kernel learning, conic duality, and the SMO algorithm. In ICML '04: Proceedings of the Twenty-first International Conference on Machine Learning, page 6, New York, NY, USA, 2004. ACM.
8. F. R. Bach, R. Thibaux, and M. I. Jordan. Computing regularization paths for learning multiple kernels. In L. K. Saul, Y Weiss, and L. Bottou, editors, Adv. Neural. Inform. Process Syst. 17, pages 73-80, Cambridge, MA, 2005. MIT Press.
9. A. Berlinet and C. Thomas-Agnan. Reproducing Kernel Hilbert Spaces in Probability and Statistics. Kluwer Academic Publishers, 2003.
10. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge Univ. Press, 2003.
11. J. S. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In 14th Conference on Uncertainty in Artificial Intelligence, pages 43-52, Madison, W.I., 1998. Morgan Kaufman.
12. H. Brezis. Analyse Fonctionnelle. Masson, 1980.
13. S. A. Burer and C. Choi. Computational enhancements in low-rank semidefinite programming. Optimization Methods and Software, 21:493-512, 2006.
14. S. A. Burer and R, D. C. Monteiro. Local minima and convergence in low-rank semidefinite programming. Mathematical Programming, 103:427-444, 2005.
15. T. Evgeniou, C. Micchelli, and M. Pontil. Learning multiple tasks with kernel methods. J. Much. Learn. Res., 6:615-637, 2005.
16. M. Fazel, H. Hindi, and S. Boyd. A rank minimization heuristic with application to minimum order system approximation. In Proceedings of the 2001 American Control Conference, volume 6, pages 4734-4739, 2001.
17. S. Fine and K. Scheinberg. Efficient SVM training using low-rank kernel representations. J. Mach. Learn. Res., 2:243-264, 2001.
18. G. H. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins University Press, 1996.
19. D. Heckerman, D. M. Chickering, C. Meek, R. Rounthwaite, and C. Kadie. Dependency networks for inference, collaborative filtering, and data visualization. J. Mach. Learn. Res., 1:49-75, 2000.
20. L. Jacob and J.-R Vert. Efficient peptide-MHC-I binding prediction for alleles with few known binders. Bioinformatics, 24(3):358-366, Feb 2008.
21. G. R. G. Lanckriet, N. Cristianini, L. E1 Ghaoui, P. Bartlett, and M. I. Jordan. Learning the kernel matrix with semidefinite programming. J. Mach. Learn. Res., 5:27-72, 2004.
22. A. S. Lewis and H. S. Sendov. Twice differentiable spectral functions. SIAM J. Mat. Anal. App., 23 (2):368-386, 2002.
23. J. D. M. Rennie and N. Srebro. Fast maximum margin matrix factorization for collaborative prediction. In Proceedings of the 22nd International Conference on Machine Learning, pages 713-719, New York, NY, USA, 2005. ACM Press.
24. R. Salakhutdinov, A. Mnih, and G. Hinton. Restricted boltzmann machines for collaborative filtering. In ICML '07: Proceedings of the 24th International Conference on Machine Learning, pages 791-798, New York, NY, USA, 2007. ACM.
25. B. Schölkopf, R. Herbrich, and A. J. Smola. A generalized representer theorem. In Proceedings of the 14th Annual Conference on Computational Learning Theory, volume 2011 of Lecture Notes in Computer Science, pages A16-A26, Berlin / Heidelberg, 2001. Springer.
26. J. Shawe-Taylor and N. Cristianini. Kernel Methods for Pattern Analysis. Cambridge University Press, 2004.
27. N. Srebro and T. Jaakkola. Weighted low-rank approximations. In T. Fawcett and N. Mishra, editors, Proceedings of the Twentieth International Conference on Machine Learning, pages 720-727. AAAI Press, 2003.
28. N. Srebro, J. D. M. Rennie, and T. S. Jaakkola. Maximum-margin matrix factorization. In L. K. Saul, Y Weiss, and L. Bottou, editors, Adv. Neural. Inform. Process Syst. 17, pages 1329-1336, Cambridge, MA, 2005. MIT Press.
29. G. W Stewart and J. Sun. Matrix Perturbation Theory. Academic Press, 1990.