Least Angle Regression
Bradley Efron, Trevor Hastie, Iain Johnstone, Robert Tibshirani
Abstract
The purpose of model selection algorithms such as All Subsets, Forward Selection and Backward Elimination is to choose a linear model on the basis of the same set of data to which the model will be applied. Typically we have available a large collection of possible covariates from which we hope to select a parsimonious set for the efficient prediction of a response variable. Least Angle Regression (LARS), a new model selection algorithm, is a useful and less greedy version of traditional forward selection methods. Three main properties are derived: (1) A simple modification of the LARS algorithm implements the Lasso, an attractive version of ordinary least squares that constrains the sum of the absolute regression coefficients; the LARS modification calculates all possible Lasso estimates for a given problem, using an order of magnitude less computer time than previous methods. (2) A different LARS modification efficiently implements Forward Stagewise linear regression, another promising new model selection method;
Create a lesson
Related papers
Sampling with collective variables: Relative error analysis for umbrella sampling under general conditions
Holden Lee, Matheau Santana-Gijzen, Jonathan Weare
Inference for Fréchet Mean Sets
Ryunosuke Miyazaki
Minimax rates for pointwise CATE estimation: the role of design smoothness
Yuxuan Hou, Zhenghan Li
A pedestrian's approach to Bayesian methods for inverse problems
Heiko Gimperlein, Michael Oberguggenberger
Interpolation and coherence in multiple testing
Ninh Tran, Dennis Leung, Jesse Hemerik
A new approach for estimating the number of spikes in high-dimensional Gaussian models
Hugo Jeannin, Pascal Vallet, Florent Bouchard et al.