Monthly Archives: December 2017

Combining Static and Dynamic Optimizations Using Closed-Form Solutions

It is sometimes possible to optimize probabilistic programs, either statically or dynamically. We introduce two examples demonstrating the need for both approaches. Furthermore, we identify a set of challenges related to the two approaches, and more importantly, how to combine …

Posted in Uncategorized | Comments Off on Combining Static and Dynamic Optimizations Using Closed-Form Solutions

More support for symbolic disintegration

We often want to divide two measures, that is, find the density (or Radon-Nikodym derivative) of one measure with respect to another. It would be nice to have a tool that performs this operation correctly in different scenarios.

For example, …

Posted in Uncategorized | Comments Off on More support for symbolic disintegration

Deep Amortized Inference for Probabilistic Programs using Adversarial Compilation

We propose an amortized inference strategy for probabilistic programs, one that learns from the past inferences to speed up the future inferences.

Our proposed inference strategy is to train neural guidance programs via a minimax game, with the probabilistic program …

Posted in Uncategorized | Comments Off on Deep Amortized Inference for Probabilistic Programs using Adversarial Compilation