{"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/semi-analytic-resampling-in-lasso","title":"Semi-Analytic Resampling in Lasso","arxiv_id":"1802.10254","date":"2018-02-28","proceeding":null,"authors":["Tomoyuki Obuchi","Yoshiyuki Kabashima"],"abstract":"An approximate method for conducting resampling in Lasso, the $\\ell_1$\npenalized linear regression, in a semi-analytic manner is developed, whereby\nthe average over the resampled datasets is directly computed without repeated\nnumerical sampling, thus enabling an inference free of the statistical\nfluctuations due to sampling finiteness, as well as a significant reduction of\ncomputational time. The proposed method is based on a message passing type\nalgorithm, and its fast convergence is guaranteed by the state evolution\nanalysis, when covariates are provided as zero-mean independently and\nidentically distributed Gaussian random variables. It is employed to implement\nbootstrapped Lasso (Bolasso) and stability selection, both of which are\nvariable selection methods using resampling in conjunction with Lasso, and\nresolves their disadvantage regarding computational cost. To examine\napproximation accuracy and efficiency, numerical experiments were carried out\nusing simulated datasets. Moreover, an application to a real-world dataset, the\nwine quality dataset, is presented. To process such real-world datasets, an\nobjective criterion for determining the relevance of selected variables is also\nintroduced by the addition of noise variables and resampling.","url_abs":"http://arxiv.org/abs/1802.10254v2","url_pdf":"http://arxiv.org/pdf/1802.10254v2.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":"semi-analytic-resampling-in-lasso","repo_url":"https://github.com/T-Obuchi/AMPR_lasso_matlab","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"variable-selection","task_name":"Variable Selection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"T-Obuchi/AMPR_lasso_matlab","kind":"official","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":"44ba5e8757993dbdcd8d3023674e42715ad2548684114b3ac59b9317186ac693","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}