{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/the-biglasso-package-a-memory-and-computation","title":"The biglasso Package: A Memory- and Computation-Efficient Solver for Lasso Model Fitting with Big Data in R","arxiv_id":"1701.05936","date":"2017-01-20","proceeding":null,"authors":["Yaohui Zeng","Patrick Breheny"],"abstract":"Penalized regression models such as the lasso have been extensively applied\nto analyzing high-dimensional data sets. However, due to memory limitations,\nexisting R packages like glmnet and ncvreg are not capable of fitting\nlasso-type models for ultrahigh-dimensional, multi-gigabyte data sets that are\nincreasingly seen in many areas such as genetics, genomics, biomedical imaging,\nand high-frequency finance. In this research, we implement an R package called\nbiglasso that tackles this challenge. biglasso utilizes memory-mapped files to\nstore the massive data on the disk, only reading data into memory when\nnecessary during model fitting, and is thus able to handle out-of-core\ncomputation seamlessly. Moreover, it's equipped with newly proposed, more\nefficient feature screening rules, which substantially accelerate the\ncomputation. Benchmarking experiments show that our biglasso package, as\ncompared to existing popular ones like glmnet, is much more memory- and\ncomputation-efficient. We further analyze a 31 GB real data set on a laptop\nwith only 16 GB RAM to demonstrate the out-of-core computation capability of\nbiglasso in analyzing massive data sets that cannot be accommodated by existing\nR packages.","url_abs":"http://arxiv.org/abs/1701.05936v2","url_pdf":"http://arxiv.org/pdf/1701.05936v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"the-biglasso-package-a-memory-and-computation","repo_url":"https://github.com/YaohuiZeng/biglasso","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"the-biglasso-package-a-memory-and-computation","repo_url":"https://github.com/conda-forge/r-biglasso-feedstock","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"benchmarking","task_name":"Benchmarking"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1701.05936","atlas_url":"https://app.syntology.ai/?focus=1701.05936","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1701.05936"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1701.05936\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1701.05936"},"call":"get_concepts_for_paper(arxiv_id=\"1701.05936\")"}],"by_repo":[{"repo":"YaohuiZeng/biglasso","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"conda-forge/r-biglasso-feedstock","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"4932e2b6c08c49fcbded73018177c9f1d1535b0b107ade8f23de4ec0aabc9ab0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}