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

结构化消息传递

Structured Message Passing

The University of Texas at Dallas(德克萨斯大学达拉斯分校);University of Washington(华盛顿大学)

Vibhav Gogate, Pedro Domingos

摘要:

在本文中,我们提出了结构化的消息传递(SMP),一个统一的框架,近似推理算法,利用结构化的表示,如代数决策图和稀疏哈希表。当消息在其范围内具有几个相同的值(上下文特定的独立性)或零(确定性)或两者时,这些表示可以比传统的表格表示产生显著的时间和空间节省。因此,为了充分利用结构化表示的力量,我们建议在消息中人为地引入上下文特定的独立性和确定性。这产生了一类新的强大的近似推理算法,其中包括流行的算法,如聚类图的信念传播(BP),期望传播和粒子BP作为特殊情况。我们表明,我们的新算法引入了几个有趣的偏差方差权衡。我们根据经验评估这些权衡,并证明我们的新算法比最先进的技术更准确和可扩展。

英文摘要:

In this paper, we present structured message passing (SMP), a unifying framework for approximate inference algorithms that take advantage of structured representations such as algebraic decision diagrams and sparse hash tables. These representations can yield significant time and space savings over the conventional tabular representation when the message has several identical values (context-specific independence) or zeros (determinism) or both in its range. Therefore, in order to fully exploit the power of structured representations, we propose to artificially introduce context-specific independence and determinism in the messages. This yields a new class of powerful approximate inference algorithms which includes popular algorithms such as cluster-graph Belief propagation (BP), expectation propagation and particle BP as special cases. We show that our new algorithms introduce several interesting bias-variance trade-offs. We evaluate these trade-offs empirically and demonstrate that our new algorithms are more accurate and scalable than state-of-the-art techniques.

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

↑