POPL 2023 (series) / LAFI 2023 (series) / LAFI 2023 / Exact Inference for Discrete Probabilistic Programs via Generating Functions
Exact Inference for Discrete Probabilistic Programs via Generating FunctionsParis
We present an exact inference method for probabilistic programs operating on discrete distributions. We support sampling and observing from discrete distributions with infinite support. Our probabilistic programming language also supports affine functions, (stochastic) branching, conditioning on events, and even nested inference. All of this is possible because we work with \emph{probability generating functions}: they provide a compact closed-form representation of distributions to compute posterior probabilities, expectation, variance, and higher moments exactly.
Exact Inference for Discrete Probabilistic Programs via Generating Functions (lafi23-final41.pdf) | 335KiB |
Sun 15 JanDisplayed time zone: Eastern Time (US & Canada) change
Sun 15 Jan
Displayed time zone: Eastern Time (US & Canada) change
09:00 - 10:30 | First SessionLAFI at Scollay Chair(s): Steven Holtzen Northeastern University, Christine Tasson Sorbonne Université — LIP6 | ||
09:00 5mDay opening | Opening Comments LAFI | ||
09:05 60mKeynote | Introduction to the tensor-programs framework, a PL approach that helps analyse theoretical properties of deep learning.Boston LAFI | ||
10:10 10mTalk | Exact Inference for Discrete Probabilistic Programs via Generating FunctionsParis LAFI File Attached | ||
10:20 10mTalk | Exact Probabilistic Inference Using Generating FunctionsBoston LAFI A: Lutz Klinkenberg RWTH Aachen University, Tobias Winkler RWTH Aachen University, Mingshuai Chen RWTH Aachen, Joost-Pieter Katoen RWTH Aachen University File Attached |