English

Multilevel Ensemble Kalman-Bucy Filters

Numerical Analysis 2021-04-06 v2 Numerical Analysis Computation

Abstract

In this article we consider the linear filtering problem in continuous-time. We develop and apply multilevel Monte Carlo (MLMC) strategies for ensemble Kalman-Bucy filters (EnKBFs). These filters can be viewed as approximations of conditional McKean-Vlasov-type diffusion processes. They are also interpreted as the continuous-time analogue of the \textit{ensemble Kalman filter}, which has proven to be successful due to its applicability and computational cost. We prove that an ideal version of our multilevel EnKBF can achieve a mean square error (MSE) of O(ϵ2), ϵ>0\mathcal{O}(\epsilon^2), \ \epsilon>0 with a cost of order O(ϵ2log(ϵ)2)\mathcal{O}(\epsilon^{-2}\log(\epsilon)^2). In order to prove this result we provide a Monte Carlo convergence and approximation bounds associated to time-discretized EnKBFs. This implies a reduction in cost compared to the (single level) EnKBF which requires a cost of O(ϵ3)\mathcal{O}(\epsilon^{-3}) to achieve an MSE of O(ϵ2)\mathcal{O}(\epsilon^2). We test our theory on a linear problem, which we motivate through high-dimensional examples of order O(104)\sim \mathcal{O}(10^4) and O(105)\mathcal{O}(10^5).

Keywords

Cite

@article{arxiv.2011.04342,
  title  = {Multilevel Ensemble Kalman-Bucy Filters},
  author = {Neil K. Chada and Ajay Jasra and Fangyuan Yu},
  journal= {arXiv preprint arXiv:2011.04342},
  year   = {2021}
}
R2 v1 2026-06-23T20:00:33.946Z