String Diagrams with Factorized Densities

Abstract

A growing body of research on probabilistic programs and causal models has highlighted the need to reason compositionally about model classes that extend directed graphical models. Both probabilistic programs and causal models define a joint probability density over a set of random variables, and exhibit sparse structure that can be used to reason about causation and conditional independence. This work builds on recent work on Markov categories of probabilistic mappings to define a category whose morphisms combine a joint density, factorized over each sample space, with a deterministic mapping from samples to return values. This is a step towards closing the gap between recent category-theoretic descriptions of probability measures, and the operational definitions of factorized densities that are commonly employed in probabilistic programming and causal inference.

arXiv commentIn Proceedings ACT 2023, arXiv:2312.08138

References in corpus (15)

• Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Review
• A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
• Disintegration and Bayesian Inversion via String Diagrams
• A Convenient Category for Higher-Order Probability Theory
• Denotational validation of higher-order Bayesian inference
• Rewriting modulo symmetric monoidal structure
• Towards Foundations of Categorical Cybernetics
• Free gs-monoidal categories and free Markov categories
• Bayesian Updates Compose Optically
• The d-separation criterion in Categorical Probability
• Discrete-Continuous Mixtures in Probabilistic Programming: Generalized Semantics and Inference Algorithms
• On S-Finite Measures and Kernels
• The Base Measure Problem and its Solution
• Compositionality in algorithms for smoothing
• Data-Parallel Algorithms for String Diagrams