mlsanityData to 14 Oct 2026

Non-Sequential Ensemble Kalman Filtering using Distributed Arrays

arXiv 2311.12909 ↗First posted 21 Nov 2023stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

This work introduces a new, distributed implementation of the Ensemble Kalman Filter (EnKF) that allows for non-sequential assimilation of large datasets in high-dimensional problems. The traditional EnKF algorithm is computationally intensive and exhibits difficulties in applications requiring interaction with the background covariance matrix, prompting the use of methods like sequential assimilation which can introduce unwanted consequences, such as dependency on observation ordering. Our implementation leverages recent advancements in distributed computing to enable the construction and use of the full model error covariance matrix in distributed memory, allowing for single-batch assimilation of all observations and eliminating order dependencies. Comparative performance assessments, involving both synthetic and real-world paleoclimatic reconstruction applications, indicate that the new, non-sequential implementation outperforms the traditional, sequential one.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 47 references that are in the map. First posted on arXiv 21 Nov 2023.

Builds on

2 of 47 references.

References · 2

  1. 2021A comparison of nonlinear extensions to the ensemble Kalman filter: Gaussian Anamorphosis and Two-Step Ensemble Filterscited by 4
  2. 2021Uncertainty Quantification and Experimental Design for Large-Scale Linear Inverse Problems under Gaussian Process Priorscited by 2

Built on by

Not cited yet.