克隆算法的极限定理
Limit theorems for cloning algorithms
摘要:
随机过程的可加性路径泛函的大偏差引起了人们极大的研究兴趣,特别是在随机粒子系统和统计物理的背景下。已经开发了有效的数值“克隆”算法,以通过克隆罕见事件轨迹的重要性抽样为基础,估计标度累积量生成函数。到目前为止,试图研究这些算法在连续时间内的收敛性只导致部分结果的特殊情况。适应以前的结果,从文献中的粒子滤波器和顺序蒙特卡罗方法,我们建立了第一个全面和完全严格的方法来约束系统和随机误差的克隆算法在连续时间。为此,我们开发了一种方法来比较不同的算法,为特定类别的可观的随机过程的鞅特性的基础上。我们的结果适用于一个大类的跳跃过程在紧凑的状态空间,并不涉及任何时间离散化与以前的方法。这提供了一个强大而严格的框架,也可以用来评估和提高算法的效率。
英文摘要:
Large deviations for additive path functionals of stochastic processes have attracted significant research interest, in particular in the context of stochastic particle systems and statistical physics. Efficient numerical `cloning' algorithms have been developed to estimate the scaled cumulant generating function, based on importance sampling via cloning of rare event trajectories. So far, attempts to study the convergence properties of these algorithms in continuous time have only led to partial results for particular cases. Adapting previous results from the literature of particle filters and sequential Monte Carlo methods, we establish a first comprehensive and fully rigorous approach to bound systematic and random errors of cloning algorithms in continuous time. To this end we develop a method to compare different algorithms for particular classes of observables, based on the martingale characterization of stochastic processes. Our results apply to a large class of jump processes on compact state space, and do not involve any time discretization in contrast to previous approaches. This provides a robust and rigorous framework that can also be used to evaluate and improve the efficiency of algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。