A Convenient Category for Higher-Order Probability Theory
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
Citing papers per year: 2021: 3; 2022: 3; 2023: 4; 2024: 2; 2025: 0; 2026: 2.
14 papers.
Sort:
- 2021Category Theory in Machine Learningcited by 36
- 2024Position: Categorical Deep Learning is an Algebraic Theory of All Architecturescited by 32
- 2021Learning Proposals for Probabilistic Programs with Inference Combinatorscited by 6
- 2023Declarative Probabilistic Logic Programming in Discrete-Continuous Domainscited by 5
- 2024Probabilistic Programming with Programmable Variational Inferencecited by 4
- 2022Compositional Active Inference II: Polynomial Dynamics. Approximate Inference Doctrinescited by 2
- 2023Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothingcited by 2
- 2021Measure Theoretic Weighted Model Integrationcited by 1
- 2022Higher-Order Generalization Bounds: Learning Deep Probabilistic Programs via PAC-Bayes Objectivescited by 1
- 2023ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programscited by 1
- 2022A Probabilistic Generative Model of Free Categoriescited by 0
- 2023String Diagrams with Factorized Densitiescited by 0
- 2026LazyHMC: Hamiltonian Monte Carlo Simulation for Lazy, Infinite Dimensional Probabilistic Programs9 Aug 2026
- 2026GradInf: Gradient Estimation as Probabilistic Inference8 Jul 2026
- 2024Probabilistic Programming with Programmable Variational Inference22 Jun 2024
- 2024Position: Categorical Deep Learning is an Algebraic Theory of All Architectures23 Feb 2024
- 2023String Diagrams with Factorized Densities4 May 2023
- 2023Declarative Probabilistic Logic Programming in Discrete-Continuous Domains21 Feb 2023
- 2023ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs21 Feb 2023
- 2023Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothing9 Jan 2023
- 2022Compositional Active Inference II: Polynomial Dynamics. Approximate Inference Doctrines25 Aug 2022
- 2022A Probabilistic Generative Model of Free Categories9 May 2022
- 2022Higher-Order Generalization Bounds: Learning Deep Probabilistic Programs via PAC-Bayes Objectives30 Mar 2022
- 2021Category Theory in Machine Learning13 Jun 2021
2 more
- 2021Measure Theoretic Weighted Model Integration25 Mar 2021
- 2021Learning Proposals for Probabilistic Programs with Inference Combinators1 Mar 2021
- 2021Category Theory in Machine Learningcited by 36
- 2024Position: Categorical Deep Learning is an Algebraic Theory of All Architecturescited by 32
- 2021Learning Proposals for Probabilistic Programs with Inference Combinatorscited by 6
- 2023Declarative Probabilistic Logic Programming in Discrete-Continuous Domainscited by 5
- 2024Probabilistic Programming with Programmable Variational Inferencecited by 4
- 2022Compositional Active Inference II: Polynomial Dynamics. Approximate Inference Doctrinescited by 2
- 2023Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothingcited by 2
- 2021Measure Theoretic Weighted Model Integrationcited by 1
- 2022Higher-Order Generalization Bounds: Learning Deep Probabilistic Programs via PAC-Bayes Objectivescited by 1
- 2023ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programscited by 1
- 2022A Probabilistic Generative Model of Free Categoriescited by 0
- 2023String Diagrams with Factorized Densitiescited by 0
12 most cited of 14 All 14 (JSON)
- 2026LazyHMC: Hamiltonian Monte Carlo Simulation for Lazy, Infinite Dimensional Probabilistic Programs9 Aug 2026
- 2026GradInf: Gradient Estimation as Probabilistic Inference8 Jul 2026
- 2024Probabilistic Programming with Programmable Variational Inference22 Jun 2024
- 2024Position: Categorical Deep Learning is an Algebraic Theory of All Architectures23 Feb 2024
- 2023String Diagrams with Factorized Densities4 May 2023
- 2023Declarative Probabilistic Logic Programming in Discrete-Continuous Domains21 Feb 2023
- 2023ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs21 Feb 2023
- 2023Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothing9 Jan 2023
- 2022Compositional Active Inference II: Polynomial Dynamics. Approximate Inference Doctrines25 Aug 2022
- 2022A Probabilistic Generative Model of Free Categories9 May 2022
- 2022Higher-Order Generalization Bounds: Learning Deep Probabilistic Programs via PAC-Bayes Objectives30 Mar 2022
- 2021Category Theory in Machine Learning13 Jun 2021
12 newest of 14 All 14 (JSON)