mlsanityData to 7 Oct 2026

Loop Corrections in Random Feature Models: Training Error and Generalization Gap

arXiv 2604.12827 ↗First posted 14 Apr 2026cs.LG cs.AI stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

We study fixed-design random feature ridge regression beyond the mean-kernel approximation. The expectation is taken over the frozen-feature ensemble, conditional on the training sample. Because the predictor is a nonlinear function of the empirical kernel, its mean training error, test error, and conditional generalization gap depend on centered kernel covariances as well as on mean kernel objects. We derive the covariance-level, or one-loop, corrections from a finite resolvent identity. This avoids an almost-sure Neumann-series assumption and yields an explicit remainder bound for the training error. The test correction additionally requires mixed train--test covariance tensors and therefore cannot, in general, be recovered from the train-restricted kernel law alone. Numerical experiments show that the covariance term removes the leading inverse-width discrepancy in a controlled regularization regime, while an ablation that discards the mixed train--test covariance fails for the test error even though the training correction is unchanged. They also identify a width--regularization boundary, measured by a resolvent-fluctuation diagnostic, beyond which the second-order truncation loses accuracy. All inverse-width statements are for fixed sample size, depth, design, and positive kernel-level regularization. The analysis concerns frozen features and does not model feature learning or neural-tangent-kernel evolution.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 18 references that are in the map. First posted on arXiv 14 Apr 2026.

Builds on

14 of 18 references.

References · 14

  1. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  2. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
  3. 2017Deep Neural Networks as Gaussian Processescited by 617
  4. 2021The Principles of Deep Learning Theorycited by 169
  5. 2016Generalization Properties of Learning with Random Featurescited by 163
  6. 2019Finite Depth and Width Corrections to the Neural Tangent Kernelcited by 114
  7. 2020The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of Generalizationcited by 101
  8. 2019Dynamics of Deep Neural Networks and Neural Tangent Hierarchycited by 96
  9. 2019Non-Gaussian processes and neural networks at finite widthscited by 78
  10. 2019Asymptotics of Wide Networks from Feynman Diagramscited by 77
  11. 2022Neural Tangent Kernel Beyond the Infinite-Width Limit: Effects of Depth and Initializationcited by 30
  12. 2022Random Fully Connected Neural Networks as Perturbatively Solvable Hierarchiescited by 24
2 more
  1. 2019Finite size corrections for neural network Gaussian processescited by 22
  2. 2025Finite-Width Neural Tangent Kernels from Feynman Diagramscited by 3

Built on by

Not cited yet.