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

一般图模型MAP推理的剪枝部分最优性

Partial Optimality by Pruning for MAP-Inference with General Graphical Models

Paul Swoboda, Alexander Shekhovtsov, Jörg Hendrik Kappes, Christoph Schnörr, Bogdan Savchynskyy

摘要:

我们考虑无向图模型的能量最小化问题,也被称为马尔可夫随机场的MAP推理问题,这是NP-困难的。我们提出了一种新的多项式时间算法,以获得其最优非松弛积分解的一部分。我们的算法是初始化的变量采取积分值的凸松弛的MAP推理问题的解决方案,并迭代修剪那些,不满足我们的部分最优性的标准。我们表明,我们的修剪策略在一定意义上是理论上最优的。从经验上讲,我们的方法在持续标记变量的数量方面优于以前的方法。该方法是非常普遍的,因为它适用于模型与任意阶的任意因素,并可以采用任何求解器所考虑的放松的问题。我们的方法的运行时间是由凸松弛求解器的MAP推理问题的运行时间。

英文摘要:

We consider the energy minimization problem for undirected graphical models, also known as MAP-inference problem for Markov random fields which is NP-hard in general. We propose a novel polynomial time algorithm to obtain a part of its optimal non-relaxed integral solution. Our algorithm is initialized with variables taking integral values in the solution of a convex relaxation of the MAP-inference problem and iteratively prunes those, which do not satisfy our criterion for partial optimality. We show that our pruning strategy is in a certain sense theoretically optimal. Also empirically our method outperforms previous approaches in terms of the number of persistently labelled variables. The method is very general, as it is applicable to models with arbitrary factors of an arbitrary order and can employ any solver for the considered relaxed problem. Our method's runtime is determined by the runtime of the convex relaxation solver for the MAP-inference problem.

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

↑