Learning to Trust AI and Data-driven models in Data Assimilation through a Multifidelity Ensemble Gaussian Mixture Filter Framework

TL;DR

This paper introduces a multifidelity ensemble Gaussian mixture filter that adaptively combines theory-driven and data-driven models to improve trustworthiness and accuracy in high-dimensional data assimilation tasks.

Contribution

It proposes a novel framework that uses bandwidth scaling factors in kernel density estimates to measure and adaptively compute trust between models, enhancing data assimilation reliability.

Findings

Validated on a static banana problem and Lorenz '96 equations.

Demonstrated high-dimensional convergence in undersampled regimes.

Showed adaptive trust improves data assimilation accuracy.

Abstract

AI and data-driven models have large potential for data assimilation applications by creating fast and accurate forecasts. Their tendency to produce spurious inaccurate, nonphysical results -- hallucination -- however, raises a serious question about their long-term use, and can be categorized as untrustworthy methods. Theory-driven methods on the other hand are slow, but are capable of staying physically realistic due to their mathematical underpinning, and can be categorized as trustworthy methods. We argue that by making use of these methods in tandem, it is possible to build a relative measure of trust between the theory-driven and data-driven methods that results in a combined trustworthy methodology. We argue, and then show, that the bandwidth scaling factors in the kernel density estimates can be used to represent our trust in the theory-driven and data-driven models. We provide for ways in which these measures of trust can be adaptively computed through an expectation-maximization approach. We combine all of these ideas to create the multifidelity ensemble Gaussian mixture filter and its adaptive trust version, which are particle filters capable of high-dimensional data assimilation. We validate our ideas on both a static banana problem and on a sequential filtering example with the Lorenz '96 equations, showing that it is possible to create a particle filter that is capable of high dimensional convergent inference in the undersampled regime -- when the number of theory-driven samples is less than the dimension of the system.