A provably correct sampler for probabilistic programs
From MaRDI portal
Recommendations
- Correctness of sequential Monte Carlo inference for probabilistic programming languages
- Program verification as probabilistic inference
- A lambda-calculus foundation for universal probabilistic programming
- Running probabilistic programs backwards
- Probabilistic programming language and its incremental evaluation
Cited in
(12)- AQUA: automated quantized inference for probabilistic programs
- Correctness of sequential Monte Carlo inference for probabilistic programming languages
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere
- Bayesian strategies: probabilistic programs as generalised graphical models
- Probabilistic programming language and its incremental evaluation
- Program verification as probabilistic inference
- scientific article; zbMATH DE number 3932374 (Why is no real title available?)
- Continualization of probabilistic programs with correction
- Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism
- Fast and correct gradient-based optimisation for probabilistic programming via smoothing
- Automatic alignment in higher-order probabilistic programming languages
- Generative Datalog with continuous distributions
This page was built for publication: A provably correct sampler for probabilistic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5275390)