Model-Preserving Sensitivity Analysis for Families of Gaussian Distributions
Not on the map. Why?
Abstract (arXiv)
The accuracy of probability distributions inferred using machine-learning algorithms heavily depends on data availability and quality. In practical applications it is therefore fundamental to investigate the robustness of a statistical model to misspecification of some of its underlying probabilities. In the context of graphical models, investigations of robustness fall under the notion of sensitivity analyses. These analyses consist in varying some of the model's probabilities or parameters and then assessing how far apart the original and the varied distributions are. However, for Gaussian graphical models, such variations usually make the original graph an incoherent representation of the model's conditional independence structure. Here we develop an approach to sensitivity analysis which guarantees the original graph remains valid after any probability variation and we quantify the effect of such variations using different measures. To achieve this we take advantage of algebraic techniques to both concisely represent conditional independence and to provide a straightforward way of checking the validity of such relationships. Our methods are demonstrated to be robust and comparable to standard ones, which break the conditional independence structure of the model, using an artificial example and a medical real-world application.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 27 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 1; 2024: 0; 2025: 0; 2026: 1.
4 papers.
- 2021Sensitivity and robustness analysis in Bayesian networks with the bnmonitor R packagecited by 8
- 2021Staged trees and asymmetry-labeled DAGscited by 8
- 2026Linear-LLM-SCM: Benchmarking LLMs for Coefficient Elicitation in Linear-Gaussian Causal Modelscited by 1
- 2023Entropy and the Kullback-Leibler Divergence for Bayesian Networks: Computational Complexity and Efficient Implementationcited by 0
- 2026Linear-LLM-SCM: Benchmarking LLMs for Coefficient Elicitation in Linear-Gaussian Causal Models10 Feb 2026
- 2023Entropy and the Kullback-Leibler Divergence for Bayesian Networks: Computational Complexity and Efficient Implementation29 Nov 2023
- 2021Staged trees and asymmetry-labeled DAGs4 Aug 2021
- 2021Sensitivity and robustness analysis in Bayesian networks with the bnmonitor R package25 Jul 2021