MLLGOTJul 16, 2024

Ensemble Transport Filter via Optimized Maximum Mean Discrepancy

arXiv:2407.11518v22 citationsh-index: 2
Originality Incremental advance
AI Analysis

This is an incremental improvement for researchers in data assimilation and filtering, offering a more robust method for high-dimensional problems.

The paper tackles the challenge of high-dimensional data assimilation by proposing an ensemble-based filter that uses a transport map optimized via Maximum Mean Discrepancy to directly transport prior particles to posterior particles, with results showing advantages over the ensemble Kalman filter in numerical examples.

In this paper, we present a new ensemble-based filter method by reconstructing the analysis step of the particle filter through a transport map, which directly transports prior particles to posterior particles. The transport map is constructed through an optimization problem described by the Maximum Mean Discrepancy loss function, which matches the expectation information of the approximated posterior and reference posterior. The proposed method inherits the accurate estimation of the posterior distribution from particle filtering while gives an extension to high dimensional assimilation problems. To improve the robustness of Maximum Mean Discrepancy, a variance penalty term is used to guide the optimization. It prioritizes minimizing the discrepancy between the expectations of highly informative statistics for the reference posteriors. The penalty term significantly enhances the robustness of the proposed method and leads to a better approximation of the posterior. A few numerical examples are presented to illustrate the advantage of the proposed method over ensemble Kalman filter.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes