English
Related papers

Related papers: False Discoveries Occur Early on the Lasso Path

200 papers

As a popular tool for producing meaningful and interpretable models, large-scale sparse learning works efficiently when the underlying structures are indeed or close to sparse. However, naively applying the existing regularization methods…

Methodology · Statistics 2017-10-10 Zemin Zheng , Jinchi Lv , Wei Lin

There is increasing interest in detecting collective anomalies: potentially short periods of time where the features of data change before reverting back to normal behaviour. We propose a new method for detecting a collective anomaly in VAR…

Methodology · Statistics 2021-05-18 Hyeyoung Maeng , Idris Eckley , Paul Fearnhead

We consider the problem of sparse variable selection on high dimension heterogeneous data sets, which has been taking on renewed interest recently due to the growth of biological and medical data sets with complex, non-i.i.d. structures and…

Methodology · Statistics 2024-04-22 Hui Liu , Xiang Liu , Jing Diao , Wenting Ye , Xueling Liu , Dehui Wei

This paper investigates the high-dimensional linear regression with highly correlated covariates. In this setup, the traditional sparsity assumption on the regression coefficients often fails to hold, and consequently many model selection…

Methodology · Statistics 2019-03-26 Jianqing Fan , Bai Jiang , Qiang Sun

We consider the least-square linear regression problem with regularization by the l1-norm, a problem usually referred to as the Lasso. In this paper, we present a detailed asymptotic analysis of model consistency of the Lasso. For various…

Machine Learning · Computer Science 2008-12-18 Francis Bach

We describe a fast method to eliminate features (variables) in l1 -penalized least-square regression (or LASSO) problems. The elimination of features leads to a potentially substantial reduction in running time, specially for large values…

Machine Learning · Computer Science 2011-05-19 Laurent El Ghaoui , Vivian Viallon , Tarek Rabbani

Sparse linear regression is a fundamental problem in high-dimensional statistics, but strikingly little is known about how to efficiently solve it without restrictive conditions on the design matrix. We consider the (correlated) random…

Machine Learning · Computer Science 2021-06-18 Jonathan Kelner , Frederic Koehler , Raghu Meka , Dhruv Rohatgi

This paper is concerned with high-dimensional panel data models where the number of regressors can be much larger than the sample size. Under the assumption that the true parameter vector is sparse we propose a panel-Lasso estimator and…

Statistics Theory · Mathematics 2014-02-14 Anders Bredahl Kock

Fused Lasso was proposed to characterize the sparsity of the coefficients and the sparsity of their successive differences for the linear regression. Due to its wide applications, there are many existing algorithms to solve fused Lasso.…

Computation · Statistics 2024-04-17 Pan Shang , Huangyue Chen , Lingchen Kong

Penalized regression models such as the Lasso have proved useful for variable selection in many fields - especially for situations with high-dimensional data where the numbers of predictors far exceeds the number of observations. These…

Methodology · Statistics 2014-03-19 Kasper Brink-Jensen , Claus Thorn Ekstrøm

This paper analyzes $\ell_1$ regularized linear regression under the challenging scenario of having only adversarially corrupted data for training. We use the primal-dual witness paradigm to provide provable performance guarantees for the…

Machine Learning · Computer Science 2022-12-23 Deepak Maurya , Jean Honorio

We study a regression model with a huge number of interacting variables. We consider a specific approximation of the regression function under two ssumptions: (i) there exists a sparse representation of the regression function in a…

Statistics Theory · Mathematics 2009-09-29 Peter J. Bickel , Ya'acov Ritov , Alexander B. Tsybakov

Standard high-dimensional regression methods assume that the underlying coefficient vector is sparse. This might not be true in some cases, in particular in presence of hidden, confounding variables. Such hidden confounding can be…

Methodology · Statistics 2020-08-19 Domagoj Ćevid , Peter Bühlmann , Nicolai Meinshausen

An approximate method for conducting resampling in Lasso, the $\ell_1$ penalized linear regression, in a semi-analytic manner is developed, whereby the average over the resampled datasets is directly computed without repeated numerical…

Machine Learning · Statistics 2018-12-11 Tomoyuki Obuchi , Yoshiyuki Kabashima

Scaled sparse linear regression jointly estimates the regression coefficients and noise level in a linear model. It chooses an equilibrium with a sparse regression method by iteratively estimating the noise level via the mean residual…

Machine Learning · Statistics 2012-06-22 Tingni Sun , Cun-Hui Zhang

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

Learning under distribution shifts is a challenging task. One principled approach is to exploit the invariance principle via the structural causal models. However, the invariance principle is violated when the response is intervened, making…

Methodology · Statistics 2023-03-14 Kang Du , Yu Xiang

In many fields of science, we observe a response variable together with a large number of potential explanatory variables, and would like to be able to discover which variables are truly associated with the response. At the same time, we…

Methodology · Statistics 2015-10-15 Rina Foygel Barber , Emmanuel J. Candès

We consider the problem of fitting the parameters of a high-dimensional linear regression model. In the regime where the number of parameters $p$ is comparable to or exceeds the sample size $n$, a successful approach uses an…

Statistics Theory · Mathematics 2013-11-04 Adel Javanmard , Andrea Montanari

A common sparse linear regression formulation is the l1 regularized least squares, which is also known as least absolute shrinkage and selection operator (LASSO). Approximate message passing (AMP) has been proved to asymptotically achieve…

Information Theory · Computer Science 2021-07-01 Yanting Ma , Min Kang , Jack W. Silverstein , Dror Baron