Motivating explanations in Bayesian networks using MAP-independence

TL;DR

This paper introduces MAP-independence in Bayesian networks to enhance explanation and justification of diagnoses, addressing the gap between black-box inference and user understanding, with formalization and complexity analysis.

Contribution

It proposes the novel concept of MAP-independence for better explanations in Bayesian networks and formalizes related computational problems with complexity assessments.

Findings

MAP-independence captures variable relevance in explanations

Formalization of computational problems related to MAP-independence

Complexity analysis of the introduced problems

Abstract

In decision support systems the motivation and justification of the system's diagnosis or classification is crucial for the acceptance of the system by the human user. In Bayesian networks a diagnosis or classification is typically formalized as the computation of the most probable joint value assignment to the hypothesis variables, given the observed values of the evidence variables (generally known as the MAP problem). While solving the MAP problem gives the most probable explanation of the evidence, the computation is a black box as far as the human user is concerned and it does not give additional insights that allow the user to appreciate and accept the decision. For example, a user might want to know to whether an unobserved variable could potentially (upon observation) impact the explanation, or whether it is irrelevant in this aspect. In this paper we introduce a new concept, MAP- independence, which tries to capture this notion of relevance, and explore its role towards a potential justification of an inference to the best explanation. We formalize several computational problems based on this concept and assess their computational complexity.