Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- PMID: 25750488
- PMCID: PMC4349417
- DOI: 10.1007/s11222-013-9424-2
Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
Abstract
Penalized regression is an attractive framework for variable selection problems. Often, variables possess a grouping structure, and the relevant selection problem is that of selecting groups, not individual variables. The group lasso has been proposed as a way of extending the ideas of the lasso to the problem of group selection. Nonconvex penalties such as SCAD and MCP have been proposed and shown to have several advantages over the lasso; these penalties may also be extended to the group selection problem, giving rise to group SCAD and group MCP methods. Here, we describe algorithms for fitting these models stably and efficiently. In addition, we present simulation results and real data examples comparing and contrasting the statistical properties of these methods.
Figures
References
-
- Bakin S. Ph.D. thesis. Australian National University; 1999. Adaptive regression and model selection in data mining problems.
-
- Bertsekas D. Nonlinear Programming. 2nd ed. Athena Scientific; 1999.
-
- Chiang A, Beck J, Yen H, Tayeh M, Scheetz T, Swiderski R, Nishimura D, Braun T, Kim K, Huang J, et al. Homozygosity mapping with snp arrays identifies trim32, an e3 ubiquitin ligase, as a bardet–biedl syndrome gene (bbs11). Proceedings of the National Academy of Sciences. 2006;103:6287–6292. - PMC - PubMed
-
- Donoho D, Johnstone J. Ideal spatial adaptation by wavelet shrinkage. Biometrika. 1994;81:425–455.
Grants and funding
LinkOut - more resources
Full Text Sources
Other Literature Sources
Miscellaneous