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

MAP迭代的复杂性结果和逼近策略

Complexity Results and Approximation Strategies for MAP Explanations

University of California Los Angeles(加州大学洛杉矶分校)

A. Darwiche, J. D. Park

摘要:

MAP是找到一组给定证据的变量的最可能实例的问题。MAP一直被认为比计算变量实例化Pr的概率或计算最可能解释(MPE)的问题要困难得多。本文研究了贝叶斯网络中MAP的复杂性。具体来说,我们表明,MAP是完全的NP^PP,并提供进一步的负复杂性的结果,基于变量消除算法。我们还表明,MAP仍然很难,即使MPE和Pr变得容易。例如,我们表明,MAP是NP-完全的网络时,被限制为多树,即使这样也不能有效地近似。由于计算MAP准确的困难,以及近似MAP的困难,同时提供有用的保证所得到的近似,我们研究尽力而为的近似。我们介绍了一个通用的MAP近似框架。我们提供了两个实例的框架,一个网络是服从精确推理Pr,一个网络,甚至精确的推理是太难了。这允许MAP近似网络太复杂,甚至无法精确解决更简单的问题,Pr和MPE。实验结果表明,使用这些近似算法提供了比标准技术更好的解决方案,并在许多情况下提供准确的MAP估计。

英文摘要:

MAP is the problem of finding a most probable instantiation of a set of variables given evidence. MAP has always been perceived to be significantly harder than the related problems of computing the probability of a variable instantiation Pr, or the problem of computing the most probable explanation (MPE). This paper investigates the complexity of MAP in Bayesian networks. Specifically, we show that MAP is complete for NP^PP and provide further negative complexity results for algorithms based on variable elimination. We also show that MAP remains hard even when MPE and Pr become easy. For example, we show that MAP is NP-complete when the networks are restricted to polytrees, and even then can not be effectively approximated. Given the difficulty of computing MAP exactly, and the difficulty of approximating MAP while providing useful guarantees on the resulting approximation, we investigate best effort approximations. We introduce a generic MAP approximation framework. We provide two instantiations of the framework; one for networks which are amenable to exact inference Pr, and one for networks for which even exact inference is too hard. This allows MAP approximation on networks that are too complex to even exactly solve the easier problems, Pr and MPE. Experimental results indicate that using these approximation algorithms provides much better solutions than standard techniques, and provide accurate MAP estimates in many cases.

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

↑