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)- The group exponential Lasso for bi-level variable selection
- Robust and sparse multigroup classification by the optimal scoring approach
- Penalized estimation of directed acyclic graphs from discrete data
- Linearized alternating direction method of multipliers for sparse group and fused Lasso models
- Natural coordinate descent algorithm for \(\ell_1\)-penalised regression in generalised linear models
- A globally convergent algorithm for Lasso-penalized mixture of linear regression models
- Sparse principal component regression for generalized linear models
- Studies of the adaptive network-constrained linear regression and its application
- The dual and degrees of freedom of linearly constrained generalized Lasso
- Variable selection and estimation using a continuous approximation to the \(L_0\) penalty
- LARS-type algorithm for group Lasso
- Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression
- Efficient LED-SAC sparse estimator using fast sequential adaptive coordinate-wise optimization (LED-2SAC)
- Coordinate descent based hierarchical interactive Lasso penalized logistic regression and its application to classification problems
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- Simultaneous estimation of quantile regression functions using B-splines and total variation penalty
- Sparse least trimmed squares regression for analyzing high-dimensional large data sets
- Inferring sparse Gaussian graphical models with latent structure
- Thresholding-based iterative selection procedures for model selection and shrinkage
- Sparse regression with exact clustering
- Majorization-minimization algorithms for nonsmoothly penalized objective functions
- A new scope of penalized empirical likelihood with high-dimensional estimating equations
- Advanced algorithms for penalized quantile and composite quantile regression
- Double fused Lasso penalized LAD for matrix regression
- Partial penalized empirical likelihood ratio test under sparse case
- Parametric and semiparametric reduced-rank regression with flexible sparsity
- Outlier detection under a covariate-adjusted exponential regression model with censored data
- Clustering of subsample means based on pairwise L1 regularized empirical likelihood
- Sparse principal component regression via singular value decomposition approach
- Super-resolution for doubly-dispersive channel estimation
- Sparse methods for automatic relevance determination
- Group penalized quantile regression
- Coordinate descent algorithm of generalized fused Lasso logistic regression for multivariate trend filtering
- LASSO for streaming data with adaptative filtering
- Penalized and constrained LAD estimation in fixed and high dimension
- Sparse matrix linear models for structured high-throughput data
- A novel heuristic algorithm to solve penalized regression-based clustering model
- A data-driven line search rule for support recovery in high-dimensional data analysis
- Estimation of multivariate dependence structures via constrained maximum likelihood
- Differential network inference via the fused D-trace loss with cross variables
- Sparse directed acyclic graphs incorporating the covariates
- Sparse regression: scalable algorithms and empirical performance
- Model-based feature selection and clustering of RNA-seq data for unsupervised subtype discovery
- Parallel integrative learning for large-scale multi-response regression with incomplete outcomes
- Shrinkage estimation and variable selection in multiple regression models with random coefficient autoregressive errors
- A fast algorithm for detecting gene-gene interactions in genome-wide association studies
- Efficient computation for differential network analysis with applications to quadratic discriminant analysis
- ROS regression: integrating regularization with optimal scaling regression
- Faster subgradient methods for functions with Hölderian growth
- Kernel density regression
- Group variable selection in the Andersen-Gill model for recurrent event data
- Non-concave penalization in linear mixed-effect models and regularized selection of fixed effects
- Performance of first- and second-order methods for _1-regularized least squares problems
- Efficient block-coordinate descent algorithms for the group Lasso
- A statistical framework for pathway and gene identification from integrative analysis
- Structure learning of sparse directed acyclic graphs incorporating the scale-free property
- Regression on manifolds: estimation of the exterior derivative
- Learning and estimation applications of an online homotopy algorithm for a generalization of the LASSO
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Pathwise coordinate optimization
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- Greedy algorithms for prediction
- Variable selection based on squared derivative averages
- Adaptive bi-level variable selection for multivariate failure time model with a diverging number of covariates
- A resampling approach for confidence intervals in linear time-series models after model selection
- \(L_{1}\) penalized estimation in the Cox proportional hazards model
- Robust Coordinate Descent Algorithm Robust Solution Path for High-dimensional Sparse Regression Modeling
- A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
- Optimization in high dimensions via accelerated, parallel, and proximal coordinate descent
- Variable selection and estimation in generalized linear models with the seamless L₀ penalty
- Standardization and the group lasso penalty
- Estimation for high-dimensional linear mixed-effects models using _1-penalization
- Laplace error penalty-based variable selection in high dimension
- A penalized likelihood approach for bivariate conditional normal models for dynamic co-expression analysis
- Model selection for factorial Gaussian graphical models with an application to dynamic regulatory networks
- Sparse factor model for co-expression networks with an application using prior biological knowledge
- Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising
- PUlasso: High-Dimensional Variable Selection With Presence-Only Data
- Regularized Estimation and Feature Selection in Mixtures of Gaussian-Gated Experts Models
- Coordinate majorization descent algorithm for nonconvex penalized regression
- A fast algorithm for the accelerated failure time model with high-dimensional time-to-event data
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
- Accelerated, parallel, and proximal coordinate descent
- An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization
- Multivariate sparse group Lasso for the multivariate multiple linear regression with an arbitrary group structure
- Group variable selection via convex log-exp-sum penalty with application to a breast cancer survivor study
- Regularized 3D functional regression for brain image data via Haar wavelets
- Group coordinate descent algorithms for nonconvex penalized regression
- Coordinate ascent for penalized semiparametric regression on high-dimensional panel count data
- Smoothing proximal gradient method for general structured sparse regression
- Sparsity with sign-coherent groups of variables via the cooperative-Lasso
- Regularization for Cox's proportional hazards model with NP-dimensionality
- A fast procedure for calculating importance weights in bootstrap sampling
- High-dimensional Cox regression analysis in genetic studies with censored survival outcomes
- scientific article; zbMATH DE number 6982301 (Why is no real title available?)
- Solution path clustering with adaptive concave penalty
- Adaptive Randomized Coordinate Descent for Sparse Systems: Lasso and Greedy Algorithms
- A randomized nonmonotone block proximal gradient method for a class of structured nonlinear programming
- On the complexity of parallel coordinate descent
- Applications of \(l_1\) regularisation
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)
