Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
From MaRDI portal
(Redirected from Publication:58075)
Abstract: A number of variable selection methods have been proposed involving nonconvex penalty functions. These methods, which include the smoothly clipped absolute deviation (SCAD) penalty and the minimax concave penalty (MCP), have been demonstrated to have attractive theoretical properties, but model fitting is not a straightforward task, and the resulting solutions may be unstable. Here, we demonstrate the potential of coordinate descent algorithms for fitting these models, establishing theoretical convergence properties and demonstrating that they are significantly faster than competing approaches. In addition, we demonstrate the utility of convexity diagnostics to determine regions of the parameter space in which the objective function is locally convex, even though the penalty is not. Our simulation study and data examples indicate that nonconvex penalties like MCP and SCAD are worthwhile alternatives to the lasso in many applications. In particular, our numerical results suggest that MCP is the preferred approach among the three methods.
Recommendations
- Group coordinate descent algorithms for nonconvex penalized regression
- SparseNet: coordinate descent with nonconvex penalties
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Coordinate descent algorithms for lasso penalized regression
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cites work
- scientific article; zbMATH DE number 1687015 (Why is no real title available?)
- scientific article; zbMATH DE number 47310 (Why is no real title available?)
- scientific article; zbMATH DE number 1089159 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Coordinate descent algorithms for lasso penalized regression
- Heuristics of instability and stabilization in model selection
- Ideal spatial adaptation by wavelet shrinkage
- Least angle regression. (With discussion)
- Nearly unbiased variable selection under minimax concave penalty
- One-step sparse estimates in nonconcave penalized likelihood models
- Pathwise coordinate optimization
- Understanding WaveShrink: variance and bias estimation
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(only showing first 100 items - show all)- Bayesian inference for high-dimensional linear regression under mnet priors
- Multithreshold change plane model: estimation theory and applications in subgroup identification
- Adjusted regularized estimation in the accelerated failure time model with high dimensional covariates
- Adaptive and reversed penalty for analysis of high-dimensional correlated data
- A general theory of concave regularization for high-dimensional sparse estimation problems
- Individualized Multidirectional Variable Selection
- Multiple choice from competing regression models under multicollinearity based on standardized update
- Advanced algorithm for parameters estimation of negative binomial distribution with high dimensional sparse group structure
- Simultaneous variable selection and structural identification for time‐varying coefficient models
- High-dimensional linear regression with hard thresholding regularization: theory and algorithm
- A study on tuning parameter selection for the high-dimensional lasso
- Estimation of l₀ norm penalized models: a statistical treatment
- HiQR: an efficient algorithm for high-dimensional quadratic regression with penalties
- Ranking-based variable selection for high-dimensional data
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Inference for low‐ and high‐dimensional inhomogeneous Gibbs point processes
- Efficient sparse high-dimensional linear regression with a partitioned empirical Bayes ECM algorithm
- Simultaneous estimation of quantile regression functions using B-splines and total variation penalty
- Sparse estimation via nonconcave penalized likelihood in factor analysis model
- Cox reduction and confidence sets of models: a theoretical elucidation
- Subsampling based variable selection for generalized linear models
- Exponential regression for censored data with outliers
- Sure independence screening for real medical Poisson data
- Variable selection for longitudinal data with high-dimensional covariates and dropouts
- An unbiased approach to compressed sensing
- Bias versus non-convexity in compressed sensing
- Sparse regression: scalable algorithms and empirical performance
- Review and evaluation of penalised regression methods for risk prediction in low-dimensional data with few events
- A review of discriminant analysis in high dimensions
- Model Selection via Bayesian Information Criterion for Quantile Regression Models
- Nonconvex penalized ridge estimations for partially linear additive models in ultrahigh dimension
- Semiparametric Probit Regression Model with General Interval-Censored Failure Time Data
- Coordinate majorization descent algorithm for nonconvex penalized regression
- Model selection for varying coefficient nonparametric transformation model
- Selection of mixed copula for association modeling with tied observations
- Variable selection via generalized SELO-penalized linear regression models
- Feature selection algorithms in generalized additive models under concurvity
- Two-Way Truncated Linear Regression Models with Extremely Thresholding Penalization
- Multi-stage convex relaxation for feature selection
- Unified reciprocal LASSO estimation via least squares approximation
- A communication-efficient method for generalized linear regression with ℓ 0 regularization
- Ranking based variable selection for censored data using AFT models
- A generic coordinate descent solver for non-smooth convex optimisation
- Variable selection via generalized SELO-penalized Cox regression models
- Taking advantage of sampling designs in spatial small-area survey studies
- Fast, effective, and coherent time series modelling using the sparsity-ranked Lasso
- Estimation of optimal individualized treatment rules using a covariate-specific treatment effect curve with high-dimensional covariates
- Variable selection of partially functional linear spatial autoregressive model with a diverging number of parameters
- Portal nodes screening for large scale social networks
- A forward and backward stagewise algorithm for nonconvex loss functions with adaptive Lasso
- Bayesian inference on hierarchical nonlocal priors in generalized linear models
- A conditional Bayesian approach with valid inference for high dimensional logistic regression
- A class of coordinate descent methods with angle probability for solving linear systems
- Estimation of an oblique structure via penalized likelihood factor analysis
- Penalized estimation in additive varying coefficient models using grouped regularization
- Clustered federated learning based on nonconvex pairwise fusion
- Pathwise coordinate optimization
- Integrative analysis of cancer diagnosis studies with composite penalization
- Coordinate descent algorithms for lasso penalized regression
- A penalized likelihood method for structural equation modeling
- A primal dual active set with continuation algorithm for high-dimensional nonconvex SICA-penalized regression
- Global solutions to folded concave penalized nonconvex learning
- On the greedy coordinate descent methods for solving large linear least-squares problems
- Variable selection for frailty transformation models with application to diabetic complications
- A Penalized Regression Framework for Building Polygenic Risk Models Based on Summary Statistics From Genome-Wide Association Studies and Incorporating External Information
- Screening active factors in supersaturated designs
- Nearly optimal Bayesian shrinkage for high-dimensional regression
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Hard thresholding regularised logistic regression: theory and algorithms
- Convex and non-convex regularization methods for spatial point processes intensity estimation
- Partial penalized empirical likelihood ratio test under sparse case
- Distributed optimization for penalized regression in massive compositional data
- Group coordinate descent algorithms for nonconvex penalized regression
- The spike-and-slab LASSO
- Overview of robust variable selection methods for high-dimensional linear regression model
- Integrative subgroup analysis for high-dimensional mixed-type multi-response data
- Skinny Gibbs: a consistent and scalable Gibbs sampler for model selection
- Low-rank matrix recovery via nonconvex optimization methods with application to errors-in-variables matrix regression
- A fast algorithm for the accelerated failure time model with high-dimensional time-to-event data
- Sparse recovery based on the generalized error function
- Sparse classification: a scalable discrete optimization perspective
- Endogeneity in high dimensions
- A new double-regularized regression using Liu and Lasso regularization
- Variable selection and estimation for semi-parametric multiple-index models
- Visualization and assessment of model selection uncertainty
- Coordinate descent algorithm for covariance graphical Lasso
- Broken adaptive ridge regression and its asymptotic properties
- Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
- High-dimensional regression in practice: an empirical study of finite-sample prediction, variable selection and ranking
- Variable selection in the Box-Cox power transformation model
- False discovery rate control for high-dimensional Cox model with uneven data splitting
- Penalized logistic regression with prior information for microarray gene expression classification
- One-step sparse ridge estimation with folded concave penalty
- Non-convex penalized estimation in high-dimensional models with single-index structure
- I-LAMM for sparse learning: simultaneous control of algorithmic complexity and statistical error
- Statistical Inference for High-Dimensional Models via Recursive Online-Score Estimation
- Variable importance based interaction modelling with an application on initial spread of COVID-19 in China
- A novel nonconvex, smooth-at-origin penalty for statistical learning
- PDAS: a Newton-type method for L₀ regularized accelerated failure time model
This page was built for publication: Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q58075)
