基于共识的稀有事件估计
Consensus-based rare event estimation
AI总结:
本文提出一种基于共识的自适应重要性采样算法用于稀有事件估计,通过McKean-Vlasov随机微分方程驱动的粒子系统近似最优采样密度,并引入自动参数更新与时间步长控制,实验表明其性能与序贯重要性采样和集合卡尔曼滤波等先进方法相当。
摘要:
在本文中,我们提出了一种基于自适应重要性采样的稀有事件估计新算法。我们考虑最优重要性采样密度的平滑版本,该密度通过一组相互作用的粒子集合来近似。粒子动力学由McKean-Vlasov随机微分方程控制,该方程由Carrillo等人(Stud. Appl. Math. 148:1069-1140, 2022)在贝叶斯反问题背景下针对后验分布的共识采样与优化引入并分析。我们为算法的内部参数开发了自动更新机制,其中包括一种新颖的指数欧拉方法时间步长控制器,用于离散化粒子动力学。所有参数更新的行为依赖于用户指定的易于解释的精度准则。数值实验表明,我们的方法与最先进的稀有事件估计自适应重要性采样算法具有竞争力,这些算法包括序贯重要性采样方法和用于稀有事件估计的集合卡尔曼滤波。
英文摘要:
In this paper, we introduce a new algorithm for rare event estimation based on adaptive importance sampling. We consider a smoothed version of the optimal importance sampling density, which is approximated by an ensemble of interacting particles. The particle dynamics is governed by a McKean-Vlasov stochastic differential equation, which was introduced and analyzed in (Carrillo et al., Stud. Appl. Math. 148:1069-1140, 2022) for consensus-based sampling and optimization of posterior distributions arising in the context of Bayesian inverse problems. We develop automatic updates for the internal parameters of our algorithm. This includes a novel time step size controller for the exponential Euler method, which discretizes the particle dynamics. The behavior of all parameter updates depends on easy to interpret accuracy criteria specified by the user. We show in numerical experiments that our method is competitive to state-of-the-art adaptive importance sampling algorithms for rare event estimation, namely a sequential importance sampling method and the ensemble Kalman filter for rare event estimation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。