Translating Recursive Probabilistic Programs to Factor Graph Grammars

10/22/2020
by   David Chiang, et al.
0

It is natural for probabilistic programs to use conditionals to express alternative substructures in models, and loops (recursion) to express repeated substructures in models. Thus, probabilistic programs with conditionals and recursion motivate ongoing interest in efficient and general inference. A factor graph grammar (FGG) generates a set of factor graphs that do not all need to be enumerated in order to perform inference. We provide a semantics-preserving translation from first-order probabilistic programs with conditionals and recursion to FGGs.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/08/2020

Stochastic probabilistic programs

We introduce the notion of a stochastic probabilistic program and presen...
06/13/2016

A Probabilistic-Based Model for Binary CSP

This work introduces a probabilistic-based model for binary CSP that pro...
04/13/2021

Extensional Denotational Semantics of Higher-Order Probabilistic Programs, Beyond the Discrete Case

We describe a mathematical structure that can give extensional denotatio...
06/03/2016

Scene Grammars, Factor Graphs, and Belief Propagation

We consider a class of probabilistic grammars for generating scenes with...
06/07/2019

Automatic Reparameterisation of Probabilistic Programs

Probabilistic programming has emerged as a powerful paradigm in statisti...
03/12/2019

Generating and Sampling Orbits for Lifted Probabilistic Inference

Lifted inference scales to large probability models by exploiting symmet...
06/15/2012

A Dynamic Programming Algorithm for Inference in Recursive Probabilistic Programs

We describe a dynamic programming algorithm for computing the marginal d...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.