Bayesian subset simulation
Julien Bect (L2S, GdR MASCOT-NUM), Ling Li (L2S, GdR MASCOT-NUM),, Emmanuel Vazquez (L2S, GdR MASCOT-NUM)

TL;DR
This paper introduces Bayesian subset simulation, an efficient method combining subset simulation and Bayesian modeling to estimate very small failure probabilities with limited function evaluations.
Contribution
It develops a novel Bayesian subset simulation algorithm that adaptively estimates failure probabilities using Gaussian processes and sequential Monte Carlo methods.
Findings
Significant reduction in function evaluations compared to traditional Monte Carlo methods.
Effective estimation of small failure probabilities with limited evaluations.
Adaptive threshold and evaluation point selection improve efficiency.
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…
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.
