Kernel regression, minimax rates and effective dimensionality: beyond the regular case
Not on the map. Why?
Abstract (arXiv)
We investigate if kernel regularization methods can achieve minimax convergence rates over a source condition regularity assumption for the target function. These questions have been considered in past literature, but only under specific assumptions about the decay, typically polynomial, of the spectrum of the the kernel mapping covariance operator. In the perspective of distribution-free results, we investigate this issue under much weaker assumption on the eigenvalue decay, allowing for more complex behavior that can reflect different structure of the data at different scales.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Nov 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1; 2026: 2.
4 papers.
- 2026Statistical inverse learning and ℓ1-regularization8 Jul 2026
- 2026Minimax Rates and Spectral Distillation for Tree Ensembles12 May 2026
- 2025Forecasting time series with constraints14 Feb 2025
- 2022Optimal Learning Rates for Regularized Least-Squares with a Fourier Capacity Condition16 Apr 2022