Bound Propagation

06/24/2011
by   B. Kappen, et al.
0

In this article we present an algorithm to compute bounds on the marginals of a graphical model. For several small clusters of nodes upper and lower bounds on the marginal values are computed independently of the rest of the network. The range of allowed probability distributions over the surrounding nodes is restricted using earlier computed bounds. As we will show, this can be considered as a set of constraints in a linear programming problem of which the objective function is the marginal probability of the center nodes. In this way knowledge about the maginals of neighbouring clusters is passed to other clusters thereby tightening the bounds on their marginals. We show that sharp bounds can be obtained for undirected and directed graphs that are used for practical applications, but for which exact computations are infeasible.

READ FULL TEXT

page 4

page 8

page 11

page 13

research
02/13/2013

Computing Upper and Lower Bounds on Likelihoods in Intractable Networks

We present deterministic techniques for computing upper and lower bounds...
research
02/13/2013

Propagation of 2-Monotone Lower Probabilities on an Undirected Graph

Lower and upper probabilities, also known as Choquet capacities, are wid...
research
07/20/2011

Finding Non-overlapping Clusters for Generalized Inference Over Graphical Models

Graphical models use graphs to compactly capture stochastic dependencies...
research
10/11/2021

Subnetwork Constraints for Tighter Upper Bounds and Exact Solution of the Clique Partitioning Problem

We consider a variant of the clustering problem for a complete weighted ...
research
06/09/2021

On Clusters that are Separated but Large

Given a set P of n points in ^d, consider the problem of computing k sub...
research
02/27/2013

Localized Partial Evaluation of Belief Networks

Most algorithms for propagating evidence through belief networks have be...
research
05/01/2020

Distributions of restricted rotation distances

Rotation distances measure the differences in structure between rooted o...

Please sign up or login with your details

Forgot password? Click here to reset