Sciweavers

Share
CVPR
2010
IEEE

Online-Batch Strongly Convex Multi Kernel Learning

11 years 9 months ago
Online-Batch Strongly Convex Multi Kernel Learning
Several object categorization algorithms use kernel methods over multiple cues, as they offer a principled approach to combine multiple cues, and to obtain state-of-theart performance. A general drawback of these strategies is the high computational cost during training, that prevents their application to large-scale problems. They also do not provide theoretical guarantees on their convergence rate. Here we present a Multiclass Multi Kernel Learning (MKL) algorithm that obtains state-of-the-art performance in a considerably lower training time. We generalize the standard MKL formulation to introduce a parameter that allows us to decide the level of sparsity of the solution. Thanks to this new setting, we can directly solve the problem in the primal formulation. We prove theoretically and experimentally that 1) our algorithm has a faster convergence rate as the number of kernels grow; 2) the training complexity is linear in the number of training examples; 3) very few iterations are e...
Francesco Orabona, Jie Luo, Barbara Caputo
Added 01 Apr 2010
Updated 14 May 2010
Type Conference
Year 2010
Where CVPR
Authors Francesco Orabona, Jie Luo, Barbara Caputo
Comments (0)
books