Representable Markov Categories and Comparison of Statistical Experiments in Categorical Probability
Not on the map. Why?
Abstract (arXiv)
Markov categories are a recent categorical approach to the mathematical foundations of probability and statistics. Here, this approach is advanced by stating and proving equivalent conditions for second-order stochastic dominance, a widely used way of comparing probability distributions by their spread. Furthermore, we lay foundation for the theory of comparing statistical experiments within Markov categories by stating and proving the classical Blackwell-Sherman-Stein Theorem. Our version not only offers new insight into the proof, but its abstract nature also makes the result more general, automatically specializing to the standard Blackwell-Sherman-Stein Theorem in measure-theoretic probability as well as a Bayesian version that involves prior-dependent garbling. Along the way, we define and characterize representable Markov categories, within which one can talk about Markov kernels to or from spaces of distributions. We do so by exploring the relation between Markov categories and Kleisli categories of probability monads.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 2; 2024: 3; 2025: 1; 2026: 1.
11 papers.
- 2021Category Theory in Machine Learningcited by 36
- 2024Neural Circuit Diagrams: Robust Diagrams for the Communication, Implementation, and Analysis of Deep Learning Architecturescited by 8
- 2023On Meta-Promptingcited by 6
- 2022Categorical semantics of compositional reinforcement learningcited by 5
- 2021A Categorical Semantics of Fuzzy Concepts in Conceptual Spacescited by 4
- 2024Reinforcement Learning in Categorical Cyberneticscited by 4
- 2021Compositional Semantics for Probabilistic Programs with Exact Conditioningcited by 2
- 2024Reduce, Reuse, Recycle: Categories for Compositional Reinforcement Learningcited by 2
- 2023Supervised learning with probabilistic morphisms and kernel mean embeddingscited by 1
- 2025Transparent Semantic Spaces: A Categorical Approach to Explainable Word Embeddingscited by 0
- 2026Weaves, Wires, and Morphisms: Formalizing and Implementing the Algebra of Deep Learningcited by 0
- 2026Weaves, Wires, and Morphisms: Formalizing and Implementing the Algebra of Deep Learning8 Apr 2026
- 2025Transparent Semantic Spaces: A Categorical Approach to Explainable Word Embeddings28 Aug 2025
- 2024Reduce, Reuse, Recycle: Categories for Compositional Reinforcement Learning23 Aug 2024
- 2024Reinforcement Learning in Categorical Cybernetics3 Apr 2024
- 2024Neural Circuit Diagrams: Robust Diagrams for the Communication, Implementation, and Analysis of Deep Learning Architectures8 Feb 2024
- 2023On Meta-Prompting11 Dec 2023
- 2023Supervised learning with probabilistic morphisms and kernel mean embeddings10 May 2023
- 2022Categorical semantics of compositional reinforcement learning29 Aug 2022
- 2021A Categorical Semantics of Fuzzy Concepts in Conceptual Spaces12 Oct 2021
- 2021Category Theory in Machine Learning13 Jun 2021
- 2021Compositional Semantics for Probabilistic Programs with Exact Conditioning27 Jan 2021