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

利用一阶MPE中的均匀分布

Exploiting Uniform Assignments in First-Order MPE

Ben-Gurion University of The Negev(内盖夫本-古里安大学)

Udi Apsel, Ronen I. Brafman

摘要:

MPE(Most Probable Explanation)查询在概率推理中起着重要的作用。概率关系模型的MPE求解算法本质上是对现有的置信度评估方法的改进,用最大化代替求和。但是,关系模型所捕获的丰富的结构和对称性以及最大化运算符的属性提供了一个额外简化的机会,具有潜在的重要计算后果。具体而言,这些模型通常具有定义某些公式总体上的对称分布的变量组。这个组中不同元素的最大化选择是相同的。如果我们能够提前意识到这一点,我们就可以通过消除潜在的大部分随机变量来显著减小模型的大小。本文定义了均匀分配和部分均匀分配的变量集的概念,展示了如何有效地识别这些集合,以及一旦我们识别它们,模型如何可以大大简化,只需很少的计算工作。我们证明了这些想法的有效性经验上的一些模型。

英文摘要:

The MPE (Most Probable Explanation) query plays an important role in probabilistic inference. MPE solution algorithms for probabilistic relational models essentially adapt existing belief assessment method, replacing summation with maximization. But the rich structure and symmetries captured by relational models together with the properties of the maximization operator offer an opportunity for additional simplification with potentially significant computational ramifications. Specifically, these models often have groups of variables that define symmetric distributions over some population of formulas. The maximizing choice for different elements of this group is the same. If we can realize this ahead of time, we can significantly reduce the size of the model by eliminating a potentially significant portion of random variables. This paper defines the notion of uniformly assigned and partially uniformly assigned sets of variables, shows how one can recognize these sets efficiently, and how the model can be greatly simplified once we recognize them, with little computational effort. We demonstrate the effectiveness of these ideas empirically on a number of models.

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

↑