On Model Selection Consistency of Lasso
Explore this paper's citation graph
Summary
It is proved that a single condition, which is called the Irrepresentable Condition, is almost necessary and sufficient for Lasso to select the true model both in the classical fixed p setting and in the large p setting as the sample size n gets large.
- Type
- article
- Published
- 2006-12-01
- Cited by
- 2,967
- References
- 16
- OpenAlex
- https://openalex.org/W2150940164
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:2174351
Keywords
Lasso (programming language), Model selection, Selection (genetic algorithm), Feature selection, Consistency (knowledge bases)
References
- Consistent neighbourhood selection for sparse high-dimensional graphs with the Lasso
- A NOTE ON THE LASSO AND RELATED PROCEDURES IN MODEL SELECTION
- Asymptotics for lasso-type estimators
- On the LASSO and its Dual
- What Are Degrees of Freedom
- On the “degrees of freedom” of the lasso
- High-dimensional graphs and variable selection with the Lasso
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Stable recovery of sparse overcomplete representations in the presence of noise
- Regression Shrinkage and Selection via the Lasso
- Boosted Lasso
- Lasso with relaxation
- Least angle regression
- Tracking Curved Regularized Optimization Solution Paths
- METHODOLOGIES IN SPECTRAL ANALYSIS OF LARGE DIMENSIONAL RANDOM MATRICES , A REVIEW
- High dimensional graphs and variable selection with the Lasso
Cited by
- Sparse Signal Sampling using Noisy Linear Projections
- Local stability and robustness of sparse dictionary learning in the presence of noise
- Penalized Bregman divergence for large-dimensional regression and classification.
- A Sparse Structured Shrinkage Estimator for Nonparametric Varying-Coefficient Model with an Application in Genomics
- Passive detection of radionuclides from weak and poorly resolved gamma-ray energy spectra
- AucPR: An AUC-based approach using penalized regression for disease prediction with high-dimensional omics data
- On the ℓ 1 -ℓ q Regularized Regression
- Data-driven methods for imputing national-level incidence in global burden of disease studies
- Grouped variable selection in high dimensional partially linear additive Cox model
- Variable Selection with Prior Information for Generalized Linear Models via the Prior LASSO Method
- A network-driven approach for genome-wide association mapping
- Variable Selection by Bayesian Adaptive Lasso and Iterative Adaptive Lasso, with Application for Genome-wide Multiple Loci Mapping
- A Unified Framework for Consistency of Regularized Loss Minimizers
- Sparsity Based Efficient Cross-Correlation Techniques in Sensor Networks
- Deterministic Compressed Sensing
- Nonconvex selection in nonparametric additive models
- A Comparison of Optimization Methods and Software for Large-scale L1-regularized Linear Classification
- Confidence Intervals for Low-Dimensional Parameters With High-Dimensional Data
- GROUP SPARSITY VIA LINEAR-TIME PROJECTION
- Sparse Group Selection Through Co-Adaptive Penalties
Related papers
- Statistics for High-Dimensional Data: Methods, Theory and Applications
- Lasso-type recovery of sparse representations for high-dimensional data
- Sparsity oracle inequalities for the Lasso
- High dimensional graphs and variable selection with the Lasso
- Discussion of “Sure Independence Screening for Ultra-High Dimensional Feature Space
- Model selection and estimation in regression with grouped variables
- Regression Shrinkage and Selection via the Lasso