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)- An alternating direction method of multipliers for MCP-penalized regression with high-dimensional data
- A model-averaging approach for high-dimensional regression
- On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
- Gauss-Seidel method with oblique direction
- Cross validation in sparse linear regression with piecewise continuous nonconvex penalties and its acceleration
- Nonconvex penalized ridge estimations for partially linear additive models in ultrahigh dimension
- Variable selection and estimation for semi-parametric multiple-index models
- The horseshoe-like regularization for feature subset selection
- Variable selection and parameter estimation with the Atan regularization method
- Identification of proportionality structure with two-part models using penalization
- Natural coordinate descent algorithm for \(\ell_1\)-penalised regression in generalised linear models
- GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee
- High-dimensional variable selection via low-dimensional adaptive learning
- An ADMM with continuation algorithm for non-convex SICA-penalized regression in high dimensions
- Variable selection and estimation using a continuous approximation to the \(L_0\) penalty
- Estimation of an oblique structure via penalized likelihood factor analysis
- Model averaging for generalized linear models with missing at random covariates
- A unified primal dual active set algorithm for nonconvex sparse recovery
- Variable Selection for Multiple Function-on-Function Linear Regression
- Sparse regression: scalable algorithms and empirical performance
- Sparse vector Markov switching autoregressive models. Application to multivariate time series of temperature
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Adaptive and reversed penalty for analysis of high-dimensional correlated data
- Outlier detection under a covariate-adjusted exponential regression model with censored data
- Simultaneous estimation of quantile regression functions using B-splines and total variation penalty
- Selection of fixed effects in high-dimensional generalized linear mixed models
- Linear hypothesis testing for high dimensional generalized linear models
- Broken adaptive ridge regression and its asymptotic properties
- Efficiency for Regularization Parameter Selection in Penalized Likelihood Estimation of Misspecified Models
- Screening active factors in supersaturated designs
- Model selection for Cox models with time-varying coefficients
- Truncated \(L_1\) regularized linear regression: theory and algorithm
- Variable selection in large margin classifier-based probability estimation with high-dimensional predictors
- An unbiased approach to compressed sensing
- Variable selection for high-dimensional generalized linear models with the weighted elastic-net procedure
- Broken adaptive ridge regression for right-censored survival data
- Robust network-based analysis of the associations between (epi)genetic measurements
- Convex and non-convex regularization methods for spatial point processes intensity estimation
- Fully Bayesian logistic regression with hyper-LASSO priors for high-dimensional feature selection
- A penalized likelihood method for structural equation modeling
- Pruning variable selection ensembles
- Portal nodes screening for large scale social networks
- Variable selection for zero‐inflated and overdispersed data with application to health care demand in Germany
- scientific article; zbMATH DE number 6982301 (Why is no real title available?)
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems
- A forward and backward stagewise algorithm for nonconvex loss functions with adaptive Lasso
- Partial penalized empirical likelihood ratio test under sparse case
- High-dimensional sparse portfolio selection with nonnegative constraint
- I-LAMM for sparse learning: simultaneous control of algorithmic complexity and statistical error
- Stable prediction in high-dimensional linear models
- A coordinate descent algorithm for computing penalized smooth quantile regression
- Coordinate majorization descent algorithm for nonconvex penalized regression
- A Critical Review of LASSO and Its Derivatives for Variable Selection Under Dependence Among Covariates
- An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems
- Structural identification and variable selection in high-dimensional varying-coefficient models
- A new double-regularized regression using Liu and Lasso regularization
- Likelihood adaptively modified penalties
- \(\ell_0\)-regularized high-dimensional accelerated failure time model
- Ranked sparsity: a cogent regularization framework for selecting and estimating feature interactions and polynomials
- Selecting massive variables using an iterated conditional modes/medians algorithm
- A note on the one-step estimator for ultrahigh dimensionality
- One-step sparse estimates in nonconcave penalized likelihood models
- Adjusted regularized estimation in the accelerated failure time model with high dimensional covariates
- APPLE: approximate path for penalized likelihood estimators
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- Non-convex penalized estimation in high-dimensional models with single-index structure
- Pathwise coordinate optimization
- Visualization and assessment of model selection uncertainty
- Majorization minimization by coordinate descent for concave penalized generalized linear models
- Group coordinate descent algorithms for nonconvex penalized regression
- Global solutions to folded concave penalized nonconvex learning
- Group structure detection for a high‐dimensional panel data model
- A novel variational Bayesian method for variable selection in logistic regression models
- Coordinate descent algorithms for lasso penalized regression
- Penalized variable selection in competing risks regression
- Inference for low‐ and high‐dimensional inhomogeneous Gibbs point processes
- Penalized principal logistic regression for sparse sufficient dimension reduction
- High-Dimensional Sparse Additive Hazards Regression
- A modified local quadratic approximation algorithm for penalized optimization problems
- Ranking-based variable selection for high-dimensional data
- Model Selection via Bayesian Information Criterion for Quantile Regression Models
- A study on tuning parameter selection for the high-dimensional lasso
- Hierarchical Bayes, maximum a posteriori estimators, and minimax concave penalized likelihood estimation
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- Ultrahigh dimensional variable selection through the penalized maximum trimmed likelihood estimator
- A general theory of concave regularization for high-dimensional sparse estimation problems
- Variable selection via generalized SELO-penalized Cox regression models
- Penalized estimation in additive varying coefficient models using grouped regularization
- Approximated penalized maximum likelihood for exploratory factor analysis: an orthogonal case
- Group penalized quantile regression
- The group exponential Lasso for bi-level variable selection
- Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
- Nonnegative estimation and variable selection under minimax concave penalty for sparse high-dimensional linear regression models
- MM for penalized estimation
- A selective review of group selection in high-dimensional models
- The spike-and-slab LASSO
- ncvreg
- Multiple choice from competing regression models under multicollinearity based on standardized update
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)
