Iterative Join-Graph Propagation

by   Rina Dechter, et al.

The paper presents an iterative version of join-tree clustering that applies the message passing of join-tree clustering algorithm to join-graphs rather than to join-trees, iteratively. It is inspired by the success of Pearl's belief propagation algorithm as an iterative approximation scheme on one hand, and by a recently introduced mini-clustering i. success as an anytime approximation method, on the other. The proposed Iterative Join-graph Propagation IJGP belongs to the class of generalized belief propagation methods, recently proposed using analogy with algorithms in statistical physics. Empirical evaluation of this approach on a number of problem classes demonstrates that even the most time-efficient variant is almost always superior to IBP and MC i, and is sometimes more accurate by as much as several orders of magnitude.


page 1

page 2

page 3

page 4


Join-Graph Propagation Algorithms

The paper investigates parameterized approximate message-passing schemes...

Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding

It was recently shown that the problem of decoding messages transmitted ...

Merging Belief Propagation and the Mean Field Approximation: A Free Energy Approach

We present a joint message passing approach that combines belief propaga...

Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation

The analysis of Belief Propagation and other algorithms for the reconst...

A Logical Model for joining Property Graphs

The present paper upgrades the logical model required to exploit materia...

Joins on Samples: A Theoretical Guide for Practitioners

Despite decades of research on approximate query processing (AQP), our u...

Join-graph based cost-shifting schemes

We develop several algorithms taking advantage of two common approaches ...