Guaranteed Bounds for Posterior Inference in Universal Probabilistic Programming

Raven Beutner, Luke Ong, Fabian Zaiser

We propose a new method to approximate the posterior distribution of probabilistic programs by means of computing guaranteed bounds. The starting point of our work is an interval-b…