An information geometry approach for robustness analysis in uncertainty quantification of computer codes
Clement Gauchy (CEA-DES (ex-DEN), EDF R&D PRISME), Jerome Stenger (EDF, R&D PRISME, IMT), Roman Sueur (EDF R&D PRISME), Bertrand Iooss (EDF R&D, IMT,, GdR MASCOT-NUM)

TL;DR
This paper introduces a rigorous information geometry-based method for perturbing probability distributions to analyze the robustness of computer models under uncertain inputs, demonstrated through numerical and industrial case studies.
Contribution
It proposes a novel Fisher distance-based approach for perturbing distributions in uncertainty quantification, enabling more coherent robustness analysis.
Findings
The method effectively computes perturbed densities using differential equations.
Perturbed-Law sensitivity indices provide insights into model robustness.
Application to nuclear safety demonstrates practical utility.
Abstract
Robustness analysis is an emerging field in the domain of uncertainty quantification. It consists of analysing the response of a computer model with uncertain inputs to the perturbation of one or several of its input distributions. Thus, a practical robustness analysis methodology should rely on a coherent definition of a distribution perturbation. This paper addresses this issue by exposing a rigorous way of perturbing densities. The proposed methodology is based the Fisher distance on manifolds of probability distributions. A numerical method to calculate perturbed densities in practice is presented. This method comes from Lagrangian mechanics and consists of solving an ordinary differential equations system. This perturbation definition is then used to compute quantile-oriented robustness indices. The resulting Perturbed-Law based sensitivity Indices (PLI) are illustrated on several…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
