Rademacher Chaos Complexities for Learning the Kernel Problem

In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to investigation of the suprema of the Rademacher chaos process of order two over candidate kernels, which we refer to as Rademacher chaos complexity. Next, we show how to estimate the empirical Rademacher chaos complexity by well-established metric entropy integrals and pseudo-dimension of the set of candidate kernels. Our new methodology mainly depends on the principal theory of U-processes and entropy integrals. Finally, we establish satisfactory excess generalization bounds and misclassification error rates for learning Gaussian kernels and general radial basis kernels.

• Type: Journal
• Year: 2010
• Where: NECO
• Authors: Yiming Ying, Colin Campbell
• Keywords: Candidate Kernels, Entropy Integrals, NECO 2010, Rademacher Chaos