Write a Blog >>
POPL 2021
Sun 17 - Fri 22 January 2021 Online
Sun 17 Jan 2021 17:03 - 17:16 at LAFI - Session 1 Chair(s): Jean-Baptiste Tristan

Conditioning on equality of continuous random variables is in general ill-defined, as the exact observation may have probability zero; this is Borel’s paradox. We use disintegrations in the abstract setting of CD- and Markov categories as a foundation for defining probabilistic programming languages with conditioning on equality in a principled way.

Slides (LAFI Slides.pdf)410KiB
Extended Abstract (LAFI Abstract.pdf)1.34MiB

Sun 17 Jan
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

16:50 - 17:30: Session 1LAFI at LAFI
Chair(s): Jean-Baptiste TristanBoston College
16:50 - 17:03
Talk
Binary Tree Hamiltonian Monte Carlo
LAFI
Carol MakUniversity of Oxford, Fabian ZaiserUniversity of Oxford, C.-H. Luke OngUniversity of Oxford
File Attached
17:03 - 17:16
Talk
An algebraic theory of conditioning
LAFI
Dario SteinUniversity of Oxford, Sam StatonUniversity of Oxford
File Attached
17:16 - 17:30
Talk
The Selection Monad and Decision-Making Languages
LAFI
File Attached