General Multifidelity Surrogate Models: Framework and Active-Learning Strategies for Efficient Rare Event Simulation

Estimating the probability of failure for complex real-world systems using high-fidelity computational models is often prohibitively expensive, especially when the probability is small. Exploiting low-fidelity models can make this process more feasible, but merging information from multiple low-fidelity and high-fidelity models poses several challenges. This paper presents a robust multifidelity surrogate modeling strategy in which the multifidelity surrogate is assembled using an active-learning strategy using an on-the-fly model adequacy assessment set within a subset simulation framework for efficient reliability analysis. The multifidelity surrogate is assembled by first applying a Gaussian process correction to each low-fidelity model and assigning a model probability based on the model's local predictive accuracy and cost. Three strategies are proposed to fuse these individual surrogates into an overall surrogate model based on model averaging and deterministic or stochastic model selection. The strategies also dictate which model evaluations are necessary. No assumptions are made about the relationships between low-fidelity models, while the high-fidelity model is assumed to be the most accurate and most computationally expensive model. Through two analytical and two numerical case studies, including a case study evaluating the failure probability of tristructural isotropic-coated (TRISO) nuclear fuels, the algorithm is shown to be highly accurate while drastically reducing the number of high-fidelity model calls (and hence computational cost).

Automated summary

This paper presents a robust multifidelity surrogate modeling strategy that combines low-fidelity and high-fidelity models to estimate the probability of failure for complex systems. Through an active-learning strategy, the multifidelity surrogate is assembled using an on-the-fly model adequacy assessment set within a subset simulation framework. The algorithm is highly accurate and significantly reduces computational cost.