Sparse multiple kernel learning: minimax rates with random projection
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2089352 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- Fast learning rate of multiple kernel learning: trade-off between sparsity and smoothness
- High-dimensional additive modeling
- Iterative Hessian sketch: fast and accurate solution approximation for constrained least-squares
- Learning the kernel function via regularization
- Minimax-optimal rates for sparse additive models over kernel classes via convex programming
- On the Eigenspectrum of the Gram Matrix and the Generalization Error of Kernel-PCA
- Optimal rates for the regularized least-squares algorithm
- Oracle inequalities for sparse additive quantile regression in reproducing kernel Hilbert space
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Randomized sketches for kernels: fast and optimal nonparametric regression
- Simultaneous analysis of Lasso and Dantzig selector
- Sketched ridge regression: optimization perspective, statistical perspective, and model averaging
- Some results on Tchebycheffian spline functions and stochastic processes
- Sparsity in multiple kernel learning
- Theoretical foundations of functional data analysis, with an introduction to linear operators
- Variable selection in nonparametric additive models
This page was built for publication: Sparse multiple kernel learning: minimax rates with random projection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541942)
