L2 Regularization for Learning Kernels

Abstract

The choice of the kernel is critical to the success of many learning algorithms but it is typically left to the user. Instead, the training data can be used to learn the kernel by selecting it out of a given family, such as that of non-negative linear combinations of p base kernels, constrained by a trace or L1 regularization. This paper studies the problem of learning kernels with the same family of kernels but with an L2 regularization instead, and for regression problems. We analyze the problem of learning kernels with ridge regression. We derive the form of the solution of the optimization problem and give an efficient iterative algorithm for computing that solution. We present a novel theoretical analysis of the problem based on stability and give learning bounds for orthogonal kernels that contain only an additive term O(pp/m) when compared to the standard kernel ridge regression stability bound. We also report the results of experiments indicating that L1 regularization can lead to modest improvements for a small number of kernels, but to performance degradations in larger-scale cases. In contrast, L2 regularization never degrades performance and in fact achieves significant improvements with a large number of kernels.

Appears in Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI2009)

References in corpus (1)

• Exploring Large Feature Spaces with Hierarchical Multiple Kernel Learning

Cited by in corpus (10)

• The Local Rademacher Complexity of Lp-Norm Multiple Kernel Learning
• A Unifying View of Multiple Kernel Learning
• Bayesian Efficient Multiple Kernel Learning
• Multiple Kernel Learning from Noisy Labels by Stochastic Programming
• Regularization Strategies and Empirical Bayesian Learning for MKL
• Non-Sparse Regularization for Multiple Kernel Learning
• Fast Convergence Rate of Multiple Kernel Learning with Elastic-net Regularization
• Fast Learning Rate of lp-MKL and its Minimax Optimality
• Sparse Multiple Kernel Learning with Geometric Convergence Rate
• Sharp Convergence Rate and Support Consistency of Multiple Kernel Learning with Sparse and Dense Regularization