A convex parametrization of a new class of universal kernel functions
From MaRDI portal
Recommendations
Cites work
- 10.1162/153244302760200687
- Algorithms for learning kernels based on centered alignment
- An approximation theory approach to learning with \(\ell^1\) regularization
- scientific article; zbMATH DE number 5957287 (Why is no real title available?)
- scientific article; zbMATH DE number 5968915 (Why is no real title available?)
- Learning the kernel matrix with semidefinite programming
- Machine learning. Translated by Simone Linke.
- Mercer theorem for RKHS on noncompact sets
- Multiple kernel learning algorithms
- On the history of multivariate polynomial interpolation
- Positive Forms and Stability of Linear Time-Delay Systems
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- The SHOGUN machine learning toolbox
- Universal kernels
- Why piecewise linear functions are dense in C[0,1]
Cited in
(5)
This page was built for publication: A convex parametrization of a new class of universal kernel functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969089)