Regularization Paths for Generalized Linear Models via Coordinate Descent

By Jerome H. Friedman, Trevor J. Hastie, Robert Tibshirani. 2010

18,574 citations recorded by the source corpus.

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.

Subfields: Computational Mechanics, Computer Vision and Pattern Recognition, Statistics and Probability, Mathematical Optimization

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mechanics

  1. Francis R. Bach
  2. Peter Richtárik
  3. Martin Jaggi
  4. Robert Tibshirani
  5. Martin J. Wainwright
  6. Martin Takác
  7. Wotao Yin
  8. Michael I. Jordan

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Dacheng Tao
  3. Ming-Hsuan Yang
  4. Trevor Darrell
  5. Xiaogang Wang
  6. Andrew Zisserman
  7. Jitendra Malik
  8. Andrea Vedaldi

In Statistics and Probability

  1. Stefan Wager
  2. Robert Tibshirani
  3. Peter Buhlmann
  4. Susan Athey
  5. Victor Chernozhukov
  6. Martin J. Wainwright
  7. Bin Yu
  8. Cun-Hui Zhang

In Mathematical Optimization

  1. Cynthia Rudin
  2. Robert Tibshirani
  3. Berk Ustun
  4. Stefan Wager
  5. Martin Jaggi
  6. Sara A. van de Geer
  7. Peter Buhlmann
  8. Bin Yu

Citations in the corpus