Pith. sign in

REVIEW 1 cited by

A Probability Monad as the Colimit of Spaces of Finite Samples

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 1712.05363 v4 pith:FATQLI4H submitted 2017-12-14 math.PR cs.LOmath.CT

classification math.PRcs.LOmath.CT
keywords monadspacescategoryfinitemeasuresprobabilitycolimitcomplete
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We define and study a probability monad on the category of complete metric spaces and short maps. It assigns to each space the space of Radon probability measures on it with finite first moment, equipped with the Kantorovich-Wasserstein distance. This monad is analogous to the Giry monad on the category of Polish spaces, and it extends a construction due to van Breugel for compact and for 1-bounded complete metric spaces. We prove that this Kantorovich monad arises from a colimit construction on finite power-like constructions, which formalizes the intuition that probability measures are limits of finite samples. The proof relies on a criterion for when an ordinary left Kan extension of lax monoidal functors is a monoidal Kan extension. The colimit characterization allows the development of integration theory and the treatment of measures on spaces of measures, without measure theory. We also show that the category of algebras of the Kantorovich monad is equivalent to the category of closed convex subsets of Banach spaces with short affine maps as morphisms.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Functional probabilistic programming for scalable Bayesian modelling

    stat.CO 2019-08 unverdicted novelty 2.0 of 10

    An expository paper showing that Scala's functional abstractions, especially monads, support embedded probabilistic programming with Hamiltonian Monte Carlo, demonstrated on linear, mixture, and hierarchical models.

Pith tools