mlsanityData to 7 Oct 2026

Venture: a higher-order probabilistic programming platform with programmable inference

arXiv 1404.0099 ↗First posted 1 Apr 2014cs.AI cs.PL stat.COcited by 20

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Apr 2014.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 9; 2022: 3; 2023: 5; 2024: 2; 2025: 1.

20 papers.

Sort:

By area:

  1. 2023From Word Models to World Models: Translating from Natural Language to the Probabilistic Language of Thoughtcited by 118
  2. 2025Self-Steering Language Modelscited by 13
  3. 2021DomiKnowS: A Library for Integration of Symbolic Domain Knowledge in Deep Learningcited by 12
  4. 2022Recursive Monte Carlo and Variational Inference with Auxiliary Variablescited by 8
  5. 2021Learning Proposals for Probabilistic Programs with Inference Combinatorscited by 6
  6. 2022Foundation Posteriors for Approximate Probabilistic Inferencecited by 6
  7. 2022Smoothness Analysis for Probabilistic Programs with Application to Optimised Variational Inferencecited by 5
  8. 2023Declarative Probabilistic Logic Programming in Discrete-Continuous Domainscited by 5
  9. 2021Nonparametric Hamiltonian Monte Carlocited by 4
  10. 2024Probabilistic Programming with Programmable Variational Inferencecited by 4
  11. 2021SBI: A Simulation-Based Test of Identifiability for Bayesian Causal Inferencecited by 3
  12. 2021Toward an Idiomatic Framework for Cognitive Roboticscited by 2
8 more
  1. 2023Rethinking Variational Inference for Probabilistic Programs with Stochastic Supportcited by 2
  2. 2021Meta-Learning an Inference Algorithm for Probabilistic Programscited by 1
  3. 2021Control-Data Separation and Logical Condition Propagation for Efficient Inference on Probabilistic Programscited by 0
  4. 2021Expectation Programming: Adapting Probabilistic Programming Systems to Estimate Expectations Efficientlycited by 0
  5. 2021Unifying AI Algorithms with Probabilistic Programming using Implicitly Defined Representationscited by 0
  6. 2023Push: Concurrent Probabilistic Programming for Bayesian Deep Learningcited by 0
  7. 2023Beyond Bayesian Model Averaging over Paths in Probabilistic Programs with Stochastic Supportcited by 0
  8. 2024Inference Plans for Hybrid Particle Filteringcited by 0