Generalization bounds for learning kernels

ICML 2010 - Proceedings, 27th International Conference on Machine Learning

Volumn , Issue , 2010, Pages 247-254

  Cortes, Corinna ^a   Mohri, Mehryar ^a   Rostamizadeh, Afshin ^b  

^a GOOGLE INC   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL ANALYSIS; CONVEX COMBINATIONS; GENERALIZATION BOUND; GENERALIZATION ERROR; LEARNING KERNELS; LINEAR FUNCTIONS; RADEMACHER COMPLEXITY;

LEARNING SYSTEMS;

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

References (26)

1. Anthony, Martin and Bartlett, Peter L. Neural Network Learning: Theoretical Foundations. Cambridge University Press, 1999.
2. Argyriou, Andreas, Micchelli, Charles, and Pontil, Massimiliano. Learning convex combinations of continuously parameterized basic kernels. In COLT, 2005.
3. Argyriou, Andreas, Hauser, Raphael, Micchelli, Charles, and Pontil, Massimiliano. A DC-programming algorithm for kernel selection. In ICML, 2006.
4. Bach, F. Exploring large feature spaces with hierarchical multiple kernel learning. In NIPS 2009, 2008.
5. Bartlett, Peter L. and Mendelson, Shahar. Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3:2002, 2002.
6. Boser, Bernhard, Guyon, Isabelle, and Vapnik, Vladimir. A training algorithm for optimal margin classifiers. In COLT, 1992.
7. Bousquet, Olivier and Herrmann, Daniel J. L. On the complexity of learning the kernel matrix. In NIPS, 2002.
8. Cortes, Corinna and Vapnik, Vladimir. Support-Vector Networks. Machine Learning, 20(3), 1995.
9. 2 regularization for learning kernels. In UAI 2009, 2009a.
10. Cortes, Corinna, Mohri, Mehryar, and Rostamizadeh, Afshin. Learning non-linear combinations of kernels. In NIPS 2009. MIT Press, 2009b.
11. Cortes, Corinna, Mohri, Mehryar, and Rostamizadeh, Afshin. Two-stage learning kernel methods. In ICML 2010, 2010.
12. Devroye, Luc and Lugosi, Gábor. Lower bounds in pattern recognition and learning. Pattern Recognition, 28(7), 1995.
13. Kakade, Sham M., Sridharan, Karthik, and Tewari, Ambuj. On the complexity of linear prediction: Risk bounds, margin bounds, and regularization. In NIPS, 2009.
14. Kakade, Sham M., Shalev-Shwartz, Shai, and Tewari, Ambuj. Applications of strong convexity-strong smoothness duality to learning with matrices, 2010. arXiv:0910.0610vl.
15. Koltchinskii, V. and Panchenko, D. Empirical margin distributions and bounding the generalization error of combined classifiers. Annals of Statistics, 30, 2002.
16. Koltchinskii, Vladimir and Yuan, Ming. Sparse recovery in large ensembles of kernel machines on-line learning and bandits. In COLT, 2008.
17. Lanckriet, Gert, Cristianini, Nello, Bartlett, Peter, Ghaoui, Laurent El, and Jordan, Michael. Learning the kernel matrix with semidefinite programming. JMLR, 5, 2004.
18. Lewis, Darrin P., Jebara, Tony, and Noble, William Stafford. Non-stationary kernel combination. In ICML, 2006.
19. Micchelli, Charles and Pontil, Massimiliano. Learning the kernel function via regularization. JMLR, 6, 2005.
20. Ong, Cheng Soon, Smola, Alex, and Williamson, Robert. Learning the kernel with hyperkernels. JMLR, 6, 2005.
21. Schölkopf, Bernhard and Smola, Alex. Learning with Kernels. MIT Press: Cambridge, MA, 2002.
22. Shawe-Taylor, John and Cristianini, Nello. Kernel Methods for Pattern Analysis. Cambridge Univ. Press, 2004.
23. Srebro, Nathan and Ben-David, Shai. Learning bounds for support vector machines with learned kernels. In COLT, 2006.
24. Vapnik, Vladimir N. Statistical Learning Theory. John Wiley & Sons, 1998.
25. Ying, Yiming and Campbell, Colin. Generalization bounds for learning the kernel problem. In COLT, 2009.
26. Zien, Alexander and Ong, Cheng Soon. Multiclass multiple kernel learning. In ICML 2007, 2007.