Learning Kernels Using Local Rademacher Complexity

Abstract

We use the notion of local Rademacher complexity to design new algorithms for learning kernels. Our algorithms thereby benefit from the sharper learning bounds based on that notion which, under certain general conditions, guarantee a faster convergence rate. We devise two new learning kernel algorithms: one based on a convex optimization problem for which… (More)

Topics

2 Figures and Tables

Statistics

02040201520162017
Citations per Year

Citation Velocity: 18

Averaging 18 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics