Lazy Factored Inference for Functional Probabilistic Programming

by   Avi Pfeffer, et al.

Probabilistic programming provides the means to represent and reason about complex probabilistic models using programming language constructs. Even simple probabilistic programs can produce models with infinitely many variables. Factored inference algorithms are widely used for probabilistic graphical models, but cannot be applied to these programs because all the variables and factors have to be enumerated. In this paper, we present a new inference framework, lazy factored inference (LFI), that enables factored algorithms to be used for models with infinitely many variables. LFI expands the model to a bounded depth and uses the structure of the program to precisely quantify the effect of the unexpanded part of the model, producing lower and upper bounds to the probability of the query.


page 1

page 2

page 3

page 4


flip-hoisting: Exploiting Repeated Parameters in Discrete Probabilistic Programs

Probabilistic programming is emerging as a popular and effective means o...

Guaranteed Bounds for Posterior Inference in Universal Probabilistic Programming

We propose a new method to approximate the posterior distribution of pro...

Structured Factored Inference: A Framework for Automated Reasoning in Probabilistic Programming Languages

Reasoning on large and complex real-world models is a computationally di...

Pyro: Deep Universal Probabilistic Programming

Pyro is a probabilistic programming language built on Python as a platfo...

Probabilistic Selection in AgentSpeak(L)

Agent programming is mostly a symbolic discipline and, as such, draws li...

Language Model Cascades

Prompted models have demonstrated impressive few-shot learning abilities...

Automatic Reparameterisation of Probabilistic Programs

Probabilistic programming has emerged as a powerful paradigm in statisti...