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

DOI10.1007/S11222-013-9424-2zbMATH Open1331.62359arXiv1209.2160OpenAlexW3124158594WikidataQ41270112 ScholiaQ41270112MaRDI QIDQ5962732FDOQ5962732

Authors: Patrick Breheny, Jian Huang 

Publication date: 23 February 2016

Published in: Statistics and Computing (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1209.2160

Recommendations

• Group coordinate descent algorithms for nonconvex penalized regression
• Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
• Penalized methods for bi-level variable selection
• Sparse optimization for nonconvex group penalized estimation
• Coordinate descent algorithms for lasso penalized regression

zbMATH Keywords

optimizationpenalized regressiongroup Lassodescent algorithms

Mathematics Subject Classification ID

Ridge regression; shrinkage estimators (Lasso) (62J07) Generalized linear models (logistic models) (62J12)

Cites Work

• Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
• Nearly unbiased variable selection under minimax concave penalty
• Pathwise coordinate optimization
• Coordinate descent algorithms for lasso penalized regression
• Ideal spatial adaptation by wavelet shrinkage
• Title not available (Why is that?)
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Title not available (Why is that?)
• Convergence of a block coordinate descent method for nondifferentiable minimization
• One-step sparse estimates in nonconcave penalized likelihood models
• Model Selection and Estimation in Regression with Grouped Variables
• The Group Lasso for Logistic Regression
• A selective review of group selection in high-dimensional models
• Sparse Additive Models
• Variable Selection in Nonparametric Varying-Coefficient Models for Analysis of Repeated Measurements
• Standardization and the group lasso penalty
• Title not available (Why is that?)
• An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors

Cited In (86)

• Forward variable selection for sparse ultra-high-dimensional generalized varying coefficient models
• Consistent tuning parameter selection in high-dimensional group-penalized regression
• High-dimensional grouped folded concave penalized estimation via the LLA algorithm
• Simultaneous nonparametric regression in RADWT dictionaries
• Multivariate functional generalized additive models
• Nonparametric additive beta regression for fractional response with application to body fat data
• Hybrid safe-strong rules for efficient optimization in Lasso-type problems
• Shrinkage priors for Bayesian penalized regression
• Coordinate majorization descent algorithm for nonconvex penalized regression
• Variable selection in nonlinear function‐on‐scalar regression
• Feature screening for generalized varying coefficient models with application to dichotomous responses
• Adaptive hybrid screening for efficient lasso optimization
• Principal single-index varying-coefficient models for dimension reduction in quantile regression
• Oracle inequalities for sparse additive quantile regression in reproducing kernel Hilbert space
• Adaptive group Lasso for high-dimensional generalized linear models
• Rank reduction for high-dimensional generalized additive models
• Title not available (Why is that?)
• High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
• Sparse model identification and learning for ultra-high-dimensional additive partially linear models
• Estimating a sparse reduction for general regression in high dimensions
• Forward selection for feature screening and structure identification in varying coefficient models
• Principal varying coefficient estimator for high-dimensional models
• Estimating DNA methylation levels by joint modeling of multiple methylation profiles from microarray data
• Structural identification and variable selection in high-dimensional varying-coefficient models
• Modeling Between-Study Heterogeneity for Improved Replicability in Gene Signature Selection and Clinical Prediction
• The Group Lasso for Logistic Regression
• A convex-Nonconvex strategy for grouped variable selection
• Variable Selection with Multiply-Imputed Datasets: Choosing Between Stacked and Grouped Methods
• Group screening for ultra-high-dimensional feature under linear model
• Regularized estimation for the least absolute relative error models with a diverging number of covariates
• Subspace quadratic regularization method for group sparse multinomial logistic regression
• A principal varying-coefficient model for quantile regression: joint variable selection and dimension reduction
• Sparse pathway-based prediction models for high-throughput molecular data
• Modified adaptive group lasso for high-dimensional varying coefficient models
• Sparse optimization for nonconvex group penalized estimation
• A GROUP REGULARISATION APPROACH FOR CONSTRUCTING GENERALISED AGE-PERIOD-COHORT MORTALITY PROJECTION MODELS
• Nonconvex penalized reduced rank regression and its oracle properties in high dimensions
• A joint estimation approach to sparse additive ordinary differential equations
• Central subspaces review: methods and applications
• Pursuit of dynamic structure in quantile additive models with longitudinal data
• Model selection and estimation in high dimensional regression models with group SCAD
• Penalized Cox's proportional hazards model for high-dimensional survival data with grouped predictors
• Title not available (Why is that?)
• Penalized variable selection in competing risks regression
• Computation of second-order directional stationary points for group sparse optimization
• Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
• Model Selection and Estimation in Regression with Grouped Variables
• A group VISA algorithm for variable selection
• Group penalized quantile regression
• Title not available (Why is that?)
• Spike-and-Slab Group Lassos for Grouped Regression and Sparse Generalized Additive Models
• Quantile regression feature selection and estimation with grouped variables using Huber approximation
• PUlasso: High-Dimensional Variable Selection With Presence-Only Data
• Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
• Sparse reduced-rank regression for multivariate varying-coefficient models
• Multi-Armed Angle-Based Direct Learning for Estimating Optimal Individualized Treatment Rules With Various Outcomes
• Variable Selection for Multiple Function-on-Function Linear Regression
• GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee
• Quantile regression with group Lasso for classification
• Bayesian group selection in logistic regression with application to MRI data analysis
• Iteratively Reweighted Group Lasso Based on Log-Composite Regularization
• Sparse quadratic classification rules via linear dimension reduction
• The composite absolute penalties family for grouped and hierarchical variable selection
• SSGL
• Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
• Smoothing composite proximal gradient algorithm for sparse group Lasso problems with nonsmooth loss functions
• A generalized formulation for group selection via ADMM
• Variable selection for nonparametric additive Cox model with interval‐censored data
• Multi-Task Learning with High-Dimensional Noisy Images
• A primal dual active set with continuation algorithm for high-dimensional nonconvex SICA-penalized regression
• Mechanism and a new algorithm for nonconvex clustering
• Scalable algorithms for semiparametric accelerated failure time models in high dimensions
• Nonconvex fusion penalties for high-dimensional hierarchical categorical variables
• Oracle inequalities for weighted group Lasso in high-dimensional Poisson regression model
• Grouped variable selection with discrete optimization: computational and statistical perspectives
• Penalized integrative semiparametric interaction analysis for multiple genetic datasets
• Interpretability of bi-level variable selection methods
• Sparse group penalties for bi-level variable selection
• Structured sparse logistic regression with application to lung cancer prediction using breath volatile biomarkers
• Designing Patient-Specific Optimal Neurostimulation Patterns for Seizure Suppression
• Model selection for inferring Gaussian graphical models
• Generalized regression estimators with concave penalties and a comparison to lasso type estimators
• Multivariate scalar on multidimensional distribution regression with application to modeling the association between physical activity and cognitive functions
• Estimation and variable selection for generalized functional partially varying coefficient hybrid models
• Prediction of sports injuries in football: a recurrent time-to-event approach using regularized Cox models
• On selection of semiparametric spatial regression models

Uses Software

• glmnet
• S+WAVELETS

This page was built for publication: Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962732)