lp-norm multiple kernel learning with low-rank kernels

Alain Rakotomamonjy

doi:10.1016/j.neucom.2014.06.019

Return

lp-norm multiple kernel learning with low-rank kernels

2014-11-01

PRE

Alain Rakotomamonjy *

Sukalpa Chanda

DOI：10.1016/j.neucom.2014.06.019

Original

Original request for help

Save

Abstract

En 中文

Kernel-based learning algorithms are well-known to poorly scale to large-scale applications. For such large tasks, a common solution is to use low-rank kernel approximation. Several algorithms and theoretical analyses have already been proposed in the literature, for low-rank Support Vector Machine or low-rank Kernel Ridge Regression but not for multiple kernel learning. The proposed method bridges this gap by addressing the problem of scaling l(p)-norm multiple kernel for large learning tasks using low-rank kernel approximations. Our contributions stand on proposing a novel optimization problem, which takes advantage of the low-rank kernel approximations and on introducing a proximal gradient algorithm for solving that optimization problem. We also provide partial theoretical results on the impact of the low-rank approximations over the kernel combination weights. Experimental evidences show that the proposed approach scales better than the SMO-MKL algorithm for tasks involving about several hundred thousands of examples. Experimental comparisons with interior point methods also prove the efficiency of the algorithm we propose. (C) 2014 Elsevier B.V. All rights reserved.

Keywords:

Multiple kernel learning

Low-rank approximation

Kernels

SVM

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.