Mathematics – Statistics Theory
Scientific paper
2007-08-16
Annals of Statistics 2007, Vol. 35, No. 3, 1012-1030
Mathematics
Statistics Theory
Published at http://dx.doi.org/10.1214/009053606000001370 in the Annals of Statistics (http://www.imstat.org/aos/) by the Inst
Scientific paper
10.1214/009053606000001370
We consider the generic regularized optimization problem $\hat{\mathsf{\beta}}(\lambda)=\arg \min_{\beta}L({\sf{y}},X{\sf{\beta}})+\lambda J({\sf{\beta}})$. 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 $J(\beta)=\|\beta\|_1$ is the $\ell_1$ norm of $\beta$--the optimal coefficient path is piecewise linear, that is, $\partial \hat{\beta}(\lambda)/\partial \lambda$ 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.
Rosset Saharon
Zhu Jia-Ji
No associations
LandOfFree
Piecewise linear regularized solution paths does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Piecewise linear regularized solution paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Piecewise linear regularized solution paths will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-331886