arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1501.01239cs.AIstat.ML
收藏

和积网络与贝叶斯网络的关系

On the Relationship between Sum-Product Networks and Bayesian Networks

University of Waterloo(滑铁卢大学)

Han Zhao, Mazen Melibari, Pascal Poupart

摘要:

在本文中,我们建立了和积网络(SPN)和贝叶斯网络(BN)之间的一些理论联系。我们证明,每个SPN可以转换成BN在线性时间和空间的网络规模。关键的洞察力是使用代数决策图(ADD),通过利用上下文特定的独立性(CSI),在所得到的BN中的每个节点上的局部条件概率分布。生成的BN具有简单的有向二部图结构。我们表明,通过应用变量消除算法(VE)生成的BN与ADD表示,我们可以恢复原始SPN的SPN可以被视为一个历史记录或缓存的VE推理过程。为了帮助国家的证明清楚,我们引入了{ \em正常} SPN的概念,并提出了一个理论分析的一致性和可分解性。最后,我们的文件与一些讨论的影响的证明,并建立一个连接的深度之间的SPN和其相应的BN的树宽度的下限。

英文摘要:

In this paper, we establish some theoretical connections between Sum-Product Networks (SPNs) and Bayesian Networks (BNs). We prove that every SPN can be converted into a BN in linear time and space in terms of the network size. The key insight is to use Algebraic Decision Diagrams (ADDs) to compactly represent the local conditional probability distributions at each node in the resulting BN by exploiting context-specific independence (CSI). The generated BN has a simple directed bipartite graphical structure. We show that by applying the Variable Elimination algorithm (VE) to the generated BN with ADD representations, we can recover the original SPN where the SPN can be viewed as a history record or caching of the VE inference process. To help state the proof clearly, we introduce the notion of {\em normal} SPN and present a theoretical analysis of the consistency and decomposability properties. We conclude the paper with some discussion of the implications of the proof and establish a connection between the depth of an SPN and a lower bound of the tree-width of its corresponding BN.

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

↑