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

We present a transformer that takes a first order probabilistic program and returns a density function corresponding to this program. Alongside this we also present a type system that identifies the distributions these programs represent as absolutely continuous. These absolutely continuous distributions are precisely those that admit density functions. This work includes analysis on programs with both scoring con- structs and unbounded loops.

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