The semantic structure of quasi-Borel spaces: algebra, logic, and recursion
Quasi-Borel spaces are a new mathematical structure that supports higher-order probability theory, first-order iteration, and modular semantic validation of Bayesian inference algorithms with continuous distributions. Like a measurable space, a quasi-Borel space is a set with extra structure suitable for defining probability and measure distributions. But unlike measurable spaces, quasi-Borel spaces and their structure- preserving maps form a well-behaved category: they are cartesian- closed, and so suitable for higher-order semantics, and they also form a model of Kock’s synthetic measure theory, and so suitable for probabilistic, and measure-theoretic, developments, such as the Metropolis- Hastings-Green theorem underlying Markov-Chain Monte-Carlo algorithms.
Tue 9 JanDisplayed time zone: Tijuana, Baja California change
10:30 - 12:00 | |||
10:30 30mTalk | The semantic structure of quasi-Borel spaces: algebra, logic, and recursion PPS Chris Heunen University of Edinburgh, Ohad Kammar University of Oxford, Sean Moss University of Oxford, Adam Ścibior University of Cambridge and MPI Tuebingen, Sam Staton University of Oxford, Matthijs Vákár University of Oxford, Hongseok Yang University of Oxford Pre-print | ||
11:00 30mTalk | Stable, measurable functions and probabilistic programs PPS Michele Pagani University Paris Diderot, Thomas Ehrhard CNRS and University Paris Diderot, Christine Tasson University Paris Diderot | ||
11:30 30mTalk | Formal Methods For Probabilistic Programming PPS Daniel Selsam Stanford University | ||