.png){kind=icon}
Return
APPROXIMATE BAYESIAN COMPUTATION BY SUBSET SIMULATION
.png){kind=icon}
OA
AI
DOI：10.1137/130932831.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new approximate Bayesian computation (ABC) algorithm for Bayesian updating of model parameters is proposed in this paper, which combines the ABC principles with the technique of subset simulation for efficient rare-event simulation, first developed in S. K. Au and J. L. Beck [Probabilistic Engrg. Mech., 16 (2001), pp. 263-277]. It has been named ABC-SubSim. The idea is to choose the nested decreasing sequence of regions in subset simulation as the regions that correspond to increasingly closer approximations of the actual data vector in observation space. The efficiency of the algorithm is demonstrated in two examples that illustrate some of the challenges faced in real-world applications of ABC. We show that the proposed algorithm outperforms other recent sequential ABC algorithms in terms of computational efficiency while achieving the same, or better, measure of accuracy in the posterior distribution. We also show that ABC-SubSim readily provides an estimate of the evidence (marginal likelihood) for posterior model class assessment, as a by-product.
Keywords:
approximate Bayesian computation
subset simulation
Bayesian inverse problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave
View more