An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors
From MaRDI portal
Publication:1927082
DOI10.1016/J.CSDA.2011.11.013zbMATH Open1255.62209arXiv0911.5460OpenAlexW2058381303MaRDI QIDQ1927082FDOQ1927082
Authors: Yiyuan She 
Publication date: 30 December 2012
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Abstract: High-dimensional data pose challenges in statistical learning and modeling. Sometimes the predictors can be naturally grouped where pursuing the between-group sparsity is desired. Collinearity may occur in real-world high-dimensional applications where the popular technique suffers from both selection inconsistency and prediction inaccuracy. Moreover, the problems of interest often go beyond Gaussian models. To meet these challenges, nonconvex penalized generalized linear models with grouped predictors are investigated and a simple-to-implement algorithm is proposed for computation. A rigorous theoretical result guarantees its convergence and provides tight preliminary scaling. This framework allows for grouped predictors and nonconvex penalties, including the discrete and the `' type penalties. Penalty design and parameter tuning for nonconvex penalties are examined. Applications of super-resolution spectrum estimation in signal processing and cancer classification with joint gene selection in bioinformatics show the performance improvement by nonconvex penalized estimation.
Full work available at URL: https://arxiv.org/abs/0911.5460
Recommendations
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Sparse optimization for nonconvex group penalized estimation
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Group coordinate descent algorithms for nonconvex penalized regression
- SparseNet: coordinate descent with nonconvex penalties
Applications of statistics to biology and medical sciences; meta analysis (62P10) Generalized linear models (logistic models) (62J12) Inference from stochastic processes and spectral analysis (62M15)
Cites Work
- Nearly unbiased variable selection under minimax concave penalty
- Least angle regression. (With discussion)
- Pathwise coordinate optimization
- Extended Bayesian information criteria for model selection with large model spaces
- Title not available (Why is that?)
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Title not available (Why is that?)
- One-step sparse estimates in nonconcave penalized likelihood models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Atomic Decomposition by Basis Pursuit
- Sure Independence Screening for Ultrahigh Dimensional Feature Space
- Regularization and Variable Selection Via the Elastic Net
- Model Selection and Estimation in Regression with Grouped Variables
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- Decoding by Linear Programming
- Sparse regression with exact clustering
- A note on the Lasso and related procedures in model selection
- Some sharp performance bounds for least squares regression with \(L_1\) regularization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Thresholding-based iterative selection procedures for model selection and shrinkage
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Wavelet methods in statistics: some recent developments and their applications
- Outlier detection using nonconvex penalized regression
- Empirical Bayes estimates for large-scale prediction problems
- Dimension reduction and variable selection in case control studies via regularized likelihood optimization
Cited In (29)
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Entropy function-based algorithms for solving a class of nonconvex minimization problems
- Group sparse recovery via group square-root elastic net and the iterative multivariate thresholding-based algorithm
- Generalized co-sparse factor regression
- Generalized fused Lasso for grouped data in generalized linear models
- Penalized estimation in additive varying coefficient models using grouped regularization
- A tailored multivariate mixture model for detecting proteins of concordant change among virulent strains of \textit{clostridium perfringens}
- Grouping pursuit through a regularization solution surface
- Iteratively reweighted group Lasso based on log-composite regularization
- On the finite-sample analysis of \(\Theta\)-estimators
- The non-convex sparse problem with nonnegative constraint for signal reconstruction
- Studies of the adaptive network-constrained linear regression and its application
- The 3rd special issue on optimization heuristics in estimation and modelling problems
- Flexible, boundary adapted, nonparametric methods for the estimation of univariate piecewise-smooth functions
- High-dimensional functional graphical model structure learning via neighborhood selection approach
- Robust alternating low-rank representation by joint \(L_p\)- and \(L_{2,p}\)-norm minimization
- A thresholding algorithm for order selection in finite mixture models
- On the finite-sample analysis of \(\Theta\)-estimators
- A group VISA algorithm for variable selection
- Variable selection under multicollinearity using modified log penalty
- Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning
- Order selection for regression-based hidden Markov model
- On Cross-Validation for Sparse Reduced Rank Regression
- Joint variable and rank selection for parsimonious estimation of high-dimensional matrices
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- Group regularized estimation under structural hierarchy
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
- Penalized wavelet nonparametric univariate logistic regression for irregular spaced data
- Weighted nuclear norm minimization and its applications to low level vision
Uses Software
This page was built for publication: An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1927082)
