Coordinate descent algorithms for lasso penalized regression
From MaRDI portal
Publication:2482976
Abstract: Imposition of a lasso penalty shrinks parameter estimates toward zero and performs continuous model selection. Lasso penalized regression is capable of handling linear regression problems where the number of predictors far exceeds the number of cases. This paper tests two exceptionally fast algorithms for estimating regression coefficients with a lasso penalty. The previously known algorithm is based on cyclic coordinate descent. Our new algorithm is based on greedy coordinate descent and Edgeworth's algorithm for ordinary regression. Each algorithm relies on a tuning constant that can be chosen by cross-validation. In some regression problems it is natural to group parameters and penalize parameters group by group rather than separately. If the group penalty is proportional to the Euclidean norm of the parameters of the group, then it is possible to majorize the norm and reduce parameter estimation to regression with a lasso penalty. Thus, the existing algorithm can be extended to novel settings. Each of the algorithms discussed is tested via either simulated or real data or both. The Appendix proves that a greedy form of the algorithm converges to the minimum value of the objective function.
Recommendations
- Coordinate descent algorithm for covariance graphical Lasso
- Coordinate majorization descent algorithm for nonconvex penalized regression
- A gradient descent algorithm for LASSO
- Coordinate descent algorithms
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Adaptive Randomized Coordinate Descent for Sparse Systems: Lasso and Greedy Algorithms
- A descent method for least absolute deviation Lasso problems
- Algorithms for Fitting the Constrained Lasso
- Natural coordinate descent algorithm for \(\ell_1\)-penalised regression in generalised linear models
Cited in
(only showing first 100 items - show all)- Sparsity with sign-coherent groups of variables via the cooperative-Lasso
- Variable selection based on squared derivative averages
- A globally convergent algorithm for Lasso-penalized mixture of linear regression models
- Model selection for high-dimensional quadratic regression via regularization
- Massive Parallelization of Massive Sample-Size Survival Analysis
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Regularized 3D functional regression for brain image data via Haar wavelets
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- Simultaneous estimation of quantile regression functions using B-splines and total variation penalty
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- ADMM for High-Dimensional Sparse Penalized Quantile Regression
- Greedy algorithms for prediction
- Inferring sparse Gaussian graphical models with latent structure
- A statistical framework for pathway and gene identification from integrative analysis
- Coordinate descent algorithm of generalized fused Lasso logistic regression for multivariate trend filtering
- LASSO for streaming data with adaptative filtering
- Regression on manifolds: estimation of the exterior derivative
- Exponential regression for censored data with outliers
- Hybrid safe-strong rules for efficient optimization in Lasso-type problems
- A scalable surrogate L₀ sparse regression method for generalized linear models with applications to large scale data
- Sparse regression: scalable algorithms and empirical performance
- Review of Bayesian selection methods for categorical predictors using JAGS
- Learning and estimation applications of an online homotopy algorithm for a generalization of the LASSO
- Majorization-minimization algorithms for nonsmoothly penalized objective functions
- Coordinate majorization descent algorithm for nonconvex penalized regression
- Parallel integrative learning for large-scale multi-response regression with incomplete outcomes
- Fast Construction of Optimal Composite Likelihoods
- A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
- Sparse directed acyclic graphs incorporating the covariates
- Pathwise coordinate optimization
- Variable selection through adaptive elastic net for proportional odds model
- Robust regression for highly corrupted response by shifting outliers
- Parametric and semiparametric reduced-rank regression with flexible sparsity
- A majorization-minimization approach to variable selection using spike and slab priors
- A new scope of penalized empirical likelihood with high-dimensional estimating equations
- Double fused Lasso penalized LAD for matrix regression
- Partial penalized empirical likelihood ratio test under sparse case
- Group coordinate descent algorithms for nonconvex penalized regression
- Sparse regression with exact clustering
- Coordinate ascent for penalized semiparametric regression on high-dimensional panel count data
- Penalized and constrained LAD estimation in fixed and high dimension
- Overview of robust variable selection methods for high-dimensional linear regression model
- Shrinkage estimation and variable selection in multiple regression models with random coefficient autoregressive errors
- Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression
- A fast algorithm for the accelerated failure time model with high-dimensional time-to-event data
- Kernel density regression
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- Regularized Estimation and Feature Selection in Mixtures of Gaussian-Gated Experts Models
- Coordinate descent algorithm for covariance graphical Lasso
- An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization
- One-step sparse ridge estimation with folded concave penalty
- Multivariate sparse group Lasso for the multivariate multiple linear regression with an arbitrary group structure
- An \(L_1\)-regularized logistic model for detecting short-term neuronal interactions
- \(L_{1}\) penalized estimation in the Cox proportional hazards model
- Sparse principal component regression via singular value decomposition approach
- Lasso regression: estimation and shrinkage via the limit of Gibbs sampling
- Sparse alternatives to ridge regression: a random effects approach
- Sparse factor model for co-expression networks with an application using prior biological knowledge
- Model-averaged \(\ell_1\) regularization using Markov chain Monte Carlo model composition
- A survey of numerical algorithms that can solve the Lasso problems
- Detecting clusters in multivariate response regression
- Least angle regression for model selection
- Integrative analysis of `-omics' data using penalty functions
- Variable selection using \(L_q\) penalties
- Convex biclustering
- scientific article; zbMATH DE number 7370628 (Why is no real title available?)
- Outlier detection under a covariate-adjusted exponential regression model with censored data
- A fast procedure for calculating importance weights in bootstrap sampling
- High-dimensional Cox regression analysis in genetic studies with censored survival outcomes
- Non-concave penalization in linear mixed-effect models and regularized selection of fixed effects
- Accelerated, parallel, and proximal coordinate descent
- Estimation for high-dimensional linear mixed-effects models using \(\ell_1\)-penalization
- Thresholding-based iterative selection procedures for model selection and shrinkage
- New cyclic sparsity measures for deconvolution based on convex relaxation
- A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems
- Cyclic Coordinate Dual Averaging with Extrapolation
- Applications of \(l_1\) regularisation
- Confidence intervals for sparse penalized regression with random designs
- A coordinate majorization descent algorithm for \(\ell_1\) penalized learning
- Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising
- Standardization and the group lasso penalty
- Sparse principal component regression for generalized linear models
- Solution path clustering with adaptive concave penalty
- On the complexity analysis of randomized block-coordinate descent methods
- Locally Sparse Function-on-Function Regression
- A novel heuristic algorithm to solve penalized regression-based clustering model
- Robust Coordinate Descent Algorithm Robust Solution Path for High-dimensional Sparse Regression Modeling
- A penalized likelihood approach for bivariate conditional normal models for dynamic co-expression analysis
- Natural coordinate descent algorithm for \(\ell_1\)-penalised regression in generalised linear models
- Studies of the adaptive network-constrained linear regression and its application
- The dual and degrees of freedom of linearly constrained generalized Lasso
- Model-based feature selection and clustering of RNA-seq data for unsupervised subtype discovery
- Mixed Lasso estimator for stochastic restricted regression models
- Efficient computation for differential network analysis with applications to quadratic discriminant analysis
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
- A surrogate \(\ell_0\) sparse Cox's regression with applications to sparse high-dimensional massive sample size time-to-event data
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- The group exponential Lasso for bi-level variable selection
- Penalized estimation of directed acyclic graphs from discrete data
- A data-driven line search rule for support recovery in high-dimensional data analysis
This page was built for publication: Coordinate descent algorithms for lasso penalized regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482976)
