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.

References in corpus (6)

• Nearly unbiased variable selection under minimax concave penalty
• Pathwise coordinate optimization
• One-step sparse estimates in nonconcave penalized likelihood models
• Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
• Coordinate descent algorithms for lasso penalized regression
• A Selective Review of Group Selection in High-Dimensional Models

Cited by in corpus (17)

• Group Sparse Recovery via the ${\ell }^0({\ell }^2)$ Penalty: Theory and Algorithm
• Spike-and-Slab Group Lassos for Grouped Regression and Sparse Generalized Additive Models
• Overlapping group logistic regression with applications to genetic pathway selection
• Scalar on time-by-distribution regression and its application for modelling associations between daily-living physical activity and cognitive functions in Alzheimer's Disease
• Hybrid safe-strong rules for efficient optimization in lasso-type problems
• Designing Patient-Specific Optimal Neurostimulation Patterns for Seizure Suppression
• Fully Bayesian Classification with Heavy-tailed Priors for Selection in High-dimensional Features with Grouping Structure
• Sparse quadratic classification rules via linear dimension reduction
• Scalable algorithms for semiparametric accelerated failure time models in high dimensions
• On Selection of Semiparametric Spatial Regression Models
• Sparse Model Identification and Learning for Ultra-high-dimensional Additive Partially Linear Models
• A Convex-Nonconvex Strategy for Grouped Variable Selection
• Simultaneous nonparametric regression in RADWT dictionaries
• Approximate Laplace approximations for scalable model selection
• Efficient computation of high-dimensional penalized piecewise constant hazard random effects models
• Variable Selection in Functional Linear Cox Model
• Group Spike and Slab Variational Bayes