140 citations · 341 across the 21 of their papers we have counts for
11 papers · 1 filter
Learning Proposals for Probabilistic Programs with Inference Combinators
Sam Stites, Heiko Zimmermann, Hao Wu +2
We develop operators for construction of proposals in probabilistic programs, which we refer to as inference combinators. Inference combinators define a grammar over importance sam…
Amortized Population Gibbs Samplers with Neural Sufficient Statistics
Hao Wu, Heiko Zimmermann, Eli Sennesh +2
We develop amortized population Gibbs (APG) samplers, a class of scalable methods that frames structured variational inference as adaptive importance sampling. APG samplers constru…
On Exploration, Exploitation and Learning in Adaptive Importance Sampling
Xiaoyu Lu, Tom Rainforth, Yuan Zhou +2
We study adaptive importance sampling (AIS) as an online learning problem and argue for the importance of the trade-off between exploration and exploitation in this adaptation. Bor…
An Introduction to Probabilistic Programming
Jan-Willem van de Meent, Brooks Paige, Hongseok Yang +1
This book is a graduate-level introduction to probabilistic programming. It not only provides a thorough background for anyone wishing to use a probabilistic programming system, bu…
Structured Disentangled Representations
Babak Esmaeili, Hao Wu, Sarthak Jain +6
Deep latent-variable models learn representations of high-dimensional data in an unsupervised manner. A number of recent efforts have focused on learning representations that disen…
Bayesian Optimization for Probabilistic Programs
Tom Rainforth, Tuan Anh Le, Jan-Willem van de Meent +2
We present the first general purpose framework for marginal maximum a posteriori estimation of probabilistic program variables. By using a series of code transformations, the evide…
Learning Disentangled Representations with Semi-Supervised Deep Generative Models
N. Siddharth, Brooks Paige, Jan-Willem van de Meent +5
Variational autoencoders (VAEs) learn representations of data by jointly training a probabilistic encoder and decoder network. Typically these models encode all features of the dat…
Inducing Interpretable Representations with Variational Autoencoders
N. Siddharth, Brooks Paige, Alban Desmaison +5
We develop a framework for incorporating structured graphical models in the \emph{encoders} of variational autoencoders (VAEs) that allows us to induce interpretable representation…
A New Approach to Probabilistic Programming Inference
Frank Wood, Jan Willem van de Meent, Vikash Mansinghka
We introduce and demonstrate a new approach to inference in expressive probabilistic programming languages based on particle Markov chain Monte Carlo. Our approach is simple to imp…
Particle Gibbs with Ancestor Sampling for Probabilistic Programs
Jan-Willem van de Meent, Hongseok Yang, Vikash Mansinghka +1
Particle Markov chain Monte Carlo techniques rank among current state-of-the-art methods for probabilistic program inference. A drawback of these techniques is that they rely on im…
Tempering by Subsampling
Jan-Willem van de Meent, Brooks Paige, Frank Wood
In this paper we demonstrate that tempering Markov chain Monte Carlo samplers for Bayesian models by recursively subsampling observations without replacement can improve the perfor…