Sparse multiple kernel learning: minimax rates with random projection

DOI10.1016/J.JSPI.2023.106142MaRDI QIDQ6541942

Heng Lian, Rui Li, Zhongyi Zhu, Wenqi Lu

Publication date: 21 May 2024

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

zbMATH Keywords

convergence ratekernel methodreproducing kernel Hilbert spacerandom projection

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast learning rate of multiple kernel learning: trade-off between sparsity and smoothness
• Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
• Sparsity in multiple kernel learning
• Variable selection in nonparametric additive models
• High-dimensional additive modeling
• Oracle inequalities for sparse additive quantile regression in reproducing kernel Hilbert space
• Randomized sketches for kernels: fast and optimal nonparametric regression
• Optimal rates for the regularized least-squares algorithm
• Simultaneous analysis of Lasso and Dantzig selector
• Some results on Tchebycheffian spline functions and stochastic processes
• Iterative Hessian sketch: fast and accurate solution approximation for constrained least-squares
• On the Eigenspectrum of the Gram Matrix and the Generalization Error of Kernel-PCA
• Theoretical Foundations of Functional Data Analysis, with an Introduction to Linear Operators
• Minimax-optimal rates for sparse additive models over kernel classes via convex programming

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)