{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/the-limited-memory-recursive-variational","title":"The limited-memory recursive variational Gaussian approximation (L-RVGA)","arxiv_id":"2303.14195","date":"2023-03-24","proceeding":null,"authors":["Marc Lambert","Silvère Bonnabel","Francis Bach"],"abstract":"We consider the problem of computing a Gaussian approximation to the posterior distribution of a parameter given a large number N of observations and a Gaussian prior, when the dimension of the parameter d is also large. To address this problem we build on a recently introduced recursive algorithm for variational Gaussian approximation of the posterior, called recursive variational Gaussian approximation (RVGA), which is a single pass algorithm, free of parameter tuning. In this paper, we consider the case where the parameter dimension d is high, and we propose a novel version of RVGA that scales linearly in the dimension d (as well as in the number of observations N), and which only requires linear storage capacity in d. This is afforded by the use of a novel recursive expectation maximization (EM) algorithm applied for factor analysis introduced herein, to approximate at each step the covariance matrix of the Gaussian distribution conveying the uncertainty in the parameter. The approach is successfully illustrated on the problems of high dimensional least-squares and logistic regression, and generalized to a large class of nonlinear models.","url_abs":"https://arxiv.org/abs/2303.14195v1","url_pdf":"https://arxiv.org/pdf/2303.14195v1.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":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"the-limited-memory-recursive-variational","repo_url":"https://github.com/marc-h-lambert/l-rvga","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"CC0-1.0"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2303.14195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.14195"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/marc-h-lambert/l-rvga","reach":{"status":"ok","spdx":"CC0-1.0"}}],"summary":{"unverified":7},"by_repo_kind":{"official":{"samples":7,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"563882827b11b6e8","entry":"PPCAapprox","repo":"marc-h-lambert/l-rvga","repo_kind":"official","path":"KalmanMachine/KFactorAnalysis.py","file_url":"https://github.com/marc-h-lambert/l-rvga/blob/HEAD/KalmanMachine/KFactorAnalysis.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"mcp_get_code":{"code_sha256":"563882827b11b6e8"}},{"code_sha256_prefix":"5903b23d078d3e8d","entry":"read_LibSVM","repo":"marc-h-lambert/l-rvga","repo_kind":"official","path":"XP_LRVGA_LargeScaleCovariance.py","file_url":"https://github.com/marc-h-lambert/l-rvga/blob/HEAD/XP_LRVGA_LargeScaleCovariance.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"mcp_get_code":{"code_sha256":"5903b23d078d3e8d"}},{"code_sha256_prefix":"dbba8dc3120f786e","entry":"set_size","repo":"marc-h-lambert/l-rvga","repo_kind":"official","path":"plot4latex.py","file_url":"https://github.com/marc-h-lambert/l-rvga/blob/HEAD/plot4latex.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"mcp_get_code":{"code_sha256":"dbba8dc3120f786e"}},{"code_sha256_prefix":"c384a4b763a3b322","entry":"sigmoid","repo":"marc-h-lambert/l-rvga","repo_kind":"official","path":"KalmanMachine/KUtils.py","file_url":"https://github.com/marc-h-lambert/l-rvga/blob/HEAD/KalmanMachine/KUtils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"mcp_get_code":{"code_sha256":"c384a4b763a3b322"}},{"code_sha256_prefix":"db49f8641d6f22b7","entry":"sigp","repo":"marc-h-lambert/l-rvga","repo_kind":"official","path":"KalmanMachine/KUtils.py","file_url":"https://github.com/marc-h-lambert/l-rvga/blob/HEAD/KalmanMachine/KUtils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"mcp_get_code":{"code_sha256":"db49f8641d6f22b7"}},{"code_sha256_prefix":"a709a3d341a5ea76","entry":"sigpp","repo":"marc-h-lambert/l-rvga","repo_kind":"official","path":"KalmanMachine/KUtils.py","file_url":"https://github.com/marc-h-lambert/l-rvga/blob/HEAD/KalmanMachine/KUtils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"mcp_get_code":{"code_sha256":"a709a3d341a5ea76"}},{"code_sha256_prefix":"0165db0445c817a4","entry":"sortedEigs","repo":"marc-h-lambert/l-rvga","repo_kind":"official","path":"KalmanMachine/KFactorAnalysis.py","file_url":"https://github.com/marc-h-lambert/l-rvga/blob/HEAD/KalmanMachine/KFactorAnalysis.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"mcp_get_code":{"code_sha256":"0165db0445c817a4"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}