ResearchTrend.AI
The Local Rademacher Complexity of Lp-Norm Multiple Kernel Learning

The Local Rademacher Complexity of Lp-Norm Multiple Kernel Learning

Marius Kloft
Gilles Blanchard
ArXivPDFHTML

Papers citing "The Local Rademacher Complexity of Lp-Norm Multiple Kernel Learning"

3 / 3 papers shown
Title
Sparsity in multiple kernel learning
Sparsity in multiple kernel learning
V. Koltchinskii
M. Yuan
205
191
0
13 Nov 2012
L2 Regularization for Learning Kernels
L2 Regularization for Learning Kernels
Corinna Cortes
M. Mohri
Afshin Rostamizadeh
71
445
0
09 May 2012
Minimax-optimal rates for sparse additive models over kernel classes via convex programming
Minimax-optimal rates for sparse additive models over kernel classes via convex programming
Garvesh Raskutti
Martin J. Wainwright
Bin Yu
151
287
0
21 Aug 2010