L1‐regularization path algorithm for generalized linear models

Mee Young Park and Trevor Hastie

Journal of the Royal Statistical Society Series B, 2007, vol. 69, issue 4, 659-677

Abstract: Summary. We introduce a path following algorithm for L1‐regularized generalized linear models. The L1‐regularization procedure is useful especially because it, in effect, selects variables according to the amount of penalization on the L1‐norm of the coefficients, in a manner that is less greedy than forward selection–backward deletion. The generalized linear model path algorithm efficiently computes solutions along the entire regularization path by using the predictor–corrector method of convex optimization. Selecting the step length of the regularization parameter is critical in controlling the overall accuracy of the paths; we suggest intuitive and flexible strategies for choosing appropriate values. We demonstrate the implementation with several simulated and real data sets.

Date: 2007
References: View complete reference list from CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
https://doi.org/10.1111/j.1467-9868.2007.00607.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jorssb:v:69:y:2007:i:4:p:659-677

Ordering information: This journal article can be ordered from
http://ordering.onli ... 1111/(ISSN)1467-9868

Access Statistics for this article

Journal of the Royal Statistical Society Series B is currently edited by P. Fryzlewicz and I. Van Keilegom

More articles in Journal of the Royal Statistical Society Series B from Royal Statistical Society Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().