Control-Data Separation and Logical Condition Propagation for Efficient Inference on Probabilistic Programs
arXiv:2101.01502
Abstract
We present a novel sampling framework for probabilistic programs. The framework combines two recent ideas -- \emph{control-data separation} and \emph{logical condition propagation} -- in a nontrivial manner so that the two ideas boost the benefits of each other. We implemented our algorithm on top of Anglican. The experimental results demonstrate our algorithm's efficiency, especially for programs with while loops and rare observations.
References in corpus (4)
- Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
- Inference Compilation and Universal Probabilistic Programming
- Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs
- Divide, Conquer, and Combine: a New Inference Strategy for Probabilistic Programs with Stochastic Support