Skip to content
Preprint

Risk Equivalence between RKHS Regression and Sequence Models for Lipschitz Spectral Algorithms

Sep 2026 · 0 citations
Mathematics

Abstract

Kernel spectral algorithms are often summarized by convergence rates, which hide how their risk depends jointly on regularization, noise, the population spectrum, target coefficients, and the chosen filter. Gaussian sequence models arise as a simplified but characteristic setting for studying the interplay of these factors, where the kernel spectral algorithm corresponds to a coordinatewise shrinkage estimator. Under mild assumptions, we show that the risk of a kernel spectral estimator is asymptotically equivalent to that of the corresponding Gaussian sequence model estimator with the same filter. The explicit sequence model risk then yields a full characterization of the risk of kernel spectral algorithms in terms of the population spectrum, target coefficients, and filter. We establish this equivalence for a broad class of spectral filters, covering kernel ridge regression, generalized ridge regression, iterated kernel ridge regression, gradient flow, stable gradient descent, smoothed spectral cutoff, spectral clipping, and Pinsker shrinkage. Our risk equivalence not only holds in the classical fixed-dimensional regime but also applies to the high dimensional regime where the input dimension scales with the sample size. As applications, our risk equivalence recovers the minimax upper rates, and establishes the exact Pinsker constant in RKHS regression.

View source

Similar papers

Preprint Aug 2026

Density Estimation on Compact Manifolds under Intrinsic Spectral Block Variation

We introduce an intrinsic spectral sparsity model for nonparametric density estimation on compact connected Riemannian manifolds. Instead of penalizing coefficients in an arbitrarily chosen Laplace--Beltrami eigenbasis, we group each complete eigenspace and measure the Hilbert norm of its spectral component. The result...

Olga Klopp, Fedor Noskov · 0 citations
Preprint Sep 2026

On the sample complexity of the active subspace method

Active subspaces identify low-dimensional linear structure in high-dimensional parameter-to-output maps by estimating the dominant eigenspace of a gradient covariance operator. In practice this covariance is replaced by a Monte Carlo estimator built from a limited number of gradient evaluations. Classical analyses base...

Fabio Nobile, Matteo Raviola, R. Tempone · 0 citations
#machine learning Preprint Sep 2026

Principal Component Regression Dominates all Monotone Spectral Filters for Linear Regression

We compare the instance-wise, finite-sample risks of monotone spectral filters for linear regression, a broad class of estimators including principal component regression (PCR), gradient descent (GD), and ridge regression. We show that PCR dominates all monotone spectral filters: compared to any such filter, the risk o...

Juno Kim, Heng-Yu Fu, Peter L. Bartlett et al. · 1 citation
#artificial intelligence Preprint Sep 2026

Spectral Convergence of Random Feature Method in Multiple Dimensions

We first prove spectral convergence of the random feature method (RFM) for multidimensional targets in Sobolev, Gevrey, ultra-analytic, and bandlimited classes. The analysis establishes general high-probability approximation estimates in the interpolation scale generated by a kernel integral operator. On a single event...

P. Ming, Hao Yu · 2 citations
Preprint Aug 2026

Non-asymptotic Analysis of Mat\'ern Regression: The Roles of Target and Kernel Lengthscales

Theoretical guarantees for kernel regression are typically formulated in terms of smoothness, but practical accuracy depends critically on how the design resolution compares with the target and kernel lengthscales. We develop a finite-sample theory for Mat\'ern regression on periodic domains with quasi-uniform designs,...

D. Sanz-Alonso · 0 citations
Preprint Sep 2026

Double Descent for Random Fourier Series Models

We investigate the least squares linear regression problem with random partial Discrete Fourier Transform (DFT) matrices, providing a rigorous analysis of the model's generalization error. By leveraging tools from random matrix theory, we derive exact non-asymptotic bounds for the risk of the Moore-Penrose estimator, w...

Hang-Rong Xu, Ying-Yun Shen, Yu-Zhong Zhao · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.