zbMATH — the first resource for mathematics

LARS-type algorithm for group Lasso. (English) Zbl 1384.62263
Summary: The least absolute shrinkage and selection operator (lasso) has been widely used in regression analysis. Based on the piecewise linear property of the solution path, least angle regression provides an efficient algorithm for computing the solution paths of lasso. Group lasso is an important generalization of lasso that can be applied to regression with grouped variables. However, the solution path of group lasso is not piecewise linear and hence cannot be obtained by least angle regression. By transforming the problem into a system of differential equations, we develop an algorithm for efficient computation of group lasso solution paths. Simulation studies are conducted for comparing the proposed algorithm to the best existing algorithm: the groupwise-majorization-descent algorithm.
62J07 Ridge regression; shrinkage estimators (Lasso)
62P10 Applications of statistics to biology and medical sciences; meta analysis
Full Text: DOI
[1] Efron, B; Hastie, T; Johnstone, I; Tibshirani, R; etal., Least angle regression, Ann. Stat., 32, 407-499, (2004) · Zbl 1091.62054
[2] Friedman, J; Hastie, T; Tibshirani, R, Regularization paths for generalized linear models via coordinate descent, J. Stat. Softw., 33, 1, (2010)
[3] Fu, WJ, Penalized regressions: the bridge versus the lasso, J. Comput. Graph. Stat., 7, 397-416, (1998)
[4] Hindmarsh, AC; Stepleman, RS (ed.); etal., Odepack, a systematized collection of ODE solvers, No. 1, 55-64, (1983), Amsterdam
[5] Hosmer Jr., D.W., Lemeshow, S., Sturdivant, R.X.: Applied Logistic Regression, vol. 398. Wiley, New York (2013) · Zbl 1276.62050
[6] Liu, J; Ji, S; Ye, J, Slep: sparse learning with efficient projections, Arizona State Univ., 6, 491, (2009)
[7] Osborne, MR; Presnell, B; Turlach, BA, On the lasso and its dual, J. Comput. Graph. Stat., 9, 319-337, (2000)
[8] Radhakrishnan, K., Hindmarsh, A. C.: Description anduse of LSODE, the Livermore solver for ordinary differentialequations. National Aeronautics and Space Administration, Office ofManagement, Scientific and Technical Information Program (1993) · Zbl 1367.62223
[9] Rosset, S., Zhu, J.: Piecewise linear regularized solution paths. Ann. Stat. 35, 1012-1030 (2007) · Zbl 1194.62094
[10] Roth, V., Fischer, B.: The group-lasso for generalized linear models: uniqueness of solutions and efficient algorithms. In: Proceedings of the 25th International Conference on Machine learning, pp. 848-855. ACM (2008)
[11] Tibshirani, R, Regression shrinkage and selection via the lasso, J. R. Stat. Soc. Ser. B (Methodol.), 58, 267-288, (1996) · Zbl 0850.62538
[12] Tibshirani, R.J.: The Solution Path of the Generalized Lasso. Stanford University, Stanford (2011) · Zbl 1234.62107
[13] Tibshirani, RJ; etal., The lasso problem and uniqueness, Electron. J. Stat., 7, 1456-1490, (2013) · Zbl 1337.62173
[14] Yang, Y., Zou, H.: A fast unified algorithm for solving group-lasso penalize learning problems. Stat. Comput., 1-13 (2014) · Zbl 0850.62538
[15] Yuan, M; Lin, Y, Model selection and estimation in regression with grouped variables, J. R. Stat. Soc. Ser. B (Stat. Methodol.), 68, 49-67, (2006) · Zbl 1141.62030
[16] Zhou, H; Wu, Y, A generic path algorithm for regularized statistical estimation, J. Am. Stat. Assoc., 109, 686-699, (2014) · Zbl 1367.62223
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.