mlsanityData to 7 Oct 2026

The Lasso with general Gaussian designs with applications to hypothesis testing

arXiv 2007.13716 ↗First posted 27 Jul 2020math.ST cs.IT cs.LGcited by 40

Not on the map. Why?

Abstract (arXiv)

The Lasso is a method for high-dimensional regression, which is now commonly used when the number of covariates p is of the same order or larger than the number of observations n. Classical asymptotic normality theory does not apply to this model due to two fundamental reasons: (1) The regularized risk is non-smooth; (2) The distance between the estimator widehatboldsymbolθ and the true parameters vector boldsymbolθ^* cannot be neglected. As a consequence, standard perturbative arguments that are the traditional basis for asymptotic normality fail. On the other hand, the Lasso estimator can be precisely characterized in the regime in which both n and p are large and n/p is of order one. This characterization was first obtained in the case of Gaussian designs with i.i.d. covariates: here we generalize it to Gaussian correlated designs with non-singular covariance structure. This is expressed in terms of a simpler ``fixed-design'' model. We establish non-asymptotic bounds on the distance between the distribution of various quantities in the two models, which hold uniformly over signals boldsymbolθ^* in a suitable sparsity class and over values of the regularization parameter. As an application, we study the distribution of the debiased Lasso and show that a degrees-of-freedom correction is necessary for computing valid confidence intervals.

Key facts. Cited by 40 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Jul 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 12; 2022: 8; 2023: 7; 2024: 7; 2025: 4; 2026: 2.

40 papers.

Sort:

By area:

  1. 2021Learning curves of generic features maps for realistic datasets with a teacher-student modelcited by 126
  2. 2022Universality of empirical risk minimizationcited by 73
  3. 2021Learning Gaussian Mixtures with Generalised Linear Models: Precise Asymptotics in High-dimensionscited by 52
  4. 2022Dimension free ridge regressioncited by 50
  5. 2023Universality laws for Gaussian mixtures in generalized linear modelscited by 28
  6. 2022Gaussian Universality of Perceptrons with Random Labelscited by 26
  7. 2023Are Gaussian data all you need? Extents and limits of universality in high-dimensional generalized linear estimationcited by 25
  8. 2021Inference for Heteroskedastic PCA with Missing Datacited by 21
  9. 2022Fluctuations, Bias, Variance & Ensemble of Learners: Exact Asymptotics for Convex Losses in High-Dimensioncited by 19
  10. 2021Local convexity of the TAP free energy and AMP convergence for Z2-synchronizationcited by 15
  11. 2023Asymptotically free sketched ridge ensembles: Risks, cross-validation, and tuningcited by 11
  12. 2021Sharp global convergence guarantees for iterative nonconvex optimization: A Gaussian process perspectivecited by 10
28 more
  1. 2022Mitigating multiple descents: A model-agnostic framework for risk monotonizationcited by 9
  2. 2023Approximate message passing from random initialization with applications to mathbbZ2 synchronizationcited by 9
  3. 2021Derivatives and residual distribution of regularized M-estimators with application to adaptive tuningcited by 7
  4. 2025Preventing Model Collapse Under Overparametrization: Optimal Mixing Ratios for Interpolation Learning and Ridge Regressioncited by 7
  5. 2021Asymptotic normality of robust M-estimators with convex penaltycited by 5
  6. 2021Minimum ℓ1-norm interpolators: Precise asymptotics and multiple descentcited by 5
  7. 2022Observable adjustments in single-index models for regularized M-estimatorscited by 5
  8. 2022A New Central Limit Theorem for the Augmented IPW Estimator: Variance Inflation, Cross-Fit Covariance and Beyondcited by 5
  9. 2023Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passingcited by 5
  10. 2023Corrected generalized cross-validation for finite ensembles of penalized estimatorscited by 5
  11. 2024Theoretical Analysis of Leave-one-out Cross Validation for Non-differentiable Penalties under High-dimensional Settingscited by 5
  12. 2021Characterizing the SLOPE Trade-off: A Variational Perspective and the Donoho-Tanner Limitcited by 4
  13. 2024High-dimensional logistic regression with missing data: Imputation, regularization, and universalitycited by 4
  14. 2024The Breakdown of Gaussian Universality in Classification of High-dimensional Linear Factor Mixturescited by 4
  15. 2021Efficient Designs of SLOPE Penalty Sequences in Finite Dimensioncited by 3
  16. 2022Near-optimal multiple testing in Bayesian linear models with finite-sample FDR controlcited by 3
  17. 2023Approximate Leave-one-out Cross Validation for Regression with ℓ1 Regularizers (extended version)cited by 3
  18. 2024A non-asymptotic distributional theory of approximate message passing for sparse and robust regressioncited by 3
  19. 2021Chi-square and normal inference in high-dimensional multi-task regressioncited by 2
  20. 2024Revisiting Optimism and Model Complexity in the Wake of Overparameterized Machine Learningcited by 2
  21. 2025Optimal and Provable Calibration in High-Dimensional Binary Classification: Angular Calibration and Platt Scalingcited by 2
  22. 2025Dimension-Free Bounds for Generalized First-Order Methods via Gaussian Couplingcited by 2
  23. 2021Spatially relaxed inference on high-dimensional linear modelscited by 1
  24. 2024Stability of a Generalized Debiased Lasso with Applications to Resampling-Based Variable Selectioncited by 1
  25. 2025Simultaneous analysis of approximate leave-one-out cross-validation and mean-field inferencecited by 1
  26. 2026Lasso Universality Under Linearly Dependent Covariates in the Sparse Regimecited by 1
  27. 2024Estimating Generalization Performance Along the Trajectory of Proximal SGD in Robust Regressioncited by 0
  28. 2026When Does ℓ2-Boosting Overfit Benignly? High-Dimensional Risk Asymptotics and the ℓ1 Implicit Biascited by 0