Multiple kernel learning, conic duality, and the SMO algorithm

Abstract

While classical kernel-based classifiers are based on a single kernel, in practice it is often desirable to base classifiers on combinations of multiple kernels. Lanckriet et al. (2004) considered conic combinations of kernel matrices for the support vector machine (SVM), and showed that the optimization of the coefficients of such a combination reduces to a convex optimization problem known as a quadratically-constrained quadratic program (QCQP). Unfortunately, current convex optimization toolboxes can solve this problem only for a small number of kernels and a small number of data points; moreover, the sequential minimal optimization (SMO) techniques that are essential in large-scale implementations of the SVM cannot be applied because the cost function is non-differentiable. We propose a novel dual formulation of the QCQP as a second-order cone programming problem, and show how to exploit the technique of Moreau-Yosida regularization to yield a formulation to which SMO techniques can be applied. We present experimental results that show that our SMO-based algorithm is significantly more efficient than the general-purpose interior point methods available in current optimization toolboxes.

DOI: 10.1145/1015330.1015424

Extracted Key Phrases

2 Figures and Tables

Showing 1-4 of 4 references

The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm

  • E D Andersen, K D Andersen
  • 2000
Highly Influential
8 Excerpts

Nonlinear programming

  • D Bertsekas
  • 1995
Highly Influential
6 Excerpts
Showing 1-10 of 716 extracted citations
0100200'04'05'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

1,568 Citations

Semantic Scholar estimates that this publication has received between 1,355 and 1,812 citations based on the available data.

See our FAQ for additional information.