mlsanityData to 14 Oct 2026

Spectrum of inner-product kernel matrices in the polynomial regime and multiple descent phenomenon in kernel ridge regression

arXiv 2204.10425 ↗First posted 21 Apr 2022math.ST stat.ML stat.THcited by 45

Not on the map. Why?

Abstract (arXiv)

We study the spectrum of inner-product kernel matrices, i.e., n × n matrices with entries h (langle xi ,xj rangle/d) where the ( xi)i ≤ n are i.i.d.~random covariates in ℝd. In the linear high-dimensional regime n asymp d, it was shown that these matrices are well approximated by their linearization, which simplifies into the sum of a rescaled Wishart matrix and identity matrix. In this paper, we generalize this decomposition to the polynomial high-dimensional regime n asymp dℓ,ℓ ∈ mathbbN, for data uniformly distributed on the sphere and hypercube. In this regime, the kernel matrix is well approximated by its degree-ℓ polynomial approximation and can be decomposed into a low-rank spike matrix, identity and a `Gegenbauer matrix' with entries Qℓ (langle xi , xj rangle), where Qℓ is the degree-ℓ Gegenbauer polynomial. We show that the spectrum of the Gegenbauer matrix converges in distribution to a Marchenko-Pastur law. This problem is motivated by the study of the prediction error of kernel ridge regression (KRR) in the polynomial regime n asymp d^kappa, kappa >0. Previous work showed that for kappa not∈ mathbbN, KRR fits exactly a degree-lfloor kappa rfloor polynomial approximation to the target function. In this paper, we use our characterization of the kernel matrix to complete this picture and compute the precise asymptotics of the test error in the limit n/d^kappa → psi with kappa ∈ mathbbN. In this case, the test error can present a double descent behavior, depending on the effective regularization and signal-to-noise ratio at level kappa. Because this double descent can occur each time kappa crosses an integer, this explains the multiple descent phenomenon in the KRR risk curve observed in several previous works.

Key facts. Cited by 45 papers in the map (data through 14 Oct 2026). Builds on 20 of its 46 references that are in the map. First posted on arXiv 21 Apr 2022.

Builds on

20 of 46 references.

References · 20

  1. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
  2. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
  3. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
  4. 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 659
  5. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
  6. 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
  7. 2018Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Datacited by 261
  8. 2018To understand deep learning we need to understand kernel learningcited by 187
  9. 2020When Do Neural Networks Outperform Kernel Methods?cited by 150
  10. 2021Generalization error of random features and kernel methods: hypercontractivity and kernel matrix concentrationcited by 110
  11. 2020On the Optimal Weighted ℓ2 Regularization in Overparameterized Linear Regressioncited by 98
  12. 2021Learning with invariances in random features and kernel modelscited by 89
8 more
  1. 2018On the Convergence Rate of Training Recurrent Neural Networkscited by 82
  2. 2022Universality of empirical risk minimizationcited by 75
  3. 2020Asymptotics of Ridge (less) Regression under General Source Conditioncited by 62
  4. 2020Kernel Alignment Risk Estimator: Risk Prediction from Training Datacited by 54
  5. 2018Optimal ridge penalty for real-world high-dimensional data can be zero or negative due to the implicit ridge regularizationcited by 53
  6. 2018Consistency of Interpolation with Laplace Kernels is a High-Dimensional Phenomenoncited by 44
  7. 2020Kernel regression in high dimensions: Refined analysis beyond double descentcited by 39
  8. 2021Learning with convolution and pooling operations in kernel methodscited by 21

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 9; 2023: 15; 2024: 10; 2025: 5; 2026: 6.

45 papers.

Sort:

By area:

  1. 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 108
  2. 2024Scaling and renormalization in high-dimensional regressioncited by 50
  3. 2023A Theory of Non-Linear Feature Learning with One Gradient Step in Two-Layer Neural Networkscited by 49
  4. 2023Bayes-optimal Learning of Deep Random Networks of Extensive-widthcited by 41
  5. 2023Deterministic equivalent and error universality of deep random features learningcited by 35
  6. 2023Universality laws for Gaussian mixtures in generalized linear modelscited by 28
  7. 2022An Equivalence Principle for the Spectrum of Random Inner-Product Kernel Matrices with Polynomial Scalingscited by 27
  8. 2023Generalization in Kernel Regression Under Realistic Assumptionscited by 27
  9. 2024Asymptotics of Random Feature Regression Beyond the Linear Scaling Regimecited by 26
  10. 2022Precise Learning Curves and Higher-Order Scaling Limits for Dot Product Kernel Regressioncited by 22
  11. 2023Six Lectures on Linearized Neural Networkscited by 20
  12. 2022Sharp Asymptotics of Kernel Ridge Regression Beyond the Linear Regimecited by 19
33 more
  1. 2022On the non-universality of deep learning: quantifying the cost of symmetrycited by 18
  2. 2024Characterizing Overfitting in Kernel Ridgeless Regression Through the Eigenspectrumcited by 13
  3. 2023Noisy Interpolation Learning with Shallow Univariate ReLU Networkscited by 11
  4. 2023Optimal Rate of Kernel Regression in Large Dimensionscited by 11
  5. 2024Optimal Rates of Kernel Ridge Regression under Source Condition in Large Dimensionscited by 11
  6. 2022Multiple Descent in the Multiple Random Feature Modelcited by 10
  7. 2023Benign Overfitting in Two-Layer ReLU Convolutional Neural Networks for XOR Datacited by 10
  8. 2023Universality for the global spectrum of random inner-product kernel matrices in the polynomial regimecited by 10
  9. 2024Feature learning as alignment: a structural property of gradient descent in non-linear neural networkscited by 10
  10. 2024The phase diagram of kernel interpolation in large dimensionscited by 9
  11. 2023A Theoretical Analysis of the Test Error of Finite-Rank Kernel Ridge Regressioncited by 8
  12. 2022Overparameterized random feature regression with nearly orthogonal datacited by 7
  13. 2024Overfitting Behaviour of Gaussian Kernel Ridgeless Regression: Varying Bandwidth or Dimensionalitycited by 7
  14. 2024Random features and polynomial rulescited by 6
  15. 2022Gradient flow in the gaussian covariate model: exact solution of learning curves and multiple descent structurescited by 5
  16. 2023Interpolation Learning With Minimum Description Lengthcited by 5
  17. 2023An Agnostic View on the Cost of Overfitting in (Kernel) Ridge Regressioncited by 5
  18. 2022Optimal Activation Functions for the Random Features Regression Modelcited by 4
  19. 2022Near-optimal fitting of ellipsoids to random pointscited by 4
  20. 2025Learning Curves of Stochastic Gradient Descent in Kernel Regressioncited by 4
  21. 2025A general technique for approximating high-dimensional empirical kernel matricescited by 4
  22. 2023Precise Asymptotic Generalization for Multiclass Classification with Overparameterized Linear Modelscited by 3
  23. 2024On the Pinsker bound of inner product kernel regression in large dimensionscited by 2
  24. 2025On the Saturation Effects of Spectral Algorithms in Large Dimensionscited by 2
  25. 2025Quantifying Overfitting along the Regularization Path for Two-Part-Code MDL in Supervised Classificationcited by 2
  26. 2025Eigenvalue distribution of the Neural Tangent Kernel in the quadratic scalingcited by 2
  27. 2026In-context Learning of Single-index Targets: Comparing Kernel and Feature Learnerscited by 1
  28. 2024Towards a Statistical Understanding of Neural Networks: Beyond the Neural Tangent Kernel Theoriescited by 0
  29. 2026Learning Curves and Benign Overfitting of Spectral Algorithms in Large Dimensionscited by 0
  30. 2026Large Dimensional Kernel Ridge Regression: Extending to Product Kernelscited by 0
  31. 2026Learning between the peaks: sharp asymptotics for kernel ridge regression under power-law anisotropycited by 0
  32. 2026First Learn, Then Memorize: The Spectral Bias of Diffusion Modelscited by 0
  33. 2026Dimension-Free Rank Lifting from Random Hyperplane Arrangementscited by 0