Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Multilevel Ensemble Kalman-Bucy Filters (2011.04342v2)

Published 9 Nov 2020 in math.NA, cs.NA, and stat.CO

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 $\mathcal{O}(\epsilon2), \ \epsilon>0$ with a cost of order $\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 $\mathcal{O}(\epsilon{-3})$ to achieve an MSE of $\mathcal{O}(\epsilon2)$. We test our theory on a linear problem, which we motivate through high-dimensional examples of order $\sim \mathcal{O}(104)$ and $\mathcal{O}(105)$.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Neil K. Chada (33 papers)
  2. Ajay Jasra (116 papers)
  3. Fangyuan Yu (13 papers)
Citations (16)

Summary

We haven't generated a summary for this paper yet.