Making Sensitivity Analysis Computationally Efficient

Abstract

To investigate the robustness of the output probabilities of a Bayesian network, a sensitivity analysis can be performed. A one-way sensitivity analysis establishes, for each of the probability parameters of a network, a function expressing a posterior marginal probability of interest in terms of the parameter. Current methods for computing the coefficients in such a function rely on a large number of network evaluations. In this paper, we present a method that requires just a single outward propagation in a junction tree for establishing the coefficients in the functions for all possible parameters; in addition, an inward propagation is required for processing evidence. Conversely, the method requires a single outward propagation for computing the coefficients in the functions expressing all possible posterior marginals in terms of a single parameter. We extend these results to an n-way sensitivity analysis in which sets of parameters are studied.

Appears in Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence (UAI2000)

References in corpus (1)

• Why Is Diagnosis Using Belief Networks Insensitive to Imprecision In Probabilities?

Cited by in corpus (8)

• When do Numbers Really Matter?
• Analysing Sensitivity Data from Probabilistic Networks
• On the Robustness of Most Probable Explanations
• Sensitivity analysis in decision circuits
• The Computational Complexity of Sensitivity Analysis and Parameter Tuning
• Three new sensitivity analysis methods for influence diagrams
• When do Numbers Really Matter?
• Lower Bound Bayesian Networks - An Efficient Inference of Lower Bounds on Probability Distributions in Bayesian Networks