Improving Bound Propagation

Authors:
Bozhena Bidyuk;Rina Dechter
Affiliations:
Donald Bren School of Information and Computer Science, University Of California Irvine, CA 92697-3425, USA, email: bbidyuk@ics.uci.edu;email: dechter@ics.uci.edu
Venue:
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Year:
2006

Citing 12
Cited 2

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Approximating probabilistic inference in Bayesian belief networks is NP-hard

Artificial Intelligence
Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks

Artificial Intelligence
Approximating MAPs for belief networks is NP-hard and other theorems

Artificial Intelligence
Inference in multilayer networks via large deviation bounds

Proceedings of the 1998 conference on Advances in neural information processing systems II
Introduction to Algorithms

Introduction to Algorithms
Probability Bounds for Goal Directed Queries in Bayesian Networks

IEEE Transactions on Knowledge and Data Engineering
An anytime scheme for bounding posterior beliefs

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Bound propagation

Journal of Artificial Intelligence Research
Large deviation methods for approximate probabilistic inference

UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Context-specific approximation in probabilistic inference

UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Approximate Decomposition: a method for bounding and estimating probabilistic and deterministic queries

UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence

An anytime scheme for bounding posterior beliefs

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Active tuples-based scheme for bounding posterior beliefs

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the bound propagation scheme by taking advantage of the directionality in Bayesian networks and applying the notion of relevant subnetwork. We also propose an approximation scheme for the linear optimization subproblems. We demonstrate empirically that while the resulting bounds loose some precision, we achieve 10-100 times speedup compared to original bound propagation using a simplex solver.