Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors

09/10/2012
by   Patrick Breheny, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/2016

Efficient Clustering of Correlated Variables and Variable Selection in High-Dimensional Linear Models

In this paper, we introduce Adaptive Cluster Lasso(ACL) method for varia...
research
11/29/2009

An Iterative Algorithm for Fitting Nonconvex Penalized Generalized Linear Models with Grouped Predictors

High-dimensional data pose challenges in statistical learning and modeli...
research
05/25/2021

Group selection and shrinkage with application to sparse semiparametric modeling

Sparse regression and classification estimators capable of group selecti...
research
02/28/2018

Semi-Analytic Resampling in Lasso

An approximate method for conducting resampling in Lasso, the ℓ_1 penali...
research
04/07/2017

A Brief Introduction to the Temporal Group LASSO and its Potential Applications in Healthcare

The Temporal Group LASSO is an example of a multi-task, regularized regr...
research
02/07/2008

Least angle and ℓ_1 penalized regression: A review

Least Angle Regression is a promising technique for variable selection a...
research
10/27/2014

A Greedy Homotopy Method for Regression with Nonconvex Constraints

Constrained least squares regression is an essential tool for high-dimen...

Please sign up or login with your details

Forgot password? Click here to reset