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
- 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
- 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?)
- 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)- Selection by partitioning the solution paths
- The group exponential Lasso for bi-level variable selection
- A modified local quadratic approximation algorithm for penalized optimization problems
- Solving norm constrained portfolio optimization via coordinate-wise descent algorithms
- Screening active factors in supersaturated designs
- Estimation of an oblique structure via penalized likelihood factor analysis
- An alternating direction method of multipliers for MCP-penalized regression with high-dimensional data
- Variable selection via generalized SELO-penalized linear regression models
- Penalized principal logistic regression for sparse sufficient dimension reduction
- Variable selection and parameter estimation with the Atan regularization method
- Sparse vector Markov switching autoregressive models. Application to multivariate time series of temperature
- Identification of proportionality structure with two-part models using penalization
- Natural coordinate descent algorithm for \(\ell_1\)-penalised regression in generalised linear models
- A forward and backward stagewise algorithm for nonconvex loss functions with adaptive Lasso
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
- A penalized likelihood method for structural equation modeling
- Variable selection and estimation using a continuous approximation to the \(L_0\) penalty
- A coordinate descent algorithm for computing penalized smooth quantile regression
- A novel variational Bayesian method for variable selection in logistic regression models
- Simultaneous estimation of quantile regression functions using B-splines and total variation penalty
- Nonconvex penalized ridge estimations for partially linear additive models in ultrahigh dimension
- Variable selection via generalized SELO-penalized Cox regression models
- Portal nodes screening for large scale social networks
- Convex and non-convex regularization methods for spatial point processes intensity estimation
- I-LAMM for sparse learning: simultaneous control of algorithmic complexity and statistical error
- Robust network-based analysis of the associations between (epi)genetic measurements
- Broken adaptive ridge regression and its asymptotic properties
- Multiple choice from competing regression models under multicollinearity based on standardized update
- An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors
- Hierarchical Bayes, maximum a posteriori estimators, and minimax concave penalized likelihood estimation
- Partial penalized empirical likelihood ratio test under sparse case
- ncvreg
- Outlier detection under a covariate-adjusted exponential regression model with censored data
- A unified primal dual active set algorithm for nonconvex sparse recovery
- The horseshoe-like regularization for feature subset selection
- High-dimensional variable selection via low-dimensional adaptive learning
- An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems
- Gauss-Seidel method with oblique direction
- Nonnegative estimation and variable selection under minimax concave penalty for sparse high-dimensional linear regression models
- Sparse classification: a scalable discrete optimization perspective
- Broken adaptive ridge regression for right-censored survival data
- Fast feature selection via streamwise procedure for massive data
- Smoothly adaptively centered ridge estimator
- Group penalized quantile regression
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
- High-dimensional linear regression with hard thresholding regularization: theory and algorithm
- Visualization and assessment of model selection uncertainty
- Selection of mixed copula for association modeling with tied observations
- A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems
- \(\ell_0\)-regularized high-dimensional accelerated failure time model
- A new double-regularized regression using Liu and Lasso regularization
- GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee
- Learning delay dynamics for multivariate stochastic processes, with application to the prediction of the growth rate of COVID-19 cases in the United States
- Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks
- Bias versus non-convexity in compressed sensing
- A data-driven line search rule for support recovery in high-dimensional data analysis
- Estimation of multivariate dependence structures via constrained maximum likelihood
- Removing the singularity of a penalty via thresholding function matching
- Adaptive penalized weighted least absolute deviations estimation for the accelerated failure time model
- Sparse regression: scalable algorithms and empirical performance
- A discussion on practical considerations with sparse regression methodologies
- Variable selection in the Box-Cox power transformation model
- Scalable penalized spatiotemporal land-use regression for ground-level nitrogen dioxide
- On a monotone scheme for nonconvex nonsmooth optimization with applications to fracture mechanics
- High-dimensional regression in practice: an empirical study of finite-sample prediction, variable selection and ranking
- Penalized empirical likelihood for the sparse Cox regression model
- Approximated penalized maximum likelihood for exploratory factor analysis: an orthogonal case
- Marginalized Lasso in sparse regression
- Linear hypothesis testing for high dimensional generalized linear models
- Variable selection and estimation for semi-parametric multiple-index models
- Stable prediction in high-dimensional linear models
- Penalized variable selection in competing risks regression
- A resilient domain decomposition polynomial chaos solver for uncertain elliptic PDEs
- Multi-stage convex relaxation for feature selection
- Ultrahigh dimensional variable selection through the penalized maximum trimmed likelihood estimator
- Pathwise coordinate optimization
- Coordinate descent algorithms for lasso penalized regression
- Endogeneity in high dimensions
- A note on the one-step estimator for ultrahigh dimensionality
- Sparse estimation via nonconcave penalized likelihood in factor analysis model
- Nearly optimal Bayesian shrinkage for high-dimensional regression
- A primal and dual active set algorithm for truncated \(L_1\) regularized logistic regression
- High-dimensional sparse portfolio selection with nonnegative constraint
- Robust Coordinate Descent Algorithm Robust Solution Path for High-dimensional Sparse Regression Modeling
- Global solutions to folded concave penalized nonconvex learning
- Efficiency for Regularization Parameter Selection in Penalized Likelihood Estimation of Misspecified Models
- Variable selection in large margin classifier-based probability estimation with high-dimensional predictors
- Model selection for Cox models with time-varying coefficients
- Asymptotic properties of lasso in high-dimensional partially linear models
- The benefit of group sparsity in group inference with de-biased scaled group Lasso
- Designing penalty functions in high dimensional problems: the role of tuning parameters
- SparseNet: coordinate descent with nonconvex penalties
- Tractable Bayesian variable selection: beyond normality
- Coordinate majorization descent algorithm for nonconvex penalized regression
- A fast algorithm for the accelerated failure time model with high-dimensional time-to-event data
- Variable selection for zero‐inflated and overdispersed data with application to health care demand in Germany
- Adjusted regularized estimation in the accelerated failure time model with high dimensional covariates
- Group coordinate descent algorithms for nonconvex penalized regression
- Non-convex penalized estimation in high-dimensional models with single-index structure
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)
