A Convenient Category for Higher-Order Probability Theory

01/10/2017
by   Chris Heunen, et al.
0

Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of probability theory. Programs may use both higher-order functions and continuous distributions, or even define a probability distribution on functions. But standard probability theory does not handle higher-order functions well: the category of measurable spaces is not cartesian closed. Here we introduce quasi-Borel spaces. We show that these spaces: form a new formalization of probability theory replacing measurable spaces; form a cartesian closed category and so support higher-order functions; form a well-pointed category and so support good proof principles for equational reasoning; and support continuous probability distributions. We demonstrate the use of quasi-Borel spaces for higher-order functions and probability by: showing that a well-known construction of probability theory involving random functions gains a cleaner expression; and generalizing de Finetti's theorem, that is a crucial theorem in probability theory, to quasi-Borel spaces.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2018

A Domain Theory for Statistical Probabilistic Programming

We give an adequate denotational semantics for languages with recursive ...
research
09/14/2021

Quasi-Measurable Spaces

We introduce the categories of quasi-measurable spaces, which are slight...
research
11/09/2017

Denotational validation of higher-order Bayesian inference

We present a modular semantic account of Bayesian inference algorithms f...
research
06/28/2018

Domains and Stochastic Processes

Domain theory has a long history of applications in theoretical computer...
research
05/31/2022

Concrete categories and higher-order recursion (With applications including probability, differentiability, and full abstraction)

We study concrete sheaf models for a call-by-value higher-order language...
research
12/06/2018

Higher-order Stein kernels for Gaussian approximation

We introduce higher-order Stein kernels relative to the standard Gaussia...
research
07/16/2018

Formal verification of higher-order probabilistic programs

Probabilistic programming provides a convenient lingua franca for writin...

Please sign up or login with your details

Forgot password? Click here to reset