Correctness of sequential Monte Carlo inference for probabilistic programming languages
DOI10.1007/978-3-030-72019-3_15zbMath1473.68038arXiv2003.05191OpenAlexW3140464509MaRDI QIDQ2233471
David Broman, Johannes Borgström, Daniel Lundén
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2003.05191
operational semanticsmeasure theorysequential Monte Carlofunctional programmingprobabilistic programming
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Reasoning under uncertainty in the context of artificial intelligence (68T37) Semantics in the theory of computing (68Q55) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantics of probabilistic programs
- Correctness of sequential Monte Carlo inference for probabilistic programming languages
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere
- Central limit theorem for sequential Monte Carlo methods and its application to Bayesian inference
- Following a Moving Target—Monte Carlo Inference for Dynamic Bayesian Models
- Sequential Monte Carlo Methods in Practice
- A model-learner pattern for bayesian reasoning
- A lambda-calculus foundation for universal probabilistic programming
- Commutative Semantics for Probabilistic Programming
- Graphical Models, Exponential Families, and Variational Inference
- Filtering via Simulation: Auxiliary Particle Filters
- Semantics for probabilistic programming
- 10.1162/jmlr.2003.3.4-5.993
- Elements of Sequential Monte Carlo
- A probabilistic language based upon sampling functions
- Term Rewriting and Applications
This page was built for publication: Correctness of sequential Monte Carlo inference for probabilistic programming languages
