Structured Message Passing
Vibhav Gogate, Pedro Domingos

TL;DR
This paper introduces structured message passing (SMP), a unifying framework for approximate inference that leverages structured representations to improve efficiency and accuracy over traditional methods.
Contribution
The paper proposes a novel class of approximate inference algorithms using structured representations, unifying and extending existing algorithms like belief propagation and expectation propagation.
Findings
More accurate than state-of-the-art techniques
More scalable in large models
Exploits context-specific independence and determinism
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Machine Learning and Algorithms · Error Correcting Code Techniques
