arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.2034cs.AI
收藏

基于Loop演算和置信传播的平面图近似推理

Approximate inference on planar graphs using Loop Calculus and Belief Propagation

Radboud University Nijmegen(奈梅亨拉德堡德大学);Los Alamos National Laboratory(洛斯阿拉莫斯国家实验室)

Vicenc Gomez, Hilbert Kappen, Michael Chertkov

摘要:

我们介绍了新的结果近似推理平面图形模型使用循环演算框架。循环演算(Chertkov和Chernyak,2006 b)允许将图形模型的精确分区函数Z表示为有限项和,一旦置信传播(BP)解已知,就可以对其进行评估。一般来说,对所有校正项的完全求和是难以处理的。我们为Chertkov等人(2008)中提出的方法开发了一种算法,该算法代表了平面图上的有效截断方案和矩阵Pfirmans级数的新表示。我们详细分析了循环系列和Pfweian系列的二进制变量和成对相互作用的模型,并表明Pfweian系列的第一项可以提供非常准确的近似。该算法优于以前的截断计划的循环系列和竞争力与其他国家的最先进的近似推理方法。

英文摘要:

We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to express the exact partition function Z of a graphical model as a finite sum of terms that can be evaluated once the belief propagation (BP) solution is known. In general, full summation over all correction terms is intractable. We develop an algorithm for the approach presented in Chertkov et al. (2008) which represents an efficient truncation scheme on planar graphs and a new representation of the series in terms of Pfaffians of matrices. We analyze in detail both the loop series and the Pfaffian series for models with binary variables and pairwise interactions, and show that the first term of the Pfaffian series can provide very accurate approximations. The algorithm outperforms previous truncation schemes of the loop series and is competitive with other state-of-the-art methods for approximate inference.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑