DeepAI AI Chat
Log In Sign Up

Generalized Belief Propagation on Tree Robust Structured Region Graphs

by   Andrew E. Gelfand, et al.

This paper provides some new guidance in the construction of region graphs for Generalized Belief Propagation (GBP). We connect the problem of choosing the outer regions of a LoopStructured Region Graph (SRG) to that of finding a fundamental cycle basis of the corresponding Markov network. We also define a new class of tree-robust Loop-SRG for which GBP on any induced (spanning) tree of the Markov network, obtained by setting to zero the off-tree interactions, is exact. This class of SRG is then mapped to an equivalent class of tree-robust cycle bases on the Markov network. We show that a treerobust cycle basis can be identified by proving that for every subset of cycles, the graph obtained from the edges that participate in a single cycle only, is multiply connected. Using this we identify two classes of tree-robust cycle bases: planar cycle bases and "star" cycle bases. In experiments we show that tree-robustness can be successfully exploited as a design principle to improve the accuracy and convergence of GBP.


page 1

page 2

page 3

page 4


A new proof of Grinberg Theorem based on cycle bases

Grinberg Theorem, a necessary condition only for planar Hamiltonian grap...

Minimum Spanning Tree Cycle Intersection Problem

Consider a connected graph G and let T be a spanning tree of G. Every ed...

Feasible bases for a polytope related to the Hamilton cycle problem

We study a certain polytope depending on a graph G and a parameter β∈(0,...

Sparse Kneser graphs are Hamiltonian

For integers k≥ 1 and n≥ 2k+1, the Kneser graph K(n,k) is the graph whos...

A new constraint of the Hamilton cycle algorithm

Grinberg's theorem is a necessary condition for the planar Hamilton grap...

Three aspects of the MSTCI problem

Consider a connected graph G and let T be a spanning tree of G. Every ed...

Tri-Partitions and Bases of an Ordered Complex

Generalizing the decomposition of a connected planar graph into a tree a...