Lasso Universality Under Linearly Dependent Covariates in the Sparse Regime
Not on the map. Why?
Abstract (arXiv)
Throughout the last decade, Gaussian universality has been widely studied for high-dimensional estimation problems. Most of the literature focuses on i.i.d. sensing matrices or accounts for special forms of dependence, such as block dependence or other specific row/column dependencies. More general simultaneous row and column mixing has not yet been fully studied. In this paper, we focus on that setting. We prove a Gaussian universality theorem for the lasso in the sparse regime, where the non- Gaussian covariates have linearly dependent rows and columns. To the best of our knowledge, our setting permits a broader simultaneous row and column dependence structure than those treated in much of the prior universality literature. Numerical illustrations for various sparse profiles support the universality claims of this paper.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 10 of its 56 references that are in the map. First posted on arXiv 9 Aug 2026.
Builds on
10 of 56 references.
References · 10
- 2020The Lasso with general Gaussian designs with applications to hypothesis testingcited by 40
- 2021Graph-based Approximate Message Passing Iterationscited by 35
- 2022Gaussian Universality of Perceptrons with Random Labelscited by 26
- 2015Universality laws for randomized dimension reduction, with applicationscited by 21
- 2025When does Gaussian equivalence fail and how to fix it: Non-universal behavior of random features with quadratic scalingcited by 10
- 2024Universality in Transfer Learning for Linear Modelscited by 6
- 2024Asymptotics of Linear Regression with Linearly Dependent Datacited by 5
- 2025Long-time dynamics and universality of nonconvex gradient descentcited by 4
- 2026High-Dimensional Statistics: Reflections on Progress and Open Problemscited by 4
- 2025Nonasymptotic Convergence Rates for Plug-and-Play Methods With MMSE Denoiserscited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.