More generality in efficient multiple kernel learning
- 14 June 2009
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1065-1072
- https://doi.org/10.1145/1553374.1553510
Abstract
Recent advances in Multiple Kernel Learning (MKL) have positioned it as an attractive tool for tackling many supervised learning tasks. The development of efficient gradient descent based optimization schemes has made it possible to tackle large scale problems. Simultaneously, MKL based algorithms have achieved very good results on challenging real world applications. Yet, despite their successes, MKL approaches are limited in that they focus on learning a linear combination of given base kernels. In this paper, we observe that existing MKL formulations can be extended to learn general kernel combinations subject to general regularization. This can be achieved while retaining all the efficiency of existing large scale optimization algorithms. To highlight the advantages of generalized kernel learning, we tackle feature selection problems on benchmark vision and UCI databases. It is demonstrated that the proposed formulation can lead to better results not only as compared to traditional MKL but also as compared to state-of-the-art wrapper and filter methods for feature selection.Keywords
This publication has 12 references indexed in Scilit:
- Scalable training of L 1 -regularized log-linear modelsPublished by Association for Computing Machinery (ACM) ,2007
- Direct convex relaxations of sparse SVMPublished by Association for Computing Machinery (ACM) ,2007
- Multiclass multiple kernel learningPublished by Association for Computing Machinery (ACM) ,2007
- Learning The Discriminative Power-Invariance Trade-OffPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- Boosting Sex Identification PerformanceInternational Journal of Computer Vision, 2006
- Learning Convex Combinations of Continuously Parameterized Basic KernelsLecture Notes in Computer Science, 2005
- Column-generation boosting methods for mixture of kernelsPublished by Association for Computing Machinery (ACM) ,2004
- Multiple kernel learning, conic duality, and the SMO algorithmPublished by Association for Computing Machinery (ACM) ,2004
- Learning gender with support facesIeee Transactions On Pattern Analysis and Machine Intelligence, 2002
- The Theory of Max-Min and its Application to Weapons Allocation ProblemsPublished by Springer Science and Business Media LLC ,1967