贝叶斯网络与证明网:贝叶斯推断的证明论
Bayesian Networks and Proof-Nets: the proof-theory of Bayesian Inference
AI总结:
本文提出通过证明论方法将贝叶斯推断与线性逻辑中的证明图形相结合,探讨其组合性和计算效率。
摘要:
我们研究贝叶斯网络与线性逻辑中证明的图形表示之间的对应关系。本文的目标有三:一是发展贝叶斯推断的证明论账户(以 Curry-Howard 对应关系为精神);二是提供组合性的图形方法;三是考虑计算效率。我们利用图的分解比证明树或类型推导更灵活,即使组合性变得更加具有挑战性这一事实。
英文摘要:
We study the correspondence between Bayesian Networks and graphical representation of proofs in linear logic. The goal of this paper is threefold: to develop a proof-theoretical account of Bayesian inference (in the spirit of the Curry-Howard correspondence between proofs and programs), to provide compositional graphical methods, and to take into account computational efficiency. We exploit the fact that the decomposition of a graph is more flexible than that of a proof-tree, or of a type-derivation, even if compositionality becomes more challenging.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。