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

Unbiased Estimation of the Vanilla and Deterministic Ensemble Kalman-Bucy Filters (2208.03947v1)

Published 8 Aug 2022 in stat.ME, cs.NA, and math.NA

Abstract: In this article we consider the development of an unbiased estimator for the ensemble Kalman--Bucy filter (EnKBF). The EnKBF is a continuous-time filtering methodology which can be viewed as a continuous-time analogue of the famous discrete-time ensemble Kalman filter. Our unbiased estimators will be motivated from recent work [Rhee & Glynn 2010, [31]] which introduces randomization as a means to produce unbiased and finite variance estimators. The randomization enters through both the level of discretization, and through the number of samples at each level. Our estimator will be specific to linear and Gaussian settings, where we know that the EnKBF is consistent, in the particle limit $N \rightarrow \infty$, with the KBF. We highlight this for two particular variants of the EnKBF, i.e. the deterministic and vanilla variants, and demonstrate this on a linear Ornstein--Uhlenbeck process. We compare this with the EnKBF and the multilevel (MLEnKBF), for experiments with varying dimension size. We also provide a proof of the multilevel deterministic EnKBF, which provides a guideline for some of the unbiased methods.

Citations (2)

Summary

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