arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0807.5091cs.AIcs.ITmath.IT
收藏

最大权独立集的消息传递

Message-passing for Maximum Weight Independent Set

Massachusetts Institute of Technology(麻省理工学院)

Sujay Sanghavi, Devavrat Shah, Alan Willsky

摘要:

我们调查使用的消息传递算法的问题,发现最大重量独立集(MWIS)在一个图。首先,我们研究了经典的循环最大积信念传播的性能。我们发现,每个不动点估计的最大产品可以以自然的方式映射到一个极端点的LP多面体与MWIS问题。然而,这个极值点可能不是最大化节点权重值的极值点;最终收敛时的特定极值点取决于最大乘积的初始化。然后,我们表明,如果最大产品是从自然初始化的无信息的消息,它总是解决了正确的LP -如果它收敛。这个结果是通过对迭代算法的直接分析得到的,并且不能通过只看固定点来得到。因此,LP松弛的紧密性对于最大乘积最优性是必要的,但它是不够的。出于这一观察,我们表明,一个简单的修改的最大产品成为梯度下降(一个convexified版本)的对偶LP,并收敛到对偶最优。我们还开发了一个消息传递算法,从下降算法的输出恢复原始MWIS解决方案。我们表明,MWIS估计使用这两种算法结合起来是正确的,当图是二分的,MWIS是唯一的。最后,我们表明,在有限域上的概率分布的MAP估计的任何问题可以减少到MWIS问题。我们相信这种减少将产生新的见解和算法的MAP估计。

英文摘要:

We investigate the use of message-passing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the performance of the classical loopy max-product belief propagation. We show that each fixed point estimate of max-product can be mapped in a natural way to an extreme point of the LP polytope associated with the MWIS problem. However, this extreme point may not be the one that maximizes the value of node weights; the particular extreme point at final convergence depends on the initialization of max-product. We then show that if max-product is started from the natural initialization of uninformative messages, it always solves the correct LP -- if it converges. This result is obtained via a direct analysis of the iterative algorithm, and cannot be obtained by looking only at fixed points. The tightness of the LP relaxation is thus necessary for max-product optimality, but it is not sufficient. Motivated by this observation, we show that a simple modification of max-product becomes gradient descent on (a convexified version of) the dual of the LP, and converges to the dual optimum. We also develop a message-passing algorithm that recovers the primal MWIS solution from the output of the descent algorithm. We show that the MWIS estimate obtained using these two algorithms in conjunction is correct when the graph is bipartite and the MWIS is unique. Finally, we show that any problem of MAP estimation for probability distributions over finite domains can be reduced to an MWIS problem. We believe this reduction will yield new insights and algorithms for MAP estimation.

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

↑