{"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/pass-glm-polynomial-approximate-sufficient","title":"PASS-GLM: polynomial approximate sufficient statistics for scalable Bayesian GLM inference","arxiv_id":"1709.09216","date":"2017-09-26","proceeding":"NeurIPS 2017 12","authors":["Jonathan H. Huggins","Ryan P. Adams","Tamara Broderick"],"abstract":"Generalized linear models (GLMs) -- such as logistic regression, Poisson\nregression, and robust regression -- provide interpretable models for diverse\ndata types. Probabilistic approaches, particularly Bayesian ones, allow\ncoherent estimates of uncertainty, incorporation of prior information, and\nsharing of power across experiments via hierarchical models. In practice,\nhowever, the approximate Bayesian methods necessary for inference have either\nfailed to scale to large data sets or failed to provide theoretical guarantees\non the quality of inference. We propose a new approach based on constructing\npolynomial approximate sufficient statistics for GLMs (PASS-GLM). We\ndemonstrate that our method admits a simple algorithm as well as trivial\nstreaming and distributed extensions that do not compound error across\ncomputations. We provide theoretical guarantees on the quality of point (MAP)\nestimates, the approximate posterior, and posterior mean and uncertainty\nestimates. We validate our approach empirically in the case of logistic\nregression using a quadratic approximation and show competitive performance\nwith stochastic gradient descent, MCMC, and the Laplace approximation in terms\nof speed and multiple measures of accuracy -- including on an advertising data\nset with 40 million data points and 20,000 covariates.","url_abs":"http://arxiv.org/abs/1709.09216v3","url_pdf":"http://arxiv.org/pdf/1709.09216v3.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":"pass-glm-polynomial-approximate-sufficient","repo_url":"https://bitbucket.org/jhhuggins/pass-glm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"regression-1","task_name":"regression"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1709.09216","atlas_url":"https://app.syntology.ai/?focus=1709.09216","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":"1709.09216"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1709.09216\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1709.09216"},"call":"get_concepts_for_paper(arxiv_id=\"1709.09216\")"}],"by_repo":[{"repo":"bitbucket.org/jhhuggins/pass-glm","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":"05ee341c7656953d48fb24c5020343b1d7b4bff6b332172fda516253ecd7cc44","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}