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

最小费用网络流的置信传播:收敛性和正确性

Belief Propagation for Min-cost Network Flow: Convergence and Correctness

MIT(麻省理工学院)

David Gamarnik, Devavrat Shah, Yehua Wei

摘要:

消息传递类型算法(诸如所谓的置信传播算法)作为用于解决各种优化和推理问题的有吸引力的算法,最近在统计、信号处理和机器学习社区中获得了大量关注。作为一个分散的,易于实现和经验上成功的算法,BP值得关注的理论观点,在这里没有太多的是已知的,在现阶段。为了填补这一空白,我们考虑的能力限制的最小成本网络流问题的背景下,在运筹学领域的经典问题的BP算法的性能。我们证明了BP算法在伪多项式时间内收敛到最优解,条件是问题的最优解是唯一的且问题输入是整数。此外,我们提出了一个简单的修改BP算法,它给出了一个完全多项式时间随机近似计划(FPRAS)为同一问题,不再需要的唯一性的最优解。这是第一次证明BP具有完全多项式的运行时间。因此,我们的研究结果提供了一个理论上的理由,BP作为一个有吸引力的方法来解决一类重要的优化问题的可行性。

英文摘要:

Message passing type algorithms such as the so-called Belief Propagation algorithm have recently gained a lot of attention in the statistics, signal processing and machine learning communities as attractive algorithms for solving a variety of optimization and inference problems. As a decentralized, easy to implement and empirically successful algorithm, BP deserves attention from the theoretical standpoint, and here not much is known at the present stage. In order to fill this gap we consider the performance of the BP algorithm in the context of the capacitated minimum-cost network flow problem - the classical problem in the operations research field. We prove that BP converges to the optimal solution in the pseudo-polynomial time, provided that the optimal solution of the underlying problem is unique and the problem input is integral. Moreover, we present a simple modification of the BP algorithm which gives a fully polynomial-time randomized approximation scheme (FPRAS) for the same problem, which no longer requires the uniqueness of the optimal solution. This is the first instance where BP is proved to have fully-polynomial running time. Our results thus provide a theoretical justification for the viability of BP as an attractive method to solve an important class of optimization problems.

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

↑