English
Related papers

Related papers: Optimal Sparsity Testing in Linear regression Mode…

200 papers

Consider the Gaussian vector model with mean value {\theta}. We study the twin problems of estimating the number |{\theta}|_0 of non-zero components of {\theta} and testing whether |{\theta}|_0 is smaller than some value. For testing, we…

Statistics Theory · Mathematics 2017-03-02 Alexandra Carpentier , Nicolas Verzelen

We consider the problem of robustly testing the norm of a high-dimensional sparse signal vector under two different observation models. In the first model, we are given $n$ i.i.d. samples from the distribution…

Information Theory · Computer Science 2022-11-08 Anand Jerry George , Clément L. Canonne

We study the problem of testing $H_0: \xi^\top\beta=t_0$ in high-dimensional sparse linear regression with Gaussian random design and unknown design covariance. The loading vector $\xi$ is arbitrary, and the exact sparsity level $k$ is…

Statistics Theory · Mathematics 2026-05-21 Jie Xie , Dongming Huang

Understanding statistical inference under possibly non-sparse high-dimensional models has gained much interest recently. For a given component of the regression coefficient, we show that the difficulty of the problem depends on the sparsity…

Statistics Theory · Mathematics 2022-08-22 Jelena Bradic , Jianqing Fan , Yinchu Zhu

Given a heterogeneous Gaussian sequence model with unknown mean $\theta \in \mathbb R^d$ and known covariance matrix $\Sigma = \operatorname{diag}(\sigma_1^2,\dots, \sigma_d^2)$, we study the signal detection problem against sparse…

Statistics Theory · Mathematics 2023-08-03 Julien Chhor , Rajarshi Mukherjee , Subhabrata Sen

Consider the standard Gaussian linear regression model $Y=X\theta+\epsilon$, where $Y\in R^n$ is a response vector and $ X\in R^{n*p}$ is a design matrix. Numerous work have been devoted to building efficient estimators of $\theta$ when $p$…

Statistics Theory · Mathematics 2012-01-26 Nicolas Verzelen

In this paper, we study the detection boundary for minimax hypothesis testing in the context of high-dimensional, sparse binary regression models. Motivated by genetic sequencing association studies for rare variant effects, we investigate…

Statistics Theory · Mathematics 2015-03-06 Rajarshi Mukherjee , Natesh S. Pillai , Xihong Lin

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 regression parameter is null under sparse…

Statistics Theory · Mathematics 2020-10-27 Alexandra Carpentier , Olivier Collier , Laetitia Comminges , Alexandre B. Tsybakov , Yuhao Wang

Sparse linear regression is one of the most basic questions in machine learning and statistics. Here, we are given as input a design matrix $X \in \mathbb{R}^{N \times d}$ and measurements or labels ${y} \in \mathbb{R}^N$ where ${y} = {X}…

Machine Learning · Computer Science 2025-11-11 Gautam Chandrasekaran , Raghu Meka , Konstantinos Stavropoulos

Missing values in datasets are common in applied statistics. For regression problems, theoretical work thus far has largely considered the issue of missing covariates as distinct from missing responses. However, in practice, many datasets…

Statistics Theory · Mathematics 2026-02-17 Benedict M. Risebrow , Thomas B. Berrett

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…

Statistics Theory · Mathematics 2018-10-11 Alexandra Carpentier , Olivier Collier , Laëtitia Comminges , Alexandre B. Tsybakov , Yuhao Wang

Recovery of the sparsity pattern (or support) of an unknown sparse vector from a small number of noisy linear measurements is an important problem in compressed sensing. In this paper, the high-dimensional setting is considered. It is shown…

Information Theory · Computer Science 2013-02-06 Galen Reeves , Michael Gastpar

In analyzing high-dimensional models, sparsity of the model parameter is a common but often undesirable assumption. In this paper, we study the following two-sample testing problem: given two samples generated by two high-dimensional linear…

Statistics Theory · Mathematics 2017-08-16 Yinchu Zhu , Jelena Bradic

We consider the following basic inference problem: there is an unknown high-dimensional vector $w \in \mathbb{R}^n$, and an algorithm is given access to labeled pairs $(x,y)$ where $x \in \mathbb{R}^n$ is a measurement and $y = w \cdot x +…

Computational Complexity · Computer Science 2019-11-05 Xue Chen , Anindya De , Rocco A. Servedio

We consider the problem of testing for the presence (or detection) of an unknown sparse signal in additive white noise. Given a fixed measurement budget, much smaller than the dimension of the signal, we consider the general problem of…

Information Theory · Computer Science 2015-03-19 Ramin Zahedi , Ali Pezeshki , Edwin K. P. Chong

Sparse principal component analysis addresses the problem of finding a linear combination of the variables in a given data set with a sparse coefficients vector that maximizes the variability of the data. This model enhances the ability to…

Optimization and Control · Mathematics 2017-03-09 Amir Beck , Yakov Vaisbourd

We propose a methodology for testing linear hypothesis in high-dimensional linear models. The proposed test does not impose any restriction on the size of the model, i.e. model sparsity or the loading vector representing the hypothesis.…

Methodology · Statistics 2019-07-09 Yinchu Zhu , Jelena Bradic

Although a majority of the theoretical literature in high-dimensional statistics has focused on settings which involve fully-observed data, settings with missing values and corruptions are common in practice. We consider the problems of…

Machine Learning · Statistics 2017-11-06 Yining Wang , Jialei Wang , Sivaraman Balakrishnan , Aarti Singh

We study computational-statistical gaps for improper learning in sparse linear regression. More specifically, given $n$ samples from a $k$-sparse linear model in dimension $d$, we ask what is the minimum sample complexity to efficiently (in…

Machine Learning · Computer Science 2024-06-26 Rares-Darius Buhai , Jingqiu Ding , Stefan Tiegel

We study the detection of a sparse change in a high-dimensional mean vector as a minimax testing problem. Our first main contribution is to derive the exact minimax testing rate across all parameter regimes for $n$ independent, $p$-variate…

Statistics Theory · Mathematics 2020-11-18 Haoyang Liu , Chao Gao , Richard J. Samworth
‹ Prev 1 2 3 10 Next ›