Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative

The problems of generating candidate hypotheses and inferring the best hypothesis out of this set are typically seen as two distinct aspects of the more general problem of non-demonstrative inference or abduction. In the context of Bayesian networks the latter problem (computing most probable explanations) is well understood, while the former problem is typically left as an exercise to the modeler. In other words, the candidate hypotheses are pre-selected and hard-coded. In reality, however, non-demonstrative inference is rather an interactive process, switching between hypothesis generation, inference to the best explanation, evidence gathering and deciding which information is relevant. In this paper we will discuss a possible computational formalization of finding an explanation which is both probable and as informative as possible, thereby combining (at least some aspects of) both the 'hypotheses-generating' and 'inference' steps of the abduction process. The computational complexity of this formal problem, denoted Most Inforbable Explanation, is then established and some problem parameters are investigated in order to get a deeper understanding of what makes this problem intractable in general, and under which circumstances the problem becomes tractable.

[1]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[2]  Peter Lipton,et al.  Inference to the best explanation , 1993 .

[3]  Adnan Darwiche,et al.  Solving MAP Exactly using Systematic Search , 2002, UAI.

[4]  Johan Kwisthout,et al.  Structure Approximation of Most Probable Explanations in Bayesian Networks , 2013, ECSQARU.

[5]  J. Kwisthout,et al.  The Computational Complexity of Probabilistic Networks , 2009 .

[6]  Carmen Lacave,et al.  A review of explanation methods for Bayesian networks , 2002, The Knowledge Engineering Review.

[7]  K. Jon Barwise,et al.  Information and Impossibilities , 1997, Notre Dame J. Formal Log..

[8]  Changhe Yuan,et al.  Annealed MAP , 2004, UAI.

[9]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[10]  José A. Gámez,et al.  Partial abductive inference in Bayesian belief networks by simulated annealing , 2001, Int. J. Approx. Reason..

[11]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[12]  David A. Nardone,et al.  Collecting and Analyzing Data: Doing and Thinking , 1990 .

[13]  Solomon Eyal Shimony,et al.  Cost-Based Abduction and MAP Explanation , 1994, Artif. Intell..

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  José A. Gámez,et al.  Simplifying Explanations in Bayesian Belief Networks , 2001, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[16]  Cassio Polpo de Campos Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence New Complexity Results for MAP in Bayesian Networks , 2022 .

[17]  Finn V. Jensen,et al.  Bayesian Networks and Decision Graphs , 2001, Statistics for Engineering and Information Science.

[18]  Johan Kwisthout,et al.  Most probable explanations in Bayesian networks: Complexity and tractability , 2011, Int. J. Approx. Reason..

[19]  Adnan Darwiche,et al.  Approximating MAP using Local Search , 2001, UAI.

[20]  Adnan Darwiche,et al.  Modeling and Reasoning with Bayesian Networks , 2009 .

[21]  A. Darwiche,et al.  Complexity Results and Approximation Strategies for MAP Explanations , 2011, J. Artif. Intell. Res..

[22]  José A. Gámez,et al.  Partial abductive inference in Bayesian belief networks using a genetic algorithm , 1999, Pattern Recognit. Lett..

[23]  J. Kwisthout The Computational Complexity of Probabilistic Inference Technical Report , 2011 .

[24]  Linda C. van der Gaag,et al.  On the Complexity of the MPA Problem in Probabilistic Networks , 2002, ECAI.

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

[26]  David H. Glass,et al.  Inference to the Best Explanation: a comparison of approaches , 2009 .