# Minimax Rate of Testing in Sparse Linear Regression

@article{Carpentier2018MinimaxRO, title={Minimax Rate of Testing in Sparse Linear Regression}, author={Alexandra Carpentier and Olivier Collier and Laetitia Comminges and A. Tsybakov and Yuhao Wang}, journal={Automation and Remote Control}, year={2018}, volume={80}, pages={1817 - 1834} }

We consider the problem of testing the hypothesis that the parameter of linear regression model is 0 against an s-sparse alternative separated from 0 in the l2-distance. We show that, in Gaussian linear regression model with p < n, where p is the dimension of the parameter and n is the sample size, the non-asymptotic minimax rate of testing has the form (s/n)log(p/s)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage…

## 20 Citations

### High-dimensional asymptotics of likelihood ratio tests in the Gaussian sequence model under convex constraints

- Mathematics, Computer ScienceThe Annals of Statistics
- 2022

These characterizations show that the power behavior of the LRT is in general non-uniform with respect to the Euclidean metric, and illustrate the conservative nature of existing minimax optimality and sub-optimality results for the L RT.

### Optimal sparsity testing in linear regression model

- Computer Science, MathematicsBernoulli
- 2019

The minimax separation distances are pinpointed for the problem of sparsity testing in the high-dimensional linear regression model to test whether the number of non-zero components of the regression parameter $\theta^*$ is less than or equal to $k_0$.

### Randomized tests for high-dimensional regression: A more efficient and powerful solution

- Computer ScienceNeurIPS
- 2020

This paper proposes a testing procedure that blends the classical $F$-test with a random projection step, and shows that the proposed test achieves sharp adaptive rates and is proved to be minimax optimal.

### Testability of high-dimensional linear models with nonsparse structures.

- Computer ScienceAnnals of statistics
- 2022

It is shown that, in models with weak feature correlations, minimax lower bound can be attained by a test whose power has the n rate, regardless of the size of the model sparsity.

### HIGH DIMENSIONAL ASYMPTOTICS OF LIKELIHOOD RATIO TESTS IN THE GAUSSIAN SEQUENCE MODEL UNDER CONVEX CONSTRAINTS

- Mathematics, Computer Science
- 2021

Under the null hypothesis, normal approximation holds for the log-likelihood ratio statistic for a general pair (μ0,K), in the high dimensional regime where the estimation error of the associated least squares estimator diverges in an appropriate sense.

### Robust Testing in High-Dimensional Sparse Models

- Computer Science, MathematicsArXiv
- 2022

This work considers the problem of robustly testing the norm of a high-dimensional sparse signal vector under two diﬀerent observation models and shows that the complexity of testing in these two settings signiﬁcantly increases under robustness constraints.

### Testing (Infinitely) Many Zero Restrictions

- Mathematics
- 2020

We present a max-test statistic for testing (possibly infinitely) many zero parameter restrictions in a general parametric regression framework. The test statistic is based on estimating the key…

### Estimation of the ℓ2-norm and testing in sparse linear regression with unknown variance

- MathematicsBernoulli
- 2022

We consider the related problems of estimating the $l_2$-norm and the squared $l_2$-norm in sparse linear regression with unknown variance, as well as the problem of testing the hypothesis that the…

### Estimating the minimizer and the minimum value of a regression function under passive design

- Mathematics, Computer Science
- 2022

A new method for estimating the minimizer x ∗ and the minimum value f ∗ of a smooth and strongly convex regression function f from the observations contaminated by random noise and derive non- asymptotic upper bounds for the quadratic risk and optimization error of z n.

### Near-Optimal Procedures for Model Discrimination with Non-Disclosure Properties

- Computer Science
- 2020

This work provides matching upper and lower bounds on the sample complexity as given by min{1/ ∆2,√r/∆} up to a constant factor; here ∆ is a measure of separation between P0 and P1 and r is the rank of the design covariance matrix.

## References

SHOWING 1-10 OF 13 REFERENCES

### Global testing under sparse alternatives: ANOVA, multiple comparisons and the higher criticism

- Mathematics
- 2011

Testing for the significance of a subset of regression coefficients in a linear model, a staple of statistical analysis, goes back at least to the work of Fisher who introduced the analysis of…

### Detection boundary in sparse regression

- Computer Science, Mathematics
- 2010

The main message is that, under some conditions, the detection boundary phenomenon that has been proved for the Gaussian sequence model, extends to high-dimensional linear regression.

### Around the circular law

- Mathematics
- 2012

These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/n tends to the…

### Introduction to the non-asymptotic analysis of random matrices

- Computer ScienceCompressed Sensing
- 2012

This is a tutorial on some basic non-asymptotic methods and concepts in random matrix theory, particularly for the problem of estimating covariance matrices in statistics and for validating probabilistic constructions of measurementMatrices in compressed sensing.

### Nonparametric Goodness-of-Fit Testing Under Gaussian Models

- Mathematics, Computer Science
- 2002

This paper presents a meta-analyses of Gaussian Asymptotics for Power and Besov Norms and its applications to Minimax Distinguishability and high-Dimensional Signal Detection.

### Minimax Estimation of Linear and Quadratic Functionals under Sparsity Constraints

- Ann. Statist., 2017,
- 2017

### Non-asymptotic minimax rates of testing in signal detection

- Mathematics
- 2002

Let Y = (Yi)i∈I be a finite or countable sequence of independent Gaussian random variables of mean f = (fi)i∈I and common variance σ. For various sets F ⊂ `2(I), the aim of this paper is to describe…

### Higher criticism for detecting sparse heterogeneous mixtures

- Mathematics
- 2004

Higher criticism, or second-level significance testing, is a multiplecomparisons concept mentioned in passing by Tukey. It concerns a situation where there are many independent tests of significance…

### Minimax risks for sparse regressions: Ultra-high-dimensional phenomenons

- Computer Science, Mathematics
- 2010

This paper studies the minimax risks of estimation and testing over classes of $k$-sparse vectors $\theta$ and proves that even dimension reduction techniques cannot provide satisfying results in an ultra-high dimensional setting.