mlsanityData to 7 Oct 2026

Dimensionality Reduction and Wasserstein Stability for Kernel Regression

arXiv 2203.09347 ↗First posted 17 Mar 2022stat.ML cs.LG cs.NAcited by 3

Not on the map. Why?

Abstract (arXiv)

In a high-dimensional regression framework, we study consequences of the naive two-step procedure where first the dimension of the input variables is reduced and second, the reduced input variables are used to predict the output variable with kernel regression. In order to analyze the resulting regression errors, a novel stability result for kernel regression with respect to the Wasserstein distance is derived. This allows us to bound errors that occur when perturbed input data is used to fit the regression function. We apply the general stability result to principal component analysis (PCA). Exploiting known estimates from the literature on both principal component analysis and kernel regression, we deduce convergence rates for the two-step procedure. The latter turns out to be particularly useful in a semi-supervised setting.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 6 of its 58 references that are in the map. First posted on arXiv 17 Mar 2022.

Builds on

6 of 58 references.

References · 6

  1. 2017Wasserstein Auto-Encoderscited by 371
  2. 2017Sobolev Norm Learning Rates for Regularized Least-Squares Algorithmcited by 113
  3. 2021Generalization Error Rates in Kernel Regression: The Crossover from the Noiseless to Noisy Regimecited by 95
  4. 2018Optimal Rates for Spectral Algorithms with Least-Squares Regression over Hilbert Spacescited by 59
  5. 2021Out-of-Distribution Generalization in Kernel Regressioncited by 21
  6. 2017Total stability of kernel methodscited by 5

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 2.

3 papers.