Proceedings Article10.1145/1553374.1553510
More generality in efficient multiple kernel learning
Manik Varma,Bodla Rakesh Babu +1 more
- 14 Jun 2009
- pp 1065-1072
TL;DR: It is observed that existing MKL formulations can be extended to learn general kernel combinations subject to general regularization while retaining all the efficiency of existing large scale optimization algorithms.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
Multiple Kernel Learning Algorithms
Mehmet Gönen,Ethem Alpaydin +1 more
TL;DR: Overall, using multiple kernels instead of a single one is useful and it is believed that combining kernels in a nonlinear or data-dependent way seems more promising than linear combination in fusing information provided by simple linear kernels, whereas linear methods are more reasonable when combining complex Gaussian kernels.
•Posted Content
A Survey on Multi-view Learning
Chang Xu,Dacheng Tao,Chao Xu +2 more
TL;DR: By exploring the consistency and complementary properties of different views, multi-View learning is rendered more effective, more promising, and has better generalization ability than single-view learning.
•Proceedings Article
Optimization for Machine Learning
Suvrit Sra,Sebastian Nowozin,Stephen J. Wright +2 more
- 30 Sep 2011
TL;DR: This book captures the state of the art of the interaction between optimization and machine learning in a way that is accessible to researchers in both fields and will enrich the ongoing cross-fertilization between the machine learning community and these other fields, and within the broader optimization community.
1K
Action bank: A high-level representation of activity in video
Sreemanananth Sadanand,Jason J. Corso +1 more
- 16 Jun 2012
TL;DR: Action bank as discussed by the authors is composed of many individual action detectors sampled broadly in semantic space as well as viewpoint space, which is constructed to be semantically rich and even when paired with simple linear SVM classifiers is capable of highly discriminative performance.
•Dissertation
Action Bank: A High-Level Representation of Activity in Video
Sreemanananth Sadanand
- 01 Jan 2012
695
References
Choosing Multiple Parameters for Support Vector Machines
TL;DR: The problem of automatically tuning multiple parameters for pattern recognition Support Vector Machines (SVMs) is considered by minimizing some estimates of the generalization error of SVMs using a gradient descent algorithm over the set of parameters.
Learning the Kernel Matrix with Semidefinite Programming
Gert R. G. Lanckriet,Nello Cristianini,Peter L. Bartlett,Laurent El Ghaoui,Michael I. Jordan +4 more
TL;DR: This paper shows how the kernel matrix can be learned from data via semidefinite programming (SDP) techniques and leads directly to a convex method for learning the 2-norm soft margin parameter in support vector machines, solving an important open problem.
Multiple kernel learning, conic duality, and the SMO algorithm
Francis Bach,Gert R. G. Lanckriet,Michael I. Jordan +2 more
- 04 Jul 2004
TL;DR: Experimental results are presented that show that the proposed novel dual formulation of the QCQP as a second-order cone programming problem is significantly more efficient than the general-purpose interior point methods available in current optimization toolboxes.
On Kernel-Target Alignment
Nello Cristianini,John Shawe-Taylor,André Elisseeff,Jaz S. Kandola +3 more
- 03 Jan 2001
TL;DR: The notion of kernel-alignment, a measure of similarity between two kernel functions or between a kernel and a target function, is introduced, giving experimental results showing that adapting the kernel to improve alignment on the labelled data significantly increases the alignment on a test set, giving improved classification accuracy.
Scalable training of L1-regularized log-linear models
Galen Andrew,Jianfeng Gao +1 more
- 20 Jun 2007
TL;DR: This work presents an algorithm Orthant-Wise Limited-memory Quasi-Newton (OWL-QN), based on L-BFGS, that can efficiently optimize the L1-regularized log-likelihood of log-linear models with millions of parameters.