SearcharxivSearch

arXiv · 2502.16808

Multilevel Localized Ensemble Kalman Bucy Filters

Abstract

In this article we propose and develop a new methodology which is inspired from Kalman filtering and multilevel Monte Carlo (MLMC), entitle the multilevel localized ensemble Kalman--Bucy Filter (MLLEnKBF). Based on the work of Chada et al. \cite{CJY20}, we provide an important extension on this which is to include the technique of covariance localization. Localization is important as it can induce stability and remove long spurious correlations, particularly with a small ensemble size. Our resulting algorithm is used for both state and parameter estimation, for the later we exploit our method for normalizing constant estimation. As of yet, MLMC has only been applied to localized data assimilation methods in a discrete-time setting, therefore this work acts as a first in the continuous-time setting. Numerical results indicate its performance, and benefit through a range of model problems, which include a linear Ornstein--Uhlenbeck process, of moderately high dimension, and the Lorenz 96 model, for parameter estimation. Our results demonstrate improved stability, and that with MLMC, one can reduce the computational complexity to attain an order is MSE $\mathcal{O}(\epsilon^2)$, for $\epsilon>0$.

Explore related subjects

Keep this discovery

BibTeXRIS

Neil K. Chada. 2025-02-24. Multilevel Localized Ensemble Kalman Bucy Filters. https://arxiv.org/abs/2502.16808

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO