节点分裂:一种生成贝叶斯网络上界的方案
Node Splitting: A Scheme for Generating Upper Bounds in Bayesian Networks
摘要:
在本文中,我们制定的迷你桶算法近似推理的精确推理的近似模型分裂节点的贝叶斯网络。新的提法导致了一些理论和实践的影响。首先,我们表明,分支定界搜索算法,使用minibucket边界可能会大大减少搜索空间。第二,我们表明,拟议的配方启发新的minibucket物流,并允许我们从一个新的角度来分析现有的物流。最后,我们表明,这种新的配方允许迷你桶近似受益于最近的进展,精确的推理,允许一个显着增加这些近似的范围。
英文摘要:
We formulate in this paper the mini-bucket algorithm for approximate inference in terms of exact inference on an approximate model produced by splitting nodes in a Bayesian network. The new formulation leads to a number of theoretical and practical implications. First, we show that branchand- bound search algorithms that use minibucket bounds may operate in a drastically reduced search space. Second, we show that the proposed formulation inspires new minibucket heuristics and allows us to analyze existing heuristics from a new perspective. Finally, we show that this new formulation allows mini-bucket approximations to benefit from recent advances in exact inference, allowing one to significantly increase the reach of these approximations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。