一种基于边删除的贝叶斯网络变分逼近方法
A Variational Approach for Approximating Bayesian Networks by Edge Deletion
摘要:
在本文中,我们认为在贝叶斯网络中的近似推理的制定作为一个问题的近似网络,删除边缘(以减少树宽)的结果的精确推理。我们在早期的工作中已经表明,删除边要求引入辅助网络参数来补偿丢失的依赖关系,并提出了确定这些参数的直观条件。我们还表明,我们的方法对应于IBP当足够的边缘被删除,以产生一个多叉树,并对应于一些推广的IBP当较少的边缘被删除。在本文中,我们提出了一个不同的标准来确定辅助参数的基础上优化原始网络和近似网络之间的KL发散。我们讨论了这两种方法之间的关系,选择参数,脱落新的光IBP及其推广。我们还讨论了我们的新方法的应用,近似推理问题是指数约束树宽,包括MAP和非近视值的信息。
英文摘要:
We consider in this paper the formulation of approximate inference in Bayesian networks as a problem of exact inference on an approximate network that results from deleting edges (to reduce treewidth). We have shown in earlier work that deleting edges calls for introducing auxiliary network parameters to compensate for lost dependencies, and proposed intuitive conditions for determining these parameters. We have also shown that our method corresponds to IBP when enough edges are deleted to yield a polytree, and corresponds to some generalizations of IBP when fewer edges are deleted. In this paper, we propose a different criteria for determining auxiliary parameters based on optimizing the KL-divergence between the original and approximate networks. We discuss the relationship between the two methods for selecting parameters, shedding new light on IBP and its generalizations. We also discuss the application of our new method to approximating inference problems which are exponential in constrained treewidth, including MAP and nonmyopic value of information.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。