2023/02/18 by Haochen Ye, Robert E. Nicholas, Ye, Haochen +5
Decision Sciences · Engineering · Physics and Astronomy · #Advanced Numerical Methods in Computational Mathematics #Applications (stat.AP) #FOS: Computer and information sciences #Model Reduction and Neural Networks #Probabilistic and Robust Engineering Design
paper · pdf · doi:10.48550/arxiv.2302.12738
openalex publication_date 2023/02/18 · openalex created_date 2023/03/03 · openalex updated_date 2026/08/01
Models with high-dimensional parameter spaces are common in many applications. Global sensitivity analyses can provide insights on how uncertain inputs and interactions influence the outputs. Many sensitivity analysis methods face nontrivial challenges for computationally demanding models. Common approaches to tackle these challenges are to (i) use a computationally efficient emulator and (ii) sample adaptively. However, these approaches still involve potentially large computational costs and approximation errors. Here we compare the results and computational costs of four existing global sensitivity analysis methods applied to a test problem. We sample different model evaluation time and numbers of model parameters. We find that the emulation and adaptive sampling approaches are faster than Sobol' method for slow models. The Bayesian adaptive spline surface method is the fastest for most slow and high-dimensional models. Our results can guide the choice of a sensitivity analysis method under computational resources constraints.