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

任意空间概率推理

Any-Space Probabilistic Inference

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

Adnan Darwiche

摘要:

我们最近介绍了一种用于贝叶斯网络精确推理的任意空间算法,称为递归条件反射,RC,它允许以X字节为增量交换空间和时间,其中X是缓存浮点数所需的字节数。在本文中,我们提出了RC的三个关键扩展。首先,我们修改算法,使其适用于更一般的概率分布的因子分解,包括(但不限于)贝叶斯网络因子分解。其次,我们提出了一种遗忘机制,大大降低了RC的空间需求,然后比较这些requirmenets与变量消除在一些现实的网络,在某些情况下,显示数量级的改善。第三,我们提出了一个版本的RC计算最大后验假设(MAP),这原来是第一个MAP算法允许一个平滑的时间-空间权衡。提出的MAP算法的一个关键优点是,它不必从头开始每次提出一个新的查询,但可以重用它的一些计算跨多个查询,从而在某些情况下显着节省。

英文摘要:

We have recently introduced an any-space algorithm for exact inference in Bayesian networks, called Recursive Conditioning, RC, which allows one to trade space with time at increments of X-bytes, where X is the number of bytes needed to cache a floating point number. In this paper, we present three key extensions of RC. First, we modify the algorithm so it applies to more general factorization of probability distributions, including (but not limited to) Bayesian network factorizations. Second, we present a forgetting mechanism which reduces the space requirements of RC considerably and then compare such requirmenets with those of variable elimination on a number of realistic networks, showing orders of magnitude improvements in certain cases. Third, we present a version of RC for computing maximum a posteriori hypotheses (MAP), which turns out to be the first MAP algorithm allowing a smooth time-space tradeoff. A key advantage of presented MAP algorithm is that it does not have to start from scratch each time a new query is presented, but can reuse some of its computations across multiple queries, leading to significant savings in ceratain cases.

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

↑