High-dimensional variable selection
Larry Wasserman, Kathryn Roeder · 2009
This paper explores the following question: what kind of statistical guarantees can be given when doing variable selection in highdimensional models? In particular, we look at the error rates and power of some multi-stage regression methods. In the first stage we fit a set of candidate models. In the second stage we select one model by cross-validation. In the third stage we use hypothesis testing to eliminate some variables. We refer to the first two stages as “screening” and the last stage as “cleaning. ” We consider three screening methods: the lasso, marginal regression, and forward stepwise regression. Our method gives consistent variable selection under certain conditions. 1. Introduction. Several
Cited by 524 works.
Authors
References
- Regression Shrinkage and Selection Via the Lasso
- Least angle regression
- Probability Inequalities for sums of Bounded Random Variables
- Genome-wide association study of 14,000 cases of seven common diseases and 3,000 shared controls
- Greed is Good: Algorithmic Results for Sparse Approximation
- Causation, Prediction, and Search
- For most large underdetermined systems of linear equations the minimal 𝓁 1 ‐norm solution is also the sparsest solution
- The Adaptive Lasso and Its Oracle Properties
- Just relax: convex programming methods for identifying sparse signals in noise
- High dimensional graphs and variable selection with the Lasso