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

MAP复杂性结果和近似方法

MAP Complexity Results and Approximation Methods

University of California(加利福尼亚大学)

James D. Park

摘要:

MAP是在贝叶斯网络中找到一组n变量的最可能实例的问题,给出一些证据。MAP似乎是一个显着困难的问题比相关的问题,计算证据的概率Pr,或MPE的MAP的一个特殊情况。由于MAP的复杂性,以及缺乏可行的算法来近似它,MAP计算通常被从业者避免。本文研究了MAP的复杂性。我们证明了MAP对于NP是完备的。我们还提供了负面的复杂性结果消除为基础的算法。事实证明,即使MPE和Pr很容易,MAP仍然很难。我们发现,MAP是NP完全的网络时,被限制为多树,即使这样也不能有效地近似。因为没有近似算法保证的结果,我们调查最好的努力近似。我们介绍了一个通用的MAP近似框架。作为它的一个实例,我们实现了局部搜索加上置信传播BP近似MAP。我们展示了如何从置信传播中提取近似的证据撤回信息,这使我们能够进行有效的局部搜索。这允许MAP近似,即使在过于复杂的网络上,甚至可以精确地解决计算Pr或MPE的简单问题。实验结果表明,使用BP和局部搜索在许多情况下提供了准确的MAP估计。

英文摘要:

MAP is the problem of finding a most probable instantiation of a set of nvariables in a Bayesian network, given some evidence. MAP appears to be a significantly harder problem than the related problems of computing the probability of evidence Pr, or MPE a special case of MAP. Because of the complexity of MAP, and the lack of viable algorithms to approximate it,MAP computations are generally avoided by practitioners. This paper investigates the complexity of MAP. We show that MAP is complete for NP. We also provide negative complexity results for elimination based algorithms. It turns out that MAP remains hard even when MPE, and Pr are easy. We show that MAP is NPcomplete when the networks are restricted to polytrees, and even then can not be effectively approximated. Because there is no approximation algorithm with guaranteed results, we investigate best effort approximations. We introduce a generic MAP approximation framework. As one instantiation of it, we implement local search coupled with belief propagation BP to approximate MAP. We show how to extract approximate evidence retraction information from belief propagation which allows us to perform efficient local search. This allows MAP approximation even on networks that are too complex to even exactly solve the easier problems of computing Pr or MPE. Experimental results indicate that using BP and local search provides accurate MAP estimates in many cases.

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

↑