mlsanityData to 7 Oct 2026

A Convenient Category for Higher-Order Probability Theory

arXiv 1701.02547 ↗First posted 10 Jan 2017cs.PL cs.AI cs.LOcited by 14

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Jan 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 3; 2023: 4; 2024: 2; 2025: 0; 2026: 2.

14 papers.

Sort: