Borel kernels and their approximation, categorically

DOI10.1016/j.entcs.2018.11.006OpenAlexW2963242323WikidataQ113317493 ScholiaQ113317493MaRDI QIDQ2134827

Fredrik Dahlqvist, Alexandra Silva, Vincent Danos, Ilias Garnier

Publication date: 3 May 2022

Full work available at URL: https://arxiv.org/abs/1803.02651

zbMATH Keywords

approximationMarkov processBayesian inferenceprobabilistic programmingprobabilistic semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics ⋮ A categorical characterization of relative entropy on standard Borel spaces

Uses Software

• ProbNetKAT
• QPL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metrics for labelled Markov processes
• Semantics of probabilistic programs
• Sur les espaces de Köthe
• Probabilistic NetKAT
• Dagger Compact Closed Categories and Completely Positive Maps
• Pointless Learning
• Commutative Semantics for Probabilistic Programming
• Probability with Martingales
• Bayesian Inversion by ω-Complete Cone Duality
• Semantics for probabilistic programming
• Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes
• Approximation theorems for Markov operators
• Approximating Markov Processes by Averaging
• CONCUR 2003 - Concurrency Theory

This page was built for publication: Borel kernels and their approximation, categorically