Automated Variational Inference in Probabilistic Programming

01/07/2013
by   David Wingate, et al.
0

We present a new algorithm for approximate inference in probabilistic programs, based on a stochastic gradient for variational programs. This method is efficient without restrictions on the probabilistic program; it is particularly practical for distributions which are not analytically tractable, including highly structured distributions that arise in probabilistic programs. We show how to automatically derive mean-field probabilistic programs and optimize them, and demonstrate that our perspective improves inference efficiency over other algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/09/2021

Automatic variational inference with cascading flows

The automation of probabilistic reasoning is one of the primary aims of ...
research
01/08/2020

Stochastic probabilistic programs

We introduce the notion of a stochastic probabilistic program and presen...
research
09/09/2015

Coarse-to-Fine Sequential Monte Carlo for Probabilistic Programs

Many practical techniques for probabilistic inference require a sequence...
research
02/03/2020

Automatic structured variational inference

The aim of probabilistic programming is to automatize every aspect of pr...
research
10/18/2018

Pyro: Deep Universal Probabilistic Programming

Pyro is a probabilistic programming language built on Python as a platfo...
research
07/24/2023

Template-Based Static Posterior Inference for Bayesian Probabilistic Programming

In Bayesian probabilistic programming, a central problem is to estimate ...
research
08/25/2017

Delayed Sampling and Automatic Rao-Blackwellization of Probabilistic Programs

We introduce a dynamic mechanism for the solution of analytically-tracta...

Please sign up or login with your details

Forgot password? Click here to reset