arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1908.05575math.NAcs.NAmath.PR

Ensemble Kalman Inversion:平均场极限与收敛性分析

Ensemble Kalman Inversion: mean-field limit and convergence analysis

Zhiyan Ding, Qin Li

AI总结:

本文分析了连续版 Ensemble Kalman Inversion 的耦合 SDE 系统,证明了其平均场极限:粒子经验测度以最优速率收敛到 Fokker-Planck 方程的解,且在线性情况下能在有限时间内重建目标分布。

摘要:

Ensemble Kalman Inversion (EKI) 一直是用于贝叶斯逆问题的一种非常流行的算法。它从先验分布中采样粒子,并引入一种运动,在伪时间内移动粒子。当伪时间趋于无穷大时,该方法找到目标函数的最小化器;当伪时间在 $1$ 处停止时,粒子的系综分布在某种意义上类似于线性设置下的后验分布。这些思想可进一步追溯到 Ensemble Kalman Filter 及其相关分析,但直到今天,当作为一种采样方法来看待时,EKI 为何有效,以及在何种意义上以何种速率收敛,在很大程度上仍然未知。在本文中,我们分析了 EKI 的连续版本,即一个耦合 SDE 系统,并证明了该 SDE 系统的平均场极限。特别地,我们将证明:1. 当粒子数量趋于无穷大时,遵循 SDE 的粒子的经验测度在 Wasserstein 2-距离下以最优速率收敛到 Fokker-Planck 方程的解,这在线性和弱非线性情况下均成立;2. 在线性情况下,Fokker-Planck 方程的解在有限时间内重建目标分布。

英文摘要:

Ensemble Kalman Inversion (EKI) has been a very popular algorithm used in Bayesian inverse problems. It samples particles from a prior distribution, and introduces a motion to move the particles around in pseudo-time. As the pseudo-time goes to infinity, the method finds the minimizer of the objective function, and when the pseudo-time stops at $1$, the ensemble distribution of the particles resembles, in some sense, the posterior distribution in the linear setting. The ideas trace back further to Ensemble Kalman Filter and the associated analysis, but to today, when viewed as a sampling method, why EKI works, and in what sense with what rate the method converges is still largely unknown. In this paper, we analyze the continuous version of EKI, a coupled SDE system, and prove the mean field limit of this SDE system. In particular, we will show that 1. as the number of particles goes to infinity, the empirical measure of particles following SDE converges to the solution to a Fokker-Planck equation in Wasserstein 2-distance with an optimal rate, for both linear and weakly nonlinear case; 2. the solution to the Fokker-Planck equation reconstructs the target distribution in finite time in the linear case.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑