Training Lp norm multiple kernel learning in the primal

Zhizheng Liang

doi:10.1016/j.neunet.2013.05.003

Training Lp norm multiple kernel learning in the primal

2013-10-01

11

PRE

AI

DOI：10.1016/j.neunet.2013.05.003

Original

Original request for help

Save

Abstract

En 中文

Some multiple kernel learning (MKL) models are usually solved by utilizing the alternating optimization method where one alternately solves SVMs in the dual and updates kernel weights. Since the dual and primal optimization can achieve the same aim, it is valuable in exploring how to perform Lp norm MKL in the primal. In this paper, we propose an Lp norm multiple kernel learning algorithm in the primal where we resort to the alternating optimization method: one cycle for solving SVMs in the primal by using the preconditioned conjugate gradient method and other cycle for learning the kernel weights. It is interesting to note that the kernel weights in our method can obtain analytical solutions. Most importantly, the proposed method is well suited for the manifold regularization framework in the primal since solving LapSVMs in the primal is much more effective than solving LapSVMs in the dual. In addition, we also carry out theoretical analysis for multiple kernel learning in the primal in terms of the empirical Rademacher complexity. It is found that optimizing the empirical Rademacher complexity may obtain a type of kernel weights. The experiments on some datasets are carried out to demonstrate the feasibility and effectiveness of the proposed method. (C) 2013 Elsevier Ltd. All rights reserved.

Keywords:

Multiple kernel learning

Manifold regularization

Primal optimization

Empirical Rademacher complexity

Data classification

Training Lp norm multiple kernel learning in the primal

Abstract

Journal

Organization