Sparsity in Multiple Kernel Learning

@inproceedings{Koltchinskii2010SparsityIM,
  title={Sparsity in Multiple Kernel Learning},
  author={Vladimir Koltchinskii and Ming Yuan},
  year={2010}
}
The problem of multiple kernel learning based on penalized empirical risk minimization is discussed. The complexity penalty is determined jointly by the empirical L2 norms and the reproducing kernel Hilbert space (RKHS) norms induced by the kernels with a data-driven choice of regularization parameters. The main focus is on the case when the total number of kernels is large, but only a relatively small number of them is needed to represent the target function, so that the problem is sparse. The… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 58 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Sparse recovery in convex hulls via entropy penalization

  • V. KOLTCHINSKII
  • Ann. Statist. 37 1332–1359. MR2509076
  • 2009
2 Excerpts

Consistency of the group lasso and multiple kernel learning

  • F. BACH
  • J. Mach. Learn. Res. 9 1179–1225. MR2417268
  • 2008
3 Excerpts

Similar Papers

Loading similar papers…