REVIEW 2 cited by
Swift: Compiled Inference for Probabilistic Programming Languages
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Swift: Compiled Inference for Probabilistic Programming Languages
read the original abstract
A probabilistic program defines a probability measure over its semantic structures. One common goal of probabilistic programming languages (PPLs) is to compute posterior probabilities for arbitrary models and queries, given observed evidence, using a generic inference engine. Most PPL inference engines---even the compiled ones---incur significant runtime interpretation overhead, especially for contingent and open-universe models. This paper describes Swift, a compiler for the BLOG PPL. Swift-generated code incorporates optimizations that eliminate interpretation overhead, maintain dynamic dependencies efficiently, and handle memory management for possible worlds of varying sizes. Experiments comparing Swift with other PPL engines on a variety of inference problems demonstrate speedups ranging from 12x to 326x.
Forward citations
Cited by 2 Pith papers
-
Static Factorisation of Probabilistic Programs With User-Labelled Sample Statements and While Loops
Even probabilistic programs with while loops and dynamic sample labels factor into one density term per labelled sample statement, and this static factorization accelerates three Bayesian inference algorithms.
-
Compositional Inference Metaprogramming with Convergence Guarantees
Introduces independent subproblem inference and proves asymptotic convergence guarantees for hybrid MCMC algorithms defined via inference metaprogramming.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.