Venture
Venture: a higher-order probabilistic programming platform with programmable inference. We describe Venture, an interactive virtual machine for probabilistic programming that aims to be sufficiently expressive, extensible, and efficient for general-purpose use. Like Church, probabilistic models and inference problems in Venture are specified via a Turing-complete, higher-order probabilistic language descended from Lisp. Unlike Church, Venture also provides a compositional language for custom inference strategies built out of scalable exact and approximate techniques. We also describe four key aspects of Venture’s implementation that build on ideas from probabilistic graphical models. First, we describe the stochastic procedure interface (SPI) that specifies and encapsulates primitive random variables. The SPI supports custom control flow, higher-order probabilistic procedures, partially exchangeable sequences and “likelihood-free” stochastic simulators. It also supports external models that do inference over latent variables hidden from Venture. Second, we describe probabilistic execution traces (PETs), which represent execution histories of Venture programs. PETs capture conditional dependencies, existential dependencies and exchangeable coupling. Third, we describe partitions of execution histories called scaffolds that factor global inference problems into coherent sub-problems. Finally, we describe a family of stochastic regeneration algorithms for efficiently modifying PET fragments contained within scaffolds. Stochastic regeneration linear runtime scaling in cases where many previous approaches scaled quadratically. We show how to use stochastic regeneration and the SPI to implement general-purpose inference strategies such as Metropolis-Hastings, Gibbs sampling, and blocked proposals based on particle Markov chain Monte Carlo and mean-field variational inference techniques.
Keywords for this software
References in zbMATH (referenced in 10 articles )
Showing results 1 to 10 of 10.
Sorted by year (- Johan Dahlin, Thomas B. Schön: Getting Started with Particle Metropolis-Hastings for Inference in Nonlinear Dynamical Models (2019) not zbMATH
- Staton, Sam; Stein, Dario; Yang, Hongseok; Ackerman, Nathanael L.; Freer, Cameron E.; Roy, Daniel M.: The Beta-Bernoulli process and algebraic effects (2018)
- Culpepper, Ryan; Cobb, Andrew: Contextual equivalence for probabilistic programs with continuous random variables and scoring (2017)
- Heunen, Chris; Kammar, Ohad; Staton, Sam; Yang, Hongseok: A convenient category for higher-order probability theory (2017)
- Kucukelbir, Alp; Tran, Dustin; Ranganath, Rajesh; Gelman, Andrew; Blei, David M.: Automatic differentiation variational inference (2017)
- Staton, Sam: Commutative semantics for probabilistic programming (2017)
- Barany, Vince; ten Cate, Balder; Kimelfeld, Benny; Olteanu, Dan; Vagena, Zografoula: Declarative probabilistic programming with Datalog (2016)
- Dustin Tran, Alp Kucukelbir, Adji B. Dieng, Maja Rudolph, Dawen Liang, David M. Blei: Edward: A library for probabilistic modeling, inference, and criticism (2016) arXiv
- Narayanan, Praveen; Carette, Jacques; Romano, Wren; Shan, Chung-chieh; Zinkov, Robert: Probabilistic inference by program transformation in Hakaru (system description) (2016)
- Alp Kucukelbir, Rajesh Ranganath, Andrew Gelman, David M. Blei: Automatic Variational Inference in Stan (2015) arXiv