Bayesian subset simulation
arXiv:1601.02557 · doi:10.1137/16M1078276
Abstract
We consider the problem of estimating a probability of failure , defined as the volume of the excursion set of a function above a given threshold, under a given probability measure on . In this article, we combine the popular subset simulation algorithm (Au and Beck, Probab. Eng. Mech. 2001) and our sequential Bayesian approach for the estimation of a probability of failure (Bect, Ginsbourger, Li, Picheny and Vazquez, Stat. Comput. 2012). This makes it possible to estimate when the number of evaluations of is very limited and is very small. The resulting algorithm is called Bayesian subset simulation (BSS). A key idea, as in the subset simulation algorithm, is to estimate the probabilities of a sequence of excursion sets of above intermediate thresholds, using a sequential Monte Carlo (SMC) approach. A Gaussian process prior on is used to define the sequence of densities targeted by the SMC algorithm, and drive the selection of evaluation points of to estimate the intermediate probabilities. Adaptive procedures are proposed to determine the intermediate thresholds and the number of evaluations to be carried out at each stage of the algorithm. Numerical experiments illustrate that BSS achieves significant savings in the number of function evaluations with respect to other Monte Carlo approaches.
References in corpus (3)
Cited by in corpus (6)
- Active learning for structural reliability: survey, general framework and benchmark
- Adaptive Design of Experiments for Conservative Estimation of Excursion Sets
- Multi-Objective Yield Optimization for Electrical Machines using Machine Learning
- A Blackbox Yield Estimation Workflow with Gaussian Process Regression Applied to the Design of Electromagnetic Devices
- Constrained Minimum Energy Designs
- Yield Optimization using Hybrid Gaussian Process Regression and a Genetic Multi-Objective Approach