The paper derives sharp matching convergence rates for spectral methods in linear regression via feature space decomposition, enabling pre-ordering of algorithms and generalizing saturation effects.
Kernel regression, minimax rates and effective dimensionality: beyond the regular case
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
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.
fields
math.ST 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sharp convergence rates for Spectral methods via the feature space decomposition method
The paper derives sharp matching convergence rates for spectral methods in linear regression via feature space decomposition, enabling pre-ordering of algorithms and generalizing saturation effects.