Learning Non-Linear Combinations of Kernels

Abstract

This paper studies the general problem of learning kernels based on a polynomial combination of base kernels. We analyze this problem in the case of regression and the kernel ridge regression algorithm. We examine the corresponding learning kernel optimization problem, show how that minimax problem can be reduced to a simpler minimization problem, and prove that the global solution of this problem always lies on the boundary. We give a projection-based gradient descent algo-rithm for solving the optimization problem, shown empirically to converge in few iterations. Finally, we report the results of extensive experiments with this algo-rithm using several publicly available datasets demonstrating the effectiveness of our technique. 1