Abstract

We propose a new method for estimation in linear models. The "lasso" minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant. Because of the nature of this constraint it tends to produce some coefficients that are exactly zero and hence gives interpretable models. Our simulation studies suggest that the lasso enjoys some of the favourable properties of both subset selection and ridge regression. It produces interpretable models like subset selection and exhibits the stability of ridge regression. There is also an interesting relationship with recent work in adaptive function estimation by Donoho and Johnstone. The lasso idea is quite general and can be applied in a variety of statistical models: extensions to generalized regression models and tree-based models are briefly described. Keywords: regression, subset selection, shrinkage, quadratic programming. 1 Introduction Consider the usual regression situation: we h...

Citations

3144	Classification and Regression Trees - Breiman, Friedman, et al. - 1984
1785	An Introduction to the Bootstrap - Efron, Tibshirani - 1993
969	Generalized Additive Models - Hastie, Tibshirani - 1990
374	RJ, Solving Least Squares Problems - CL, Hanson - 1974
230	Variable selection via Gibbs sampling - George, McCulloch - 1993
192	Multivariate Adaptive Regression Splines (with discussion - Friedman - 1991
6	Better subset selection using the non-negative garotte - Breiman - 1995