Unifying framework for fast learning rate of non-sparse Multiple Kernel Learning

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

Volumn , Issue , 2011, Pages

  Suzuki, Taiji ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

FAST LEARNING; GENERAL CLASS; GENERALIZATION ERROR BOUNDS; LEARNING RATES; MIXED-NORM; MULTIPLE KERNEL LEARNING; NUMERICAL EXPERIMENTS; REGULARISATION; SPARSE MULTIPLES; SPARSE REGULARIZATIONS;

LEARNING ALGORITHMS;

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

References (36)

1. J. Aflalo, A. Ben-Tal, C. Bhattacharyya, J. S. Nath, and S. Raman. Variable sparsity kernel learning. Journal of Machine Learning Research, 12:565-592, 2011.
2. A. Argyriou, R. Hauser, C. A. Micchelli, and M. Pontil. A DC-programming algorithm for kernel selection. In the 23st ICML, pages 41-48, 2006.
3. F. R. Bach. Consistency of the group lasso and multiple kernel learning. Journal of Machine Learning Research, 9:1179-1225, 2008.
4. F. R. Bach. Exploring large feature spaces with hierarchical multiple kernel learning. In Advances in Neural Information Processing Systems 21, pages 105-112, 2009.
5. F. R. Bach, G. Lanckriet, and M. Jordan. Multiple kernel learning, conic duality, and the SMO algorithm. In the 21st ICML, pages 41-48, 2004.
6. P. Bartlett, O. Bousquet, and S. Mendelson. Local Rademacher complexities. The Annals of Statistics, 33:1487-1537, 2005.
7. C. Bennett and R. Sharpley. Interpolation of Operators. Academic Press, Boston, 1988.
8. 2 regularization for learning kernels. In UAI 2009, 2009.
9. C. Cortes, M. Mohri, and A. Rostamizadeh. Learning non-linear combinations of kernels. In Advances in Neural Information Processing Systems 22, pages 396-404, 2009.
10. C. Cortes, M. Mohri, and A. Rostamizadeh. Generalization bounds for learning kernels. In the 27th ICML, pages 247-254, 2010.
11. D. E. Edmunds and H. Triebel. Function Spaces, Entropy Numbers, Differential Operators. Cambridge University Press, Cambridge, 1996.
12. G. S. Kimeldorf and G. Wahba. Some results on Tchebycheffian spline functions. Journal of Mathematical Analysis and Applications, 33:82-95, 1971.
13. p-norm multiple kernel learning, 2011. arXiv:1103.0790.
14. p-norm multiple kernel learning. In Advances in Neural Information Processing Systems 22, pages 997-1005, 2009.
15. p-norm multiple kernel learning. Journal of Machine Learning Research, 12:953-997, 2011.
16. M. Kloft, U. Rückert, and P. L. Bartlett. A unifying view of multiple kernel learning. In ECML/PKDD, 2010.
17. V. Koltchinskii. Local Rademacher complexities and oracle inequalities in risk minimization. The Annals of Statistics, 34:2593-2656, 2006.
18. V. Koltchinskii and M. Yuan. Sparse recovery in large ensembles of kernel machines. In COLT, pages 229-238, 2008.
19. V. Koltchinskii and M. Yuan. Sparsity in multiple kernel learning. The Annals of Statistics, 38(6):3660-3695, 2010.
20. G. Lanckriet, N. Cristianini, L. E. Ghaoui, P. Bartlett, and M. Jordan. Learning the kernel matrix with semi-definite programming. Journal of Machine Learning Research, 5:27-72, 2004.
21. L. Meier, S. van de Geer, and P. Bühlmann. High-dimensional additive modeling. The Annals of Statistics, 37(6B):3779-3821, 2009.
22. C. A. Micchelli and M. Pontil. Learning the kernel function via regularization. Journal of Machine Learning Research, 6:1099-1125, 2005.
23. C. S. Ong, A. J. Smola, and R. C.Williamson. Learning the kernel with hyperkernels. Journal of Machine Learning Research, 6:1043-1071, 2005.
24. G. Raskutti, M. Wainwright, and B. Yu. Minimax-optimal rates for sparse additive models over kernel classes via convex programming. Technical report, 2010. arXiv:1008.3654.
25. B. Schölkopf and A. J. Smola. Learning with Kernels. MIT Press, Cambridge, MA, 2002.
26. J. Shawe-Taylor. Kernel learning for novelty detection. In NIPS 2008 Workshop on Kernel Learning: Automatic Selection of Optimal Kernels, Whistler, 2008.
27. N. Srebro and S. Ben-David. Learning bounds for support vector machines with learned kernels. In COLT, pages 169-183, 2006.
28. I. Steinwart. Support Vector Machines. Springer, 2008.
29. I. Steinwart, D. Hush, and C. Scovel. Optimal rates for regularized least squares regression. In COLT, 2009.
30. T. Suzuki and R. Tomioka. Spicymkl: A fast algorithm for multiple kernel learning with thousands of kernels. Machine Learning, 85(1):77-108, 2011.
31. R. Tomioka and T. Suzuki. Sparsity-accuracy trade-off in MKL. In NIPS 2009 Workshop: Understanding Multiple Kernel Learning Methods, Whistler, 2009.
32. S. van de Geer. Empirical Processes in M-Estimation. Cambridge University Press, 2000.
33. A.W. van der Vaart and J. A.Wellner. Weak Convergence and Empirical Processes: With Applications to Statistics. Springer, New York, 1996.
34. M. Varma and B. R. Babu. More generality in efficient multiple kernel learning. In the 26th ICML, pages 1065-1072, 2009.
35. Y. Ying and C. Campbell. Generalization bounds for learning the kernel. In COLT, 2009.
36. M. Yuan and Y. Lin. Model selection and estimation in regression with grouped variables. Journal of The Royal Statistical Society Series B, 68(1):49-67, 2006.