scispace - formally typeset
Open AccessJournal ArticleDOI

False Discoveries Occur Early on the Lasso Path

Weijie J. Su, +2 more
- 01 Oct 2017 - 
- Vol. 45, Iss: 5, pp 2133-2150
Reads0
Chats0
TLDR
It is demonstrated 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.
Abstract
In regression settings where explanatory variables have very low correlations and there are relatively few effects, each of large magnitude, we expect the Lasso to find the important variables with few errors, if any. This paper shows that in a regime of linear sparsity—meaning that the fraction of variables with a nonvanishing effect tends to a constant, however small—this cannot really be the case, even when the design variables are stochastically independent. 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-off states that if we ever want to achieve a type II error (false negative rate) under a critical value, then anywhere on the Lasso path the type I error (false positive rate) will need to exceed a given threshold so that we can never have both errors at a low level at the same time. Our analysis uses tools from approximate message passing (AMP) theory as well as novel elements to deal with a possibly adaptive selection of the Lasso regularizing parameter.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Optimal false discovery control of minimax estimators

Qifan Song, +1 more
- 01 Aug 2023 - 
TL;DR: In this paper , a trade-off between the rate of convergence and the false discovery control behavior of estimators under different sparsity regimes has been investigated, and a rigid dichotomy between estimators with near-linear and linear sparsity settings has been established.
Posted Content

Linear Optimal Low Rank Projection for High-Dimensional Multi-class Data

TL;DR: This work describes an approach, "Linear Optimal Low-rank" projection (LOL), which extends PCA by incorporating the class labels in a fashion that is advantageous over existing supervised dimensionality reduction techniques, and proves that LOL leads to a better representation of the data for subsequent classification than other linear approaches, while adding negligible computational cost.
Journal ArticleDOI

Characterizing the SLOPE trade-off: A variational perspective and the Donoho–Tanner limit

- 01 Feb 2023 - 
TL;DR: In this article , the trade-off between the false discovery proportion (FDP) and true positive proportion (TPP) between measures of type I error and power has been studied.
Posted Content

A Learning Theory Approach to a Computationally Efficient Parameter Selection for the Elastic Net.

TL;DR: The framework of statistical learning was used to approximate the optimal Tikhonov regularisation parameter from noisy data and the analysis was extended to the elastic net regularisation, providing explicit error bounds on the accuracy of the approximated parameter and the corresponding regularisation solution in a simplified case.
References
More filters
Journal ArticleDOI

Regression Shrinkage and Selection via the Lasso

TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Journal ArticleDOI

Regularization and variable selection via the elastic net

TL;DR: It is shown that the elastic net often outperforms the lasso, while enjoying a similar sparsity of representation, and an algorithm called LARS‐EN is proposed for computing elastic net regularization paths efficiently, much like algorithm LARS does for the lamba.
Journal ArticleDOI

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

TL;DR: In this article, penalized likelihood approaches are proposed to handle variable selection problems, and it is shown that the newly proposed estimators perform as well as the oracle procedure in variable selection; namely, they work as well if the correct submodel were known.
Journal ArticleDOI

Model selection and estimation in regression with grouped variables

TL;DR: In this paper, instead of selecting factors by stepwise backward elimination, the authors focus on the accuracy of estimation and consider extensions of the lasso, the LARS algorithm and the non-negative garrotte for factor selection.
Related Papers (5)