Fast and correct gradient-based optimisation for probabilistic programming via smoothing
From MaRDI portal
Publication:6535252
variational inferencetype systemsprobabilistic programmingvalue semanticsreparameterisation gradient
Theory of programming languages (68N15) Applications of mathematical programming (90C90) Stochastic programming (90C15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Recommendations
Cites work
- scientific article; zbMATH DE number 193292 (Why is no real title available?)
- A Convenient Category for Higher-Order Probability Theory
- A lambda-calculus foundation for universal probabilistic programming
- A provably correct sampler for probabilistic programs
- Borel structures for function spaces
- Commutative semantics for probabilistic programming
- Comparative smootheology
- Convex optimization algorithms
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere
- Discontinuous Optimization by Smoothing
- Gradient Convergence in Gradient methods with Errors
- Machine learning. A probabilistic perspective
- Monte Carlo gradient estimation in machine learning
- Probabilistic coherence spaces are fully abstract for probabilistic PCF
- Probability theory. A comprehensive course
- Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
This page was built for publication: Fast and correct gradient-based optimisation for probabilistic programming via smoothing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535252)