Timezone: »

Measuring the reliability of MCMC inference with bidirectional Monte Carlo
Roger Grosse · Siddharth Ancha · Daniel Roy

Wed Dec 07 09:00 AM -- 12:30 PM (PST) @ Area 5+6+7+8 #160

Markov chain Monte Carlo (MCMC) is one of the main workhorses of probabilistic inference, but it is notoriously hard to measure the quality of approximate posterior samples. This challenge is particularly salient in black box inference methods, which can hide details and obscure inference failures. In this work, we extend the recently introduced bidirectional Monte Carlo technique to evaluate MCMC-based posterior inference algorithms. By running annealed importance sampling (AIS) chains both from prior to posterior and vice versa on simulated data, we upper bound in expectation the symmetrized KL divergence between the true posterior distribution and the distribution of approximate samples. We integrate our method into two probabilistic programming languages, WebPPL and Stan, and validate it on several models and datasets. As an example of how our method be used to guide the design of inference algorithms, we apply it to study the effectiveness of different model representations in WebPPL and Stan.

Author Information

Roger Grosse (University of Toronto)
Siddharth Ancha (University of Toronto)
Daniel Roy (U of Toronto; Vector)

More from the Same Authors