使用生成器的概率推理-状态算法
Probabilistic Inference Using Generators - The Statues Algorithm
摘要:
我们在这里提出了一个新的概率推理算法,给出了精确的结果,在域的离散概率分布。该算法被称为Statues算法,用于计算定义为直接非循环图的概率模型的边际概率分布。这些模型是由定义良好的原语,允许表达,特别是,联合概率分布,贝叶斯网络,离散马尔可夫链,条件和概率算术。Statues算法依赖于基于生成器构造的变量绑定机制,这是一种特殊形式的协程;与枚举算法相关,这种新算法在效率方面带来了重要的改进,这使得它在其他精确边缘化算法方面具有价值。在介绍了Statues算法的定义、原语和组合规则之后,详细介绍了Statues算法。然后,我们简要地讨论了这个算法的兴趣相比,其他人,我们提出了可能的扩展。最后,我们介绍了Lea和MicroLea,这两个Python库实现了Statues算法,以及几个用例。在附录中给出了算法正确性的证明。
英文摘要:
We present here a new probabilistic inference algorithm that gives exact results in the domain of discrete probability distributions. This algorithm, named the Statues algorithm, calculates the marginal probability distribution on probabilistic models defined as direct acyclic graphs. These models are made up of well-defined primitives that allow to express, in particular, joint probability distributions, Bayesian networks, discrete Markov chains, conditioning and probabilistic arithmetic. The Statues algorithm relies on a variable binding mechanism based on the generator construct, a special form of coroutine; being related to the enumeration algorithm, this new algorithm brings important improvements in terms of efficiency, which makes it valuable in regard to other exact marginalization algorithms. After introduction of several definitions, primitives and compositional rules, we present in details the Statues algorithm. Then, we briefly discuss the interest of this algorithm compared to others and we present possible extensions. Finally, we introduce Lea and MicroLea, two Python libraries implementing the Statues algorithm, along with several use cases. A proof of the correctness of the algorithm is provided in appendix.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。