Control-data separation and logical condition propagation for efficient inference on probabilistic programs
From MaRDI portal
Publication:6151609
Abstract: We introduce a novel sampling algorithm for Bayesian inference on imperative probabilistic programs. It features a hierarchical architecture that separates control flows from data: the top-level samples a control flow, and the bottom level samples data values along the control flow picked by the top level. This separation allows us to plug various language-based analysis techniques in probabilistic program sampling; specifically, we use logical backward propagation of observations for sampling efficiency. 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.
Cites work
- scientific article; zbMATH DE number 5919872 (Why is no real title available?)
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 3764843 (Why is no real title available?)
- Introduction to multi-armed bandits
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
- Semantics of probabilistic programs
- The Continuum-Armed Bandit Problem
This page was built for publication: Control-data separation and logical condition propagation for efficient inference on probabilistic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151609)