Piecewise linear regularized solution paths

From MaRDI portal
Publication:2642739



Abstract: We consider the generic regularized optimization problem . Efron, Hastie, Johnstone and Tibshirani [Ann. Statist. 32 (2004) 407--499] have shown that for the LASSO--that is, if L is squared error loss and is the ell1 norm of --the optimal coefficient path is piecewise linear, that is, is piecewise constant. We derive a general characterization of the properties of (loss L, penalty J) pairs which give piecewise linear coefficient paths. Such pairs allow for efficient generation of the full regularized coefficient paths. We investigate the nature of efficient path following algorithms which arise. We use our results to suggest robust versions of the LASSO for regression and classification, and to develop new, efficient algorithms for existing problems in the literature, including Mammen and van de Geer's locally adaptive regression splines.





Cited in
(only showing first 100 items - show all)


Describes a project that uses

Uses Software






This page was built for publication: Piecewise linear regularized solution paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642739)