Timezone: »

Learning Kernels Using Local Rademacher Complexity
Corinna Cortes · Marius Kloft · Mehryar Mohri

Sat Dec 07 07:00 PM -- 11:59 PM (PST) @ Harrah's Special Events Center, 2nd Floor

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 we give an efficient solution using existing learning kernel techniques, and another one that can be formulated as a DC-programming problem for which we describe a solution in detail. We also report the results of experiments with both algorithms in both binary and multi-class classification tasks.

Author Information

Corinna Cortes (Google Research)
Marius Kloft (TU Kaiserslautern)
Mehryar Mohri (Google Research & Courant Institute of Mathematical Sciences)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors