Active Tuples-based Scheme for Bounding Posterior Beliefs
arXiv:1401.3833 · doi:10.1613/jair.2945
Abstract
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.
References in corpus (7)
- A Sufficiently Fast Algorithm for Finding Close to Optimal Junction Trees
- Large Deviation Methods for Approximate Probabilistic Inference
- Bound Propagation
- Context-Specific Approximation in Probabilistic Inference
- An Empirical Study of w-Cutset Sampling for Bayesian Networks
- Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
- Active Tuples-based Scheme for Bounding Posterior Beliefs