Lifted Region-Based Belief Propagation

by   David Smith, et al.

Due to the intractable nature of exact lifted inference, research has recently focused on the discovery of accurate and efficient approximate inference algorithms in Statistical Relational Models (SRMs), such as Lifted First-Order Belief Propagation. FOBP simulates propositional factor graph belief propagation without constructing the ground factor graph by identifying and lifting over redundant message computations. In this work, we propose a generalization of FOBP called Lifted Generalized Belief Propagation, in which both the region structure and the message structure can be lifted. This approach allows more of the inference to be performed intra-region (in the exact inference step of BP), thereby allowing simulation of propagation on a graph structure with larger region scopes and fewer edges, while still maintaining tractability. We demonstrate that the resulting algorithm converges in fewer iterations to more accurate results on a variety of SRMs.


Convergence of Generalized Belief Propagation Algorithm on Graphs with Motifs

Belief propagation is a fundamental message-passing algorithm for numero...

Join-Graph Propagation Algorithms

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

Lifted Relax, Compensate and then Recover: From Approximate to Exact Lifted Probabilistic Inference

We propose an approach to lifted approximate inference for first-order p...

Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching

A recent paper CaeCaeSchBar06 proposed a provably optimal, polynomial ti...

On the Choice of Regions for Generalized Belief Propagation

Generalized belief propagation (GBP) has proven to be a promising techni...

Scene Grammars, Factor Graphs, and Belief Propagation

We consider a class of probabilistic grammars for generating scenes with...

Discrete Independent Component Analysis (DICA) with Belief Propagation

We apply belief propagation to a Bayesian bipartite graph composed of di...