Finding Non-overlapping Clusters for Generalized Inference Over Graphical Models

07/20/2011
by   Divyanshu Vats, et al.
0

Graphical models use graphs to compactly capture stochastic dependencies amongst a collection of random variables. Inference over graphical models corresponds to finding marginal probability distributions given joint probability distributions. In general, this is computationally intractable, which has led to a quest for finding efficient approximate inference algorithms. We propose a framework for generalized inference over graphical models that can be used as a wrapper for improving the estimates of approximate inference algorithms. Instead of applying an inference algorithm to the original graph, we apply the inference algorithm to a block-graph, defined as a graph in which the nodes are non-overlapping clusters of nodes from the original graph. This results in marginal estimates of a cluster of nodes, which we further marginalize to get the marginal estimates of each node. Our proposed block-graph construction algorithm is simple, efficient, and motivated by the observation that approximate inference is more accurate on graphs with longer cycles. We present extensive numerical simulations that illustrate our block-graph framework with a variety of inference algorithms (e.g., those in the libDAI software package). These simulations show the improvements provided by our framework.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/21/2020

Rigorous Explanation of Inference on Probabilistic Graphical Models

Probabilistic graphical models, such as Markov random fields (MRF), expl...
research
07/09/2020

Adversarially-learned Inference via an Ensemble of Discrete Undirected Graphical Models

Undirected graphical models are compact representations of joint probabi...
research
02/03/2015

Learning Planar Ising Models

Inference and learning of graphical models are both well-studied problem...
research
06/13/2012

Adaptive Inference on General Graphical Models

Many algorithms and applications involve repeatedly solving variations o...
research
07/11/2012

Variational Chernoff Bounds for Graphical Models

Recent research has made significant progress on the problem of bounding...
research
06/24/2011

Bound Propagation

In this article we present an algorithm to compute bounds on the margina...
research
02/03/2020

Soft Random Graphs in Probabilistic Metric Spaces Inter-graph Distance

We present a new method for learning Soft Random Geometric Graphs (SRGGs...

Please sign up or login with your details

Forgot password? Click here to reset