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

查询DAG:一种实现信念网络推理的实用范式

Query DAGs: A Practical Paradigm for Implementing Belief Network Inference

Rockwell Science Center(罗克韦尔科学中心)

Adnan Darwiche, Gregory M. Provan

摘要:

我们描述了一个新的范例,用于实现推理的信念网络,它依赖于编译一个信念网络到一个算术表达式称为查询DAG(Q-DAG)。Q-DAG的每个非叶节点表示一个数值运算、一个数字或一个符号作为证据。Q-DAG的每个叶节点代表网络查询的答案,即某些感兴趣事件的概率。看来,Q-DAG可以使用任何算法在信念网络中进行精确推理-我们展示了如何使用聚类和条件算法生成它们。Q-DAG生成算法的时间和空间复杂度并不比它所基于的推理算法的时间复杂度差; Q-DAG在线评估算法的时间复杂度在Q-DAG的大小上是线性的,并且这样的推理相当于它所表示的算术表达式的标准评估。Q-DAG的主要价值在于减少了在在线、真实世界应用中利用信念网络所需的软件和硬件资源。所提出的框架还有利于开发在线推理在不同的软件和硬件平台上,给出了简单的Q-DAG评估算法。本文描述了这种新的概率推理范式,解释了它是如何工作的,它的用途,并概述了它导致的一些研究方向。

英文摘要:

We describe a new paradigm for implementing inference in belief networks, which relies on compiling a belief network into an arithmetic expression called a Query DAG (Q-DAG). Each non-leaf node of a Q-DAG represents a numeric operation, a number, or a symbol for evidence. Each leaf node of a Q-DAG represents the answer to a network query, that is, the probability of some event of interest. It appears that Q-DAGs can be generated using any of the algorithms for exact inference in belief networks --- we show how they can be generated using clustering and conditioning algorithms. The time and space complexity of a Q-DAG generation algorithm is no worse than the time complexity of the inference algorithm on which it is based; that of a Q-DAG on-line evaluation algorithm is linear in the size of the Q-DAG, and such inference amounts to a standard evaluation of the arithmetic expression it represents. The main value of Q-DAGs is in reducing the software and hardware resources required to utilize belief networks in on-line, real-world applications. The proposed framework also facilitates the development of on-line inference on different software and hardware platforms, given the simplicity of the Q-DAG evaluation algorithm. This paper describes this new paradigm for probabilistic inference, explaining how it works, its uses, and outlines some of the research directions that it leads to.

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

↑