arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1206.3288cs.DScs.AIcs.CE
收藏

使用消息传递收紧MAP的LP松弛

Tightening LP Relaxations for MAP using Message Passing

CSAIL, MIT(麻省理工学院计算机科学与人工智能实验室);Hebrew University(希伯来大学)

David Sontag, Talya Meltzer, Amir Globerson, Tommi S. Jaakkola, Yair Weiss

摘要:

线性规划(LP)松弛已经成为在图形模型中找到最可能(MAP)配置的强大工具。这些松弛可以有效地解决使用消息传递算法,如信念传播,当松弛是紧的,可证明找到MAP配置。然而,标准LP松弛在许多现实世界的问题中不够紧密,这导致了使用更高阶的基于簇的LP松弛。计算成本随着集群的大小呈指数级增长,并限制了我们可以使用的集群的数量和类型。我们建议在对偶LP中单调地解决集群选择问题,迭代地选择具有保证改进的集群,并通过重用现有解决方案快速重新解决添加的集群。我们的双消息传递算法发现MAP配置在蛋白质侧链布局,蛋白质设计,和立体声问题,在标准LP松弛失败的情况下。

英文摘要:

Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently using message-passing algorithms such as belief propagation and, when the relaxation is tight, provably find the MAP configuration. The standard LP relaxation is not tight enough in many real-world problems, however, and this has lead to the use of higher order cluster-based LP relaxations. The computational cost increases exponentially with the size of the clusters and limits the number and type of clusters we can use. We propose to solve the cluster selection problem monotonically in the dual LP, iteratively selecting clusters with guaranteed improvement, and quickly re-solving with the added clusters by reusing the existing solution. Our dual message-passing algorithm finds the MAP configuration in protein sidechain placement, protein design, and stereo problems, in cases where the standard LP relaxation fails.

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

↑