Active Tuples-based Scheme for Bounding Posterior Beliefs

by   Bozhena Bidyuk, et al.

The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any available scheme that bounds the probability of evidence or posterior marginals and enhance its performance in an anytime manner. The scheme uses the cutset conditioning principle to tighten existing bounding schemes and to facilitate anytime behavior, utilizing a fixed number of cutset tuples. The accuracy of the bounds improves as the number of used cutset tuples increases and so does the computation time. We demonstrate empirically the value of our scheme for bounding posterior marginals and probability of evidence using a variant of the bound propagation algorithm as a plug-in scheme.


page 1

page 2

page 3

page 4


Discrete Bayesian Networks: The Exact Posterior Marginal Distributions

In a Bayesian network, we wish to evaluate the marginal probability of a...

Cutset Sampling for Bayesian Networks

The paper presents a new sampling methodology for Bayesian networks that...

Guaranteed Bounds for Posterior Inference in Universal Probabilistic Programming

We propose a new method to approximate the posterior distribution of pro...

Using Qualitative Relationships for Bounding Probability Distributions

We exploit qualitative probabilistic relationships among variables for c...

Generalizing Jeffrey Conditionalization

Jeffrey's rule has been generalized by Wagner to the case in which new e...

Unforeseen Evidence

I proposes a normative updating rule, extended Bayesianism, for the inco...

Inferring the prior in routing games using public signalling

This paper considers Bayesian persuasion for routing games where informa...