pith. sign in

arxiv: 2303.15809 · v2 · pith:CC2LNRCQnew · submitted 2023-03-28 · 💻 cs.LG · math.ST· stat.TH

Kernel interpolation generalizes poorly

classification 💻 cs.LG math.STstat.TH
keywords kernelinterpolationpoorlygeneralizegeneralizesnetworksvarepsilonbenign
0
0 comments X
read the original abstract

One of the most interesting problems in the recent renaissance of the studies in kernel regression might be whether the kernel interpolation can generalize well, since it may help us understand the `benign overfitting henomenon' reported in the literature on deep networks. In this paper, under mild conditions, we show that for any $\varepsilon>0$, the generalization error of kernel interpolation is lower bounded by $\Omega(n^{-\varepsilon})$. In other words, the kernel interpolation generalizes poorly for a large class of kernels. As a direct corollary, we can show that overfitted wide neural networks defined on the sphere generalize poorly.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Large Dimensional Kernel Ridge Regression: Extending to Product Kernels

    stat.ML 2026-05 unverdicted novelty 7.0

    Extends high-dimensional KRR to product kernels, proving convergence rates that recover minimax optimality for source condition s ≤ 1, saturation for s > 1, and multiple-descent phenomena with respect to sample size n.