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.
Sun 17 JanDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
16:50 - 17:30
|Binary Tree Hamiltonian Monte Carlo|
Carol Mak University of Oxford, Fabian Zaiser University of Oxford, C.-H. Luke Ong University of OxfordFile Attached
|An algebraic theory of conditioning|
|The Selection Monad and Decision-Making Languages|