Display Settings:

Format

Send to:

Choose Destination
See comment in PubMed Commons below
J Stat Softw. 2010;33(1):1-22.

Regularization Paths for Generalized Linear Models via Coordinate Descent.

Author information

  • 1Department of Statistics, Stanford University.

Abstract

We develop fast algorithms for estimation of generalized linear models with convex penalties. The models include linear regression, two-class logistic regression, and multinomial regression problems while the penalties include ℓ(1) (the lasso), ℓ(2) (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.

PMID:
20808728
[PubMed]
PMCID:
PMC2929880
Free PMC Article

Images from this publication.See all images (1)Free text

Figure 1
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Icon for PubMed Central
    Loading ...
    Write to the Help Desk