A Unifying View of Multiple Kernel Learning

Abstract

Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different formulations of objectives and varying regularization strategies. In this paper we present a unifying general optimization criterion for multiple kernel learning and show how existing formulations are subsumed as special cases. We also derive the criterion's dual representation, which is suitable for general smooth optimization algorithms. Finally, we evaluate multiple kernel learning in this framework analytically using a Rademacher complexity bound on the generalization error and empirically in a set of experiments.

References in corpus (1)

• L2 Regularization for Learning Kernels

Cited by in corpus (5)

• Fast learning rate of multiple kernel learning: Trade-off between sparsity and smoothness
• Regularization Strategies and Empirical Bayesian Learning for MKL
• Fast Convergence Rate of Multiple Kernel Learning with Elastic-net Regularization
• Efficient Multi-Template Learning for Structured Prediction
• Fast Learning Rate of lp-MKL and its Minimax Optimality