Hybrid algorithms for approximate belief updating in Bayes nets

Abstract Belief updating in Bayes nets, a well-known computationally hard problem, has recently been approximated by several deterministic algorithms and by various randomized approximation algorithms. Deterministic algorithms usually provide probability bounds, but have an exponential runtime. Some randomized schemes have a polynomial runtime, but provide only probability estimates. Randomized algorithms that accumulate high-probability partial instantiations, resulting in probability bounds, are presented. Some of these algorithms are also sampling algorithms. Specifically, a variant of backward sampling, used both as a sampling algorithm and as a randomized enumeration algorithm, is introduced and evaluated. An implicit assumption made in prior work, for both sampling and accumulation algorithms, that query nodes must be instantiated in all the samples, is relaxed. Genetic algorithms can be used as an alternate search component for high-probability instantiations; several methods of applying them to belief updating are presented.

[1]  Michael P. Wellman,et al.  State-Space Abstraction for Anytime Evaluation of Probabilistic Networks , 1994, UAI.

[2]  Robert M. Fung,et al.  Backward Simulation in Bayesian Networks , 1994, UAI.

[3]  Gary B. Lamont,et al.  Comparison of Parallel Messy Genetic Algorithm Data Distribution Strategies , 1993, ICGA.

[4]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[5]  Ross D. Shachter.  Evaluating Influence Diagrams , 1986, Oper. Res..

[6]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[7]  Mark A. Kramer,et al.  GALGO: A Genetic ALGOrithm Decision Support Tool for Complex Uncertain Systems Modeled with Bayesian Belief Networks , 1993, UAI.

[8]  Solomon Eyal Shimony.  Explanation, Irrelevance, and Statistical Independence , 1991, AAAI.

[9]  Malcolm Pradhan,et al.  Optimal Monte Carlo Estimation of Belief Network Inference , 1996, UAI.

[10]  Michael Luby,et al.  Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard , 1993, Artif. Intell..

[11]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[12]  David Poole,et al.  Probabilistic Horn Abduction and Bayesian Networks , 1993, Artif. Intell..

[13]  David Heckerman,et al.  A New Look at Causal Independence , 1994, UAI.

[14]  Uffe Kjærulff,et al.  Reduction of Computational Complexity in Bayesian Networks Through Removal of Weak Dependences , 1994, UAI.

[15]  Craig Boutilier,et al.  Context-Specific Independence in Bayesian Networks , 1996, UAI.

[16]  Gregory F. Cooper,et al.  The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..

[17]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[18]  R. Martin Chavez,et al.  Approximating Probabilistic Inference in Bayesian Belief Networks , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Eugene Santos,et al.  Sample-and-Accumulate Algorithms for Belief Updating in Bayes Networks , 1996, UAI.

[20]  Solomon Eyal Shimony,et al.  The role of relevance in explanation I: Irrelevance as statistical independence , 1993, Int. J. Approx. Reason..

[21]  Solomon Eyal Shimony,et al.  Algorithms for Parsimonious Complete Sets in Directed Graphs , 1996, Inf. Process. Lett..

[22]  Marek J. Druzdzel,et al.  Some Properties of joint Probability Distributions , 1994, UAI.

[23]  Robert L. Welch,et al.  Real Time Estimation of Bayesian Networks , 1996, UAI.

[24]  John A. Miller,et al.  An evaluation of local improvement operators for genetic algorithms , 1993, IEEE Trans. Syst. Man Cybern..

[25]  Eric Horvitz,et al.  Bounded Conditioning: Flexible Inference for Decisions under Scarce Resources , 2013, UAI 1989.

[26]  Remco R. Bouckaert,et al.  A Stratified Simulation Scheme for Inference in Bayesian Belief Networks , 1994, UAI.

[27]  Eugene Santos,et al.  Exploiting case-based independence for approximating marginal probabilities , 1996, Int. J. Approx. Reason..

[28]  Solomon Eyal Shimony,et al.  Finding MAPs for Belief Networks is NP-Hard , 1994, Artif. Intell..

[29]  Eugene Santos,et al.  Belief Updating by Enumerating High-Probability Independence-based Assignments , 1994, UAI.

[30]  Bruce D'Ambrosio,et al.  Incremental Probabilistic Inference , 1993, UAI.

[31]  David Poole,et al.  The use of conflicts in searching Bayesian networks , 1993, UAI.

[32]  Max Henrion,et al.  Propagating uncertainty in bayesian networks by probabilistic logic sampling , 1986, UAI.