Regularization Paths for Generalized Linear Models via Coordinate Descent

We develop fast algorithms for estimation of generalized linear models with convex penalties. The models include linear regression, two-class logistic regression, and multi- nomial regression problems while the penalties include ℓ<sub>1</sub> (the lasso), ℓ<sub>2</sub> (ridge...

Full description

Bibliographic Details
Main Authors: Jerome Friedman, Trevor Hastie, Rob Tibshirani
Format: Article
Language:English
Published: Foundation for Open Access Statistics 2010-02-01
Series:Journal of Statistical Software
Subjects:
Online Access:http://www.jstatsoft.org/v33/i01/paper
Description
Summary:We develop fast algorithms for estimation of generalized linear models with convex penalties. The models include linear regression, two-class logistic regression, and multi- nomial regression problems while the penalties include ℓ<sub>1</sub> (the lasso), ℓ<sub>2</sub> (ridge regression) and mixtures of the two (the elastic net). The algorithms use cyclical coordinate descent, computed along a regularization path. The methods can handle large problems and can also deal efficiently with sparse features. In comparative timings we find that the new algorithms are considerably faster than competing methods.
ISSN:1548-7660