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

关于大多数概然证明的鲁棒性

On the Robustness of Most Probable Explanations

University of California, Los Angeles(加利福尼亚大学洛杉矶分校)

Hei Chan, Adnan Darwiche

摘要:

在贝叶斯网络中,最可能的解释(MPE)是一个完整的变量实例,具有最高的概率给定的当前证据。在本文中,我们讨论的问题,找到单参数变化下的MPE的鲁棒性条件。具体来说,我们提出这样一个问题:在保持MPE不变的情况下,我们可以承受单个网络参数的多大变化?我们将描述一个过程,这是第一次,它在时间O(n exp(w))内计算贝叶斯网络变量中每个参数的答案,其中n是网络变量的数量,w是它的树宽。

英文摘要:

In Bayesian networks, a Most Probable Explanation (MPE) is a complete variable instantiation with a highest probability given the current evidence. In this paper, we discuss the problem of finding robustness conditions of the MPE under single parameter changes. Specifically, we ask the question: How much change in a single network parameter can we afford to apply while keeping the MPE unchanged? We will describe a procedure, which is the first of its kind, that computes this answer for each parameter in the Bayesian network variable in time O(n exp(w)), where n is the number of network variables and w is its treewidth.

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

↑