arrow
Return

The YODO algorithm: An efficient computational framework for sensitivity analysis in Bayesian networks

delete2023-08-01
delete2
delete
OA
AI
R
Rafael Ballester‐Ripoll *
M
Manuele Leonelli
DOI:10.1016/j.ijar.2023.108929delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Sensitivity analysis measures the influence of a Bayesian network's parameters on a quantity of interest defined by the network, such as the probability of a variable taking a specific value. In the literature, this influence is often measured by computing the partial derivative with respect to the network parameters. However, this can become computationally expensive in large networks with thousands of parameters. We propose an algorithm combining automatic differentiation and exact inference to calculate the sensitivity measures in a single pass efficiently. It first marginalizes the whole network once, using e.g. variable elimination, and then backpropagates this operation to obtain the gradient with respect to all input parameters. Our method can be used for one-way and multi-way sensitivity analysis and the derivation of admissible regions. Simulation studies highlight the efficiency of our algorithm by scaling it to massive networks with up to 100,000 parameters and investigate the feasibility of generic multi-way analyses. Our routines are also showcased over two medium-sized Bayesian networks: the first modeling the country risks of a humanitarian crisis, the second studying the relationship between the use of technology and the psychological effects of forced social isolation during the COVID-19 pandemic. An implementation of the methods using the popular machine learning library PyTorch is freely available. (c) 2023 Elsevier Inc. All rights reserved.
Keywords:
Automatic differentiation
Bayesian networks
COVID-19
PyTorch
Sensitivity analysis
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

International Journal of Approximate Reasoning cover
International Journal of Approximate Reasoning
IF:
3
Papers:
3.0K
Citations:
5.1K

Organization

IE University cover
IE University
Scholars:
400
Papers: 598
Citations: 1.3K
Cited Papers

Cited Papers

Discrete Bayesian Network Classifiers: A Survey
err2014-07-14
err198
errOAAI
errBielza, Concha; Larranaga, Pedro
errShare
errSave
Computing Sobol indices in probabilistic graphical models
err2022-09-01
err10
PREAI
errBallester-Ripoll, Rafael; Leonelli, Manuele
errShare
errSave
errShare
errSave
Conditional independence and chain event graphs
err2008-01-01
err68
errOAAI
errSmith, Jim Q.; Anderson, Paul E.
errShare
errSave
errShare
errSave
researcher View more