Regularization Paths for Generalized Linear Models via Coordinate Descent.

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.

Extracted Key Phrases

Showing 1-10 of 47 references

A MATLAB Implementation of glmnet

  • H Jiang
  • 2009
1 Excerpt

Matrix: Sparse and Dense Matrix Classes and Methods. R package version 0

  • D Bates, M Maechler
  • 2009
1 Excerpt

glmnet: Lasso and Elastic-Net Regularized Generalized Linear Models. R package version 1.1-4

  • J Friedman, T Hastie, R Tibshirani
  • 2009

penalized: L1 (Lasso) and L2 (Ridge) Penalized Estimation in GLMs and in the Cox Model. R package version 0

  • J Goeman
  • 2009
1 Excerpt

Fast Sparse Regression and Classification

  • J Friedman
  • 2008
Showing 1-10 of 1,469 extracted citations
0500100015002008200920102011201220132014201520162017
Citations per Year

7,802 Citations

Semantic Scholar estimates that this publication has received between 6,876 and 8,817 citations based on the available data.

See our FAQ for additional information.