# Hypothesis Testing in High-Dimensional Regression under the Gaussian Random Design Model: Asymptotic Theory

arXiv: https://arxiv.org/abs/1301.4240 · HTML: https://mlsanity.com/paper/1301.4240/

## Key facts

- Cited by 18 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Jan 2013.

## Built on by (most cited first, 18 of 18)

- [Lagrangian Inference for Ranking Problems](https://mlsanity.com/paper/2110.00151/) (2021)
- [DoubleML -- An Object-Oriented Implementation of Double Machine Learning in R](https://mlsanity.com/paper/2103.09603/) (2021)
- [Debiased Machine Learning without Sample-Splitting for Stable Estimators](https://mlsanity.com/paper/2206.01825/) (2022)
- [Prediction Sets for High-Dimensional Mixture of Experts Models](https://mlsanity.com/paper/2210.16710/) (2022)
- [Asymptotic normality of robust M-estimators with convex penalty](https://mlsanity.com/paper/2107.03826/) (2021)
- [Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passing](https://mlsanity.com/paper/2308.14507/) (2023)
- [Matrix Denoising with Doubly Heteroscedastic Noise: Fundamental Limits and Optimal Spectral Methods](https://mlsanity.com/paper/2405.13912/) (2024)
- [Distributed Bootstrap for Simultaneous Inference Under High Dimensionality](https://mlsanity.com/paper/2102.10080/) (2021)
- [A replica analysis of under-bagging](https://mlsanity.com/paper/2404.09779/) (2024)
- [Inference on Optimal Dynamic Policies via Softmax Approximation](https://mlsanity.com/paper/2303.04416/) (2023)
- [Chi-square and normal inference in high-dimensional multi-task regression](https://mlsanity.com/paper/2107.07828/) (2021)
- [Distributed Sparse Feature Selection in Communication-Restricted Networks](https://mlsanity.com/paper/2111.02802/) (2021)
- [Learning Directed Acyclic Graphs from Partial Orderings](https://mlsanity.com/paper/2403.16031/) (2024)
- [Stability of a Generalized Debiased Lasso with Applications to Resampling-Based Variable Selection](https://mlsanity.com/paper/2405.03063/) (2024)
- [Distributed Sparse Linear Regression under Communication Constraints](https://mlsanity.com/paper/2301.04022/) (2023)
- [Statistical Inference in Classification of High-dimensional Gaussian Mixture](https://mlsanity.com/paper/2410.19950/) (2024)
- [Fast Debiasing of the LASSO Estimator](https://mlsanity.com/paper/2502.19825/) (2025)
- [Recovering linear images of sparse signals from indirect observations](https://mlsanity.com/paper/2609.06182/) (2026)

## Abstract (arXiv)

We consider linear regression in the high-dimensional regime where the number of observations n is smaller than the number of parameters p. A very successful approach in this setting uses ℓ1-penalized least squares (a.k.a. the Lasso) to search for a subset of s0< n parameters that best explain the data, while setting the other parameters to zero. Considerable amount of work has been devoted to characterizing the estimation and model selection problems within this approach. In this paper we consider instead the fundamental, but far less understood, question of statistical significance. More precisely, we address the problem of computing p-values for single regression coefficients. On one hand, we develop a general upper bound on the minimax power of tests with a given significance level. On the other, we prove that this upper bound is (nearly) achievable through a practical procedure in the case of random design matrices with independent entries. Our approach is based on a debiasing of the Lasso estimator. The analysis builds on a rigorous characterization of the asymptotic distribution of the Lasso estimator and its debiased version. Our result holds for optimal sample size, i.e., when n is at least on the order of s0 log(p/s0). We generalize our approach to random design matrices with i.i.d. Gaussian rows xi~ N(0,Sigma). In this case we prove that a similar distributional characterization (termed `standard distributional limit') holds for n much larger than s0(log p)2. Finally, we show that for optimal sample size, n being at least of order s0 log(p/s0), the standard distributional limit for general Gaussian designs can be derived from the replica heuristics in statistical physics.