Probabilistic Programming with Sufficient Statistics for faster Bayesian Computation
Clemens Pichler, Jack Jewson, Alejandra Avalos-Pacheco

TL;DR
This paper introduces a method leveraging sufficient statistics to significantly accelerate Bayesian inference in Stan, especially for complex models and large datasets, without sacrificing accuracy.
Contribution
It demonstrates how incorporating sufficient statistics into Stan improves computational efficiency for various Bayesian models, a novel application in state-of-the-art software.
Findings
Significant speed-ups in Gaussian linear regression with non-conjugate priors
Reduced computation time for hierarchical random effects models
Moderate gains even when likelihoods are partially expressed with sufficient statistics
Abstract
Probabilistic programming methods have revolutionised Bayesian inference, making it easier than ever for practitioners to perform Markov-chain-Monte-Carlo sampling from non-conjugate posterior distributions. Here we focus on Stan, arguably the most used probabilistic programming tool for Bayesian inference (Carpenter et al., 2017), and its interface with R via the brms (Burkner, 2017) and rstanarm (Goodrich et al., 2024) packages. Although easy to implement, these tools can become computationally prohibitive when applied to datasets with many observations or models with numerous parameters. While the use of sufficient statistics is well-established in theory, it has been surprisingly overlooked in state-of-the-art Stan software. We show that when the likelihood can be written in terms of sufficient statistics, considerable computational improvements can be made to current…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Machine Learning and Algorithms · AI-based Problem Solving and Planning
