In regression settings where explanatory variables have very low correlations and where there are relatively few effects each of large magnitude, it is commonly believed that the Lasso shall be able to find the important variables with few errors—if any. In contrast, this paper shows that this is not the case even when the design variables are stochastically independent. In a regime of linear sparsity, we demonstrate that true features and null features are always interspersed on the Lasso path, and that this phenomenon occurs no matter how strong the effect sizes are. We derive a sharp asymptotic trade-off between false and true positive rates or, equivalently, between measures of type I and type II errors along the Lasso path. This trade-...
Abstract We study the finite sample behavior of Lasso-based inference methods such as...
The Lasso is an attractive regularisation method for high-dimensional regression. It combines variab...
In this paper, we investigate the degrees of freedom (df) of penalized l1 minimization (also known a...
In regression settings where explanatory variables have very low correlations and there are relative...
We present upper and lower bounds for the prediction error of the Lasso. For the case of random Gaus...
In this paper, we investigate the degrees of freedom ($\dof$) of penalized $\ell_1$ minimization (al...
The Lasso is an attractive technique for regularization and variable selection for high-dimensional ...
Abstract: The performance of the Lasso is well understood under the assumptions of the standard line...
International audienceBasis Pursuit (BP), Basis Pursuit DeNoising (BPDN), and LASSO are popular meth...
Regression with L1-regularization, Lasso, is a popular algorithm for recovering the sparsity pattern...
The performance of the Lasso is well understood under the assumptions of the standard sparse linear ...
We consider a linear regression problem in a high dimensional setting where the number of covariates...
We study how correlations in the design matrix influence Lasso prediction. First, we argue that the ...
The Lasso shrinkage procedure achieved its popularity, in part, by its tendency to shrink estimated ...
Abstract: Regression with the lasso penalty is a popular tool for performing di-mension reduction wh...
Abstract We study the finite sample behavior of Lasso-based inference methods such as...
The Lasso is an attractive regularisation method for high-dimensional regression. It combines variab...
In this paper, we investigate the degrees of freedom (df) of penalized l1 minimization (also known a...
In regression settings where explanatory variables have very low correlations and there are relative...
We present upper and lower bounds for the prediction error of the Lasso. For the case of random Gaus...
In this paper, we investigate the degrees of freedom ($\dof$) of penalized $\ell_1$ minimization (al...
The Lasso is an attractive technique for regularization and variable selection for high-dimensional ...
Abstract: The performance of the Lasso is well understood under the assumptions of the standard line...
International audienceBasis Pursuit (BP), Basis Pursuit DeNoising (BPDN), and LASSO are popular meth...
Regression with L1-regularization, Lasso, is a popular algorithm for recovering the sparsity pattern...
The performance of the Lasso is well understood under the assumptions of the standard sparse linear ...
We consider a linear regression problem in a high dimensional setting where the number of covariates...
We study how correlations in the design matrix influence Lasso prediction. First, we argue that the ...
The Lasso shrinkage procedure achieved its popularity, in part, by its tendency to shrink estimated ...
Abstract: Regression with the lasso penalty is a popular tool for performing di-mension reduction wh...
Abstract We study the finite sample behavior of Lasso-based inference methods such as...
The Lasso is an attractive regularisation method for high-dimensional regression. It combines variab...
In this paper, we investigate the degrees of freedom (df) of penalized l1 minimization (also known a...