We present a novel approach for approximate sampling in probabilistic programs based on incremental inference. The key idea is to adapt the samples for a program P into samples for a program Q, thereby avoiding the expensive sampling computation for program Q. To enable incremental inference in probabilistic programming, our work: (i) introduces the concept of a trace translator which adapts samples from P into samples of Q, (ii) phrases this translation approach in the context of sequential Monte Carlo (SMC), which gives theoretical guarantees that the adapted samples converge to the distribution induced by Q, and (iii) shows how to obtain a concrete trace translator by establishing a correspondence between the random choices of the two probabilistic programs. We implemented our approach in two different probabilistic programming systems and showed that, compared to methods that sample the program Q from scratch, incremental inference can lead to orders of magnitude increase in efficiency, depending on how closely related P and Q are.
Fri 22 Jun Times are displayed in time zone: (GMT-04:00) Eastern Time (US & Canada) change
|11:00 - 11:25|
Marco Cusumano-TownerMIT-CSAIL, Benjamin BichselETH Zurich, Switzerland, Timon Gehr, Martin VechevETH Zürich, Vikash MansinghkaMITMedia Attached
|11:25 - 11:50|
Timon Gehr, Sasa MisailovicUniversity of Illinois at Urbana-Champaign, USA, Petar TsankovETH Zurich, Laurent VanbeverETH Zürich, Pascal WiesmannETH Zurich, Switzerland, Martin VechevETH ZürichMedia Attached
|11:50 - 12:15|
Vikash MansinghkaMIT, Ulrich SchaechtleMassachusetts Institute of Technology, USA, Shivam Handa, Alexey Radul, Yutian ChenGoogle Deepmind, n.n., Martin RinardMassachusetts Institute of TechnologyMedia Attached