Write a Blog >>
Tue 21 Jan 2020 15:35 - 16:05 at St Claude - D

We propose a coinductive variant of Knuth-Yao trees (variously, Discrete Distribution Generating trees) as an intermediate representation supporting exact inference for probabilistic programs which may contain loops with probabilistic termination conditions. We provide a prototype implementation of a probabilistic programming language, Zar, written in Haskell, exemplifying both Knuth-Yao trees as well as exact inference on the trees.

Tue 21 Jan
Times are displayed in time zone: Saskatchewan, Central America change

15:35 - 17:45
15:35
30m
Talk
Coinductive Trees for Exact Inference of Probabilistic Programs
LAFI
Alexander BagnallOhio University, Gordon StewartOhio University, Anindya BanerjeeIMDEA Software Institute
16:05
30m
Talk
Name generation and Higher-order Probabilistic Programming (Or is new=rnd?)
LAFI
Dario SteinUniversity of Oxford, Sam StatonUniversity of Oxford, Michael WolmanMcGill University
File Attached
16:35
30m
Talk
Density Functions of Statistical Probabilistic Programs
LAFI
Tom MattinsonUniversity of Oxford, C.-H. Luke OngUniversity of Oxford
17:05
30m
Talk
Probabilistic Programming around Gaussian Processes
LAFI
17:35
10m
Day closing
Closing
LAFI