aiqbench analysis
This research investigates how degeneracy in covariate covariance matrices and feature dependence induce multiple descent phenomena in over-parameterized linear regression models. By deriving deterministic equivalents under a vanishing-ridge regime, the study reveals that specific graph-theoretic structures determine where prediction risk peaks occur. These findings advance theoretical understanding of generalization bounds when standard independence assumptions are relaxed.
The Zero Pattern of a Design Matrix Drives Multiple Descent in Over-parameterized Regression
arXiv:2607.24041v1 Announce Type: cross Abstract: Over-parameterized linear regression has been widely studied over the last decade. However, most existing works assume that the covariates are independent and that their covariance matrices are non-degenerate. In this paper, we relax both assumptions and derive deterministic equivalents for the prediction risk in a vanishing-ridge regime. We show that degeneracy of the covariance matrices and dependence can lead to multiple descent, and characterize where the corresponding peaks can occur. Our proofs use a novel graph representation of the variance profile. We show that maximum matchings and the Dulmage--Mendelsohn decomposition of the associated bipartite graph identify the configurations at which the variance becomes singular.
Abstract:Over-parameterized linear regression has been widely studied over the last decade. However, most existing works assume that the covariates are independent and that their covariance matrices are non-degenerate. In this paper, we relax both assumptions and derive deterministic equivalents for the prediction risk in a vanishing-ridge regime. We show that degeneracy of the covariance matrices and dependence can lead to multiple descent, and characterize where the corresponding peaks can occur. Our proofs use a novel graph representation of the variance profile. We show that maximum matchings and the Dulmage--Mendelsohn decomposition of the associated bipartite graph identify the configurations at which the variance becomes singular.
Statistics Theory (math.ST); Machine Learning (cs.LG); Machine Learning (stat.ML)
arXiv:2607.24041 [math.ST]
(or arXiv:2607.24041v1 [math.ST] for this version)
https://doi.org/10.48550/arXiv.2607.24041 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 204 words
Related coverage

Challenge: Hand coding weights for efficient sequence memorisation
AI Alignment Forum · Jul 23, 2026

GEM Training: How Meta Doubled the Efficiency of Its LLM-Scale Ads Foundation Model
Meta Engineering · Aug 3, 2026

How Photonic Chips Differ From Electronic Chips
Quantum Zeitgeist · Sep 19, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026