Accelerate the warm-up stage in the Lasso computation via a homotopic approach
From MaRDI portal
Publication:6115541
DOI10.1016/j.csda.2023.107747arXiv2010.13934MaRDI QIDQ6115541
Publication date: 13 July 2023
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.13934
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- The solution path of the generalized lasso
- Pathwise coordinate optimization for sparse learning: algorithm and theory
- Instrument search in pseudo-likelihood approach for nonignorable nonresponse
- Piecewise linear regularized solution paths
- A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem
- Linear Inversion of Band-Limited Reflection Seismograms
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Regularized partial least squares with an application to NMR spectroscopy
- L 1-Regularization Path Algorithm for Generalized Linear Models
- An homotopy method for l p regression provably beyond self-concordance and in input-sparsity time
- Semiparametric inference for estimating equations with nonignorably missing covariates
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Pseudo likelihood and dimension reduction for data with nonignorable nonresponse
This page was built for publication: Accelerate the warm-up stage in the Lasso computation via a homotopic approach