Cover Image

Characterizing Overfitting in Kernel Ridgeless Regression Through the Eigenspectrum

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cheng, Tin Sum, Lucchi, Aurelien, Kratsios, Anastasis, Belius, David
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Comprehensive Analysis on the Learning Curve in Kernel Ridge Regression
by: Cheng, Tin Sum, et al.
Published: (2024)

Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters
by: Kratsios, Anastasis, et al.
Published: (2025)

Regret-Optimal Federated Transfer Learning for Kernel Regression with Applications in American Option Pricing
by: Yang, Xuwei, et al.
Published: (2023)

Overfitting Behaviour of Gaussian Kernel Ridgeless Regression: Varying Bandwidth or Dimensionality
by: Medvedev, Marko, et al.
Published: (2024)

Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data
by: Kratsios, Anastasis, et al.
Published: (2025)

Optimizer choice matters for the emergence of Neural Collapse
by: Zhao, Jim, et al.
Published: (2026)

Learning Analysis of Kernel Ridgeless Regression with Asymmetric Kernel Learning
by: He, Fan, et al.
Published: (2024)

Unpacking Softmax: How Temperature Drives Representation Collapse, Compression, and Generalization
by: Masarczyk, Wojciech, et al.
Published: (2025)

Is In-Context Universality Enough? MLPs are Also Universal In-Context
by: Kratsios, Anastasis, et al.
Published: (2025)

Structure-Preserving Reconstruction of Convex Lipschitz Functionals on Hilbert Spaces from Finite Samples
by: Kratsios, Anastasis
Published: (2026)

Polynomial Scaling is Possible For Neural Operator Approximations of Structured Families of BSDEs
by: Furuya, Takashi, et al.
Published: (2024)

Incremental Generation is Necessary and Sufficient for Universality in Flow-Based Modelling
by: Rouhvarzi, Hossein, et al.
Published: (2025)

Designing Universal Causal Deep Learning Models: The Case of Infinite-Dimensional Dynamical Systems from Stochastic Analysis
by: Galimberti, Luca, et al.
Published: (2022)

Bridging the Gap Between Approximation and Learning via Optimal Approximation by ReLU MLPs of Maximal Regularity
by: Hong, Ruiyang, et al.
Published: (2024)

An Agnostic View on the Cost of Overfitting in (Kernel) Ridge Regression
by: Zhou, Lijia, et al.
Published: (2023)

Spectral Analysis of Molecular Kernels: When Richer Features Do Not Guarantee Better Generalization
by: Jamali, Asma, et al.
Published: (2025)

Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs
by: Kratsios, Anastasis, et al.
Published: (2025)

Certifiable Boolean Reasoning Is Universal
by: Li, Wenhao, et al.
Published: (2026)

Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits
by: Kratsios, Anastasis, et al.
Published: (2026)

Approximation Rates in Besov Norms and Sample-Complexity of Kolmogorov-Arnold Networks with Residual Connections
by: Kratsios, Anastasis, et al.
Published: (2025)

Neural Snowflakes: Universal Latent Graph Inference via Trainable Latent Geometries
by: Borde, Haitz Sáez de Ocáriz, et al.
Published: (2023)

Step by Step: Adaptive Gradient Descent for Training L-Lipschitz Neural Networks
by: Sung, Kyle, et al.
Published: (2025)

Adjusted Overfitting Regression
by: Wilson, Dylan
Published: (2024)

Simultaneously Solving Infinitely Many LQ Mean Field Games In Hilbert Spaces: The Power of Neural Operators
by: Firoozi, Dena, et al.
Published: (2025)

Loss Landscape Characterization of Neural Networks without Over-Parametrization
by: Islamov, Rustem, et al.
Published: (2024)

LoRA Fine-Tuning Without GPUs: A CPU-Efficient Meta-Generation Framework for LLMs
by: Arabpour, Reza, et al.
Published: (2025)

Neural Operators Can Play Dynamic Stackelberg Games
by: Alvarez, Guillermo, et al.
Published: (2024)

One model to solve them all: 2BSDE families via neural operators
by: Furuya, Takashi, et al.
Published: (2025)

Benign Overfitting with Quantum Kernels
by: Tomasi, Joachim, et al.
Published: (2025)

Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spaces
by: Kratsios, Anastasis, et al.
Published: (2024)

Quantifying The Limits of AI Reasoning: Systematic Neural Network Representations of Algorithms
by: Kratsios, Anastasis, et al.
Published: (2025)

Scalable Message Passing Neural Networks: No Need for Attention in Large Graph Representation Learning
by: Borde, Haitz Sáez de Ocáriz, et al.
Published: (2024)

Adaptivity Under Realizability Constraints: Comparing In-Context and Agentic Learning
by: Kratsios, Anastasis, et al.
Published: (2026)

Theoretical characterisation of the Gauss-Newton conditioning in Neural Networks
by: Zhao, Jim, et al.
Published: (2024)

NerVE: Nonlinear Eigenspectrum Dynamics in LLM Feed-Forward Networks
by: Jha, Nandan Kumar, et al.
Published: (2026)

A Theoretical Analysis of the Learning Dynamics under Class Imbalance
by: Francazi, Emanuele, et al.
Published: (2022)

Why Do We Need Warm-up? A Theoretical Perspective
by: Alimisis, Foivos, et al.
Published: (2025)

Learning from one graph: transductive learning guarantees via the geometry of small random worlds
by: Detering, Nils, et al.
Published: (2025)

Eigenspectrum Analysis of Neural Networks without Aspect Ratio Bias
by: Hu, Yuanzhe, et al.
Published: (2025)

MEMOA: Massive Mixtures of Online Agents via Mean-Field Decentralized Nash Equilibria
by: Yang, Xuwei, et al.
Published: (2026)