Pith. sign in

REVIEW 2 cited by

A Convenient Category for Higher-Order Probability Theory

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1701.02547 v4 pith:N6UKRFMH submitted 2017-01-10 cs.PL cs.AIcs.LOmath.CTmath.PR

classification cs.PLcs.AIcs.LOmath.CTmath.PR
keywords probabilityfunctionshigher-orderspacestheorycategoryformquasi-borel
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Cancellative Convex Semilattices

    cs.LO 2025-07 accept novelty 7.0 of 10

    A convex semilattice is cancellative if and only if it embeds into a Riesz space, the lattice-ordered-vector-space analogue of the Stone-Kneser theorem.

  2. A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics

    math.ST 2019-08 conditional novelty 7.0 of 10

    Markov categories provide a synthetic, axiom-based framework in which conditional independence, sufficiency, completeness, and classical theorems such as Basu and Bahadur hold uniformly across many probability theories.

Pith tools