paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Probability monads with submonads of deterministic states

带有确定性状态子单子的概率单子
LICS Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science2022匹配度 2/10 · 论文属于概率单子与Markov范畴的范畴论形式语义,讨论sober对象、sobrification函子与de Finetti定理,与静态分析、LLM/Agent、浮点程序分析或贝叶斯程序分析均无直接交集。它最多只在概率/贝叶斯编程的语义基础层面有较远的理论关联。引用 10 inbox
Sean Moss, Paolo Perrone
crossref: 2026-09-12dblp: 2026-09-12arxiv: 2026-09-12

AI 速览

一句话:为概率单子引入sober对象与sobrification函子,并强化Markov范畴的de Finetti定理

论文从合成视角把概率论视为交换单子所刻画的计算效应,并在 Markov 范畴中通过复制与丢弃操作等式地定义确定性态射。由此产生“纯态射”与“确定性态射”的区分:论文研究概率单子的 sober 对象,即二者重合的对象。作者提出概率单子应满足的自然条件,用于识别 sober 对象并构造幂等的 sobrification 函子。该框架适用于诸多实例,包括可测空间上的 Giry 单子,并据此加强先前针对 Markov 范畴给出的 de Finetti 定理版本。

问题
如何刻画概率单子中“纯”与“确定性”态射重合的 sober 对象,并厘清其与 Markov 范畴中 de Finetti 定理的联系。
方法
对概率单子提出自然条件以识别 sober 对象,并构造幂等的 sobrification 函子。
评估
将框架应用于多个实例,包括可测空间上的 Giry 单子,并加强已有的 Markov 范畴 de Finetti 定理。
原文摘要(Abstract)

Probability theory can be studied synthetically as the computational effect embodied by a commutative monad. In the recently proposed Markov categories, one works with an abstraction of the Kleisli category and then defines deterministic morphisms equationally in terms of copying and discarding. The resulting difference between ‘pure’ and ‘deterministic’ leads us to investigate the ‘sober’ objects for a probability monad, for which the two concepts coincide. We propose natural conditions on a probability monad which allow us to identify the sober objects and define an idempotent sobrification functor. Our framework applies to many examples of interest, including the Giry monad on measurable spaces, and allows us to sharpen a previously given version of de Finetti’s theorem for Markov categories.

链接与引用

DOI 原文 · arXiv · PDF(开放获取) · DBLP

BibTeX
@inproceedings{MossP22,
  title = {Probability monads with submonads of deterministic states},
  author = {Sean Moss and Paolo Perrone},
  booktitle = {LICS},
  year = {2022},
  doi = {10.1145/3531130.3533355}
}