Pith. sign in

REVIEW 6 cited by

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1404.0099 v1 pith:SJKBEAAE submitted 2014-04-01 cs.AI cs.PLstat.COstat.ML

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

classification cs.AI cs.PLstat.COstat.ML
keywords inferenceprobabilisticventuredescribestochasticexecutionhigher-ordermodels
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Expected Free Energy-based Planning as Variational Inference

    cs.AI 2026-06 unverdicted novelty 7.0

    EFE-based planning is formulated as variational free energy minimization with epistemic priors, decomposing into expected plan costs plus a complexity term.

  2. Incremental Computation for Efficient Programmable Inference in Probabilistic Programs

    cs.PL 2026-06 unverdicted novelty 7.0

    Develops compositional incrementalization of density functions for probabilistic programs to accelerate Monte Carlo inference algorithms.

  3. What Type of Inference is Active Inference?

    cs.AI 2026-06 unverdicted novelty 7.0

    EFE-based active inference planning is characterized as VFE on an augmented model plus entropy and planning corrections, with a derived message-passing implementation and grid-world validation.

  4. Compositional Inference Metaprogramming with Convergence Guarantees

    cs.PL 2019-07 unverdicted novelty 7.0

    Introduces independent subproblem inference and proves asymptotic convergence guarantees for hybrid MCMC algorithms defined via inference metaprogramming.

  5. Bayesian Synthesis of Probabilistic Programs for Automatic Data Modeling

    cs.PL 2019-07 unverdicted novelty 6.0

    Bayesian synthesis formulates automatic construction of probabilistic programs in PCFG-specified DSLs with soundness conditions, enabling structure analysis and prediction that outperforms baselines on real datasets.

  6. Deployable probabilistic programming

    cs.PL 2019-06 unverdicted novelty 5.0

    Design guidelines and a Go library (Infergo) for deploying probabilistic programming in production systems, with benchmark comparisons.