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

最小费用流匹配置信传播的平滑分析

Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching

Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin

摘要:

置信传播(BP)是一种用于贝叶斯网络和马尔可夫随机场等图形模型中统计推断的消息传递启发式算法。BP用于计算边缘分布或最大似然分配,并且在许多领域中具有应用,包括机器学习、图像处理和计算机视觉。然而,理论上对BP算法性能的理解并不令人满意。近年来,BP算法被应用于组合优化问题。它已被证明,BP可以用来计算最大重量匹配和最小费用流的情况下,一个唯一的最佳。为此所需的迭代次数是伪多项式,因此BP通常不是有效的。我们研究的平滑分析的框架下的信念传播,并证明了高概率的迭代次数需要计算最大权重匹配和最小成本流是由一个多项式的边界,如果随机扰动的边缘的权重/成本。为了证明我们的上界,我们使用Beier和Vöcking的隔离引理(SIAM J. Comput. 2006)匹配和推广Gamarnik,Shah和Wei(运筹学,2012)的最小成本流的隔离引理。我们还证明了BP需要收敛的迭代次数几乎匹配的尾下界。

英文摘要:

Belief propagation (BP) is a message-passing heuristic for statistical inference in graphical models such as Bayesian networks and Markov random fields. BP is used to compute marginal distributions or maximum likelihood assignments and has applications in many areas, including machine learning, image processing, and computer vision. However, the theoretical understanding of the performance of BP is unsatisfactory. Recently, BP has been applied to combinatorial optimization problems. It has been proved that BP can be used to compute maximum-weight matchings and minimum-cost flows for instances with a unique optimum. The number of iterations needed for this is pseudo-polynomial and hence BP is not efficient in general. We study belief propagation in the framework of smoothed analysis and prove that with high probability the number of iterations needed to compute maximum-weight matchings and minimum-cost flows is bounded by a polynomial if the weights/costs of the edges are randomly perturbed. To prove our upper bounds, we use an isolation lemma by Beier and Vöcking (SIAM J. Comput. 2006) for matching and generalize an isolation lemma for min-cost flow by Gamarnik, Shah, and Wei (Operations Research, 2012). We also prove almost matching lower tail bounds for the number of iterations that BP needs to converge.

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

↑