2016/10/31 by Tuan Anh Le, Atilim Gunes Baydin, Frank Wood · 1 citation
Computer Science · Mathematics · #acm:68T05 #acm:68T37 #cs.AI #cs.LG #msc:68T05 #msc:68T37 #stat.ML
published as In Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS 2017), 54:1338--1348. Proceedings of Machine Learning Research. Fort Lauderdale, FL, USA: PMLR · 11 pages, 6 figures
arxiv created 2017/03/02 · arxiv updated 2018/09/03
We introduce a method for using deep neural networks to amortize the cost of inference in models from the family induced by universal probabilistic programming languages, establishing a framework that combines the strengths of probabilistic programming and deep learning methods. We call what we do "compilation of inference" because our method transforms a denotational specification of an inference problem in the form of a probabilistic program written in a universal programming language into a trained neural network denoted in a neural network specification language. When at test time this neural network is fed observational data and executed, it performs approximate inference in the original model specified by the probabilistic program. Our training objective and learning procedure are designed to allow the trained neural network to be used as a proposal distribution in a sequential importance sampling inference engine. We illustrate our method on mixture models and Captcha solving and show significant speedups in the efficiency of inference.