The biglasso Package: A Memory- and Computation-Efficient Solver for Lasso Model Fitting with Big Data in R
Not on the map. Why?
Abstract (arXiv)
Penalized regression models such as the lasso have been extensively applied to analyzing high-dimensional data sets. However, due to memory limitations, existing R packages like glmnet and ncvreg are not capable of fitting lasso-type models for ultrahigh-dimensional, multi-gigabyte data sets that are increasingly seen in many areas such as genetics, genomics, biomedical imaging, and high-frequency finance. In this research, we implement an R package called biglasso that tackles this challenge. biglasso utilizes memory-mapped files to store the massive data on the disk, only reading data into memory when necessary during model fitting, and is thus able to handle out-of-core computation seamlessly. Moreover, it's equipped with newly proposed, more efficient feature screening rules, which substantially accelerate the computation. Benchmarking experiments show that our biglasso package, as compared to existing popular ones like glmnet, is much more memory- and computation-efficient. We further analyze a 31 GB real data set on a laptop with only 16 GB RAM to demonstrate the out-of-core computation capability of biglasso in analyzing massive data sets that cannot be accommodated by existing R packages.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Jan 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 1; 2025: 2; 2026: 1.
6 papers.
- 2021Hyperparameter Optimization: Foundations, Algorithms, Best Practices and Open Challengescited by 143
- 2024A Fast and Scalable Pathwise-Solver for Group Lasso and Elastic Net Penalized Regression via Block-Coordinate Descentcited by 5
- 2025Enhanced Cyclic Coordinate Descent Methods for Elastic Net Penalized Linear Modelscited by 2
- 2023Scalable kernel balancing weights in a nationwide observational study of hospital profit status and heart attack outcomescited by 1
- 2025Efficient Solvers for SLOPE in R, Python, Julia, and C++cited by 0
- 2026Simpler Methods Work Better for L1 Penalized Logistic Models and Large Datasetscited by 0
- 2026Simpler Methods Work Better for L1 Penalized Logistic Models and Large Datasets21 Sep 2026
- 2025Efficient Solvers for SLOPE in R, Python, Julia, and C++4 Nov 2025
- 2025Enhanced Cyclic Coordinate Descent Methods for Elastic Net Penalized Linear Models22 Oct 2025
- 2024A Fast and Scalable Pathwise-Solver for Group Lasso and Elastic Net Penalized Regression via Block-Coordinate Descent14 May 2024
- 2023Scalable kernel balancing weights in a nationwide observational study of hospital profit status and heart attack outcomes1 Nov 2023
- 2021Hyperparameter Optimization: Foundations, Algorithms, Best Practices and Open Challenges13 Jul 2021