A new paradigm for global sensitivity analysis

• URL: http://arxiv.org/abs/2409.06271v1
• Date: Tue, 10 Sep 2024 07:20:51 GMT
• Title: A new paradigm for global sensitivity analysis
• Authors: Gildas Mazo,
• Abstract summary: Current theory of global sensitivity analysis is limited in scope-for instance, the analysis is limited to the output's variance. It is shown that these important problems are solved all at once by adopting a new paradigm.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: <div><p>Current theory of global sensitivity analysis, based on a nonlinear functional ANOVA decomposition of the random output, is limited in scope-for instance, the analysis is limited to the output's variance and the inputs have to be mutually independent-and leads to sensitivity indices the interpretation of which is not fully clear, especially interaction effects. Alternatively, sensitivity indices built for arbitrary user-defined importance measures have been proposed but a theory to define interactions in a systematic fashion and/or establish a decomposition of the total importance measure is still missing. It is shown that these important problems are solved all at once by adopting a new paradigm. By partitioning the inputs into those causing the change in the output and those which do not, arbitrary user-defined variability measures are identified with the outcomes of a factorial experiment at two levels, leading to all factorial effects without assuming any functional decomposition. To link various well-known sensitivity indices of the literature (Sobol indices and Shapley effects), weighted factorial effects are studied and utilized.</p></div>

Related papers

• Local Learning for Covariate Selection in Nonparametric Causal Effect Estimation with Latent Variables [13.12743473333296]
  Estimating causal effects from nonexperimental data is a fundamental problem in many fields of science. We propose a novel local learning approach for covariate selection in nonparametric causal effect estimation. We validate our algorithm through extensive experiments on both synthetic and real-world data.
  arXiv  Detail & Related papers  (2024-11-25T12:08:54Z)
• Global Sensitivity Analysis of Uncertain Parameters in Bayesian Networks [4.404496835736175]
  We propose to conduct global variance-based sensitivity analysis of $n$ parameters. Our method works by encoding the uncertainties as $n$ additional variables of the network. Last, we apply the method of Sobol to the resulting network to obtain $n$ global sensitivity indices.
  arXiv  Detail & Related papers  (2024-06-09T12:36:38Z)
• Causality Pursuit from Heterogeneous Environments via Neural Adversarial Invariance Learning [12.947265104477237]
  Pursuing causality from data is a fundamental problem in scientific discovery, treatment intervention, and transfer learning. The proposed Focused Adversial Invariant Regularization (FAIR) framework utilizes an innovative minimax optimization approach. It is shown that FAIR-NN can find the invariant variables and quasi-causal variables under a minimal identification condition.
  arXiv  Detail & Related papers  (2024-05-07T23:37:40Z)
• A Neural Framework for Generalized Causal Sensitivity Analysis [78.71545648682705]
  We propose NeuralCSA, a neural framework for causal sensitivity analysis. We provide theoretical guarantees that NeuralCSA is able to infer valid bounds on the causal query of interest.
  arXiv  Detail & Related papers  (2023-11-27T17:40:02Z)
• Towards stable real-world equation discovery with assessing differentiating quality influence [52.2980614912553]
  We propose alternatives to the commonly used finite differences-based method. We evaluate these methods in terms of applicability to problems, similar to the real ones, and their ability to ensure the convergence of equation discovery algorithms.
  arXiv  Detail & Related papers  (2023-11-09T23:32:06Z)
• Learning Linear Causal Representations from Interventions under General Nonlinear Mixing [52.66151568785088]
  We prove strong identifiability results given unknown single-node interventions without access to the intervention targets. This is the first instance of causal identifiability from non-paired interventions for deep neural network embeddings.
  arXiv  Detail & Related papers  (2023-06-04T02:32:12Z)
• Nonparametric Identifiability of Causal Representations from Unknown Interventions [63.1354734978244]
  We study causal representation learning, the task of inferring latent causal variables and their causal relations from mixtures of the variables. Our goal is to identify both the ground truth latents and their causal graph up to a set of ambiguities which we show to be irresolvable from interventional data.
  arXiv  Detail & Related papers  (2023-06-01T10:51:58Z)
• Sensitivity Analysis of High-Dimensional Models with Correlated Inputs [0.0]
  The sensitivity of correlated parameters can not only differ in magnitude, but even the sign of the derivative-based index can be inverted. We demonstrate that the sensitivity of the correlated parameters can not only differ in magnitude, but even the sign of the derivative-based index can be inverted.
  arXiv  Detail & Related papers  (2023-05-31T14:48:54Z)
• Data-Driven Influence Functions for Optimization-Based Causal Inference [105.5385525290466]
  We study a constructive algorithm that approximates Gateaux derivatives for statistical functionals by finite differencing. We study the case where probability distributions are not known a priori but need to be estimated from data.
  arXiv  Detail & Related papers  (2022-08-29T16:16:22Z)
• On Finite-Sample Identifiability of Contrastive Learning-Based Nonlinear Independent Component Analysis [11.012445089716016]
  This work puts forth a finite-sample identifiability analysis of GCL-based nICA. Our framework judiciously combines the properties of the GCL loss function, statistical analysis, and numerical differentiation.
  arXiv  Detail & Related papers  (2022-06-14T04:59:08Z)
• Non-Linear Spectral Dimensionality Reduction Under Uncertainty [107.01839211235583]
  We propose a new dimensionality reduction framework, called NGEU, which leverages uncertainty information and directly extends several traditional approaches. We show that the proposed NGEU formulation exhibits a global closed-form solution, and we analyze, based on the Rademacher complexity, how the underlying uncertainties theoretically affect the generalization ability of the framework.
  arXiv  Detail & Related papers  (2022-02-09T19:01:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.