SearcharxivSearch

arXiv · 2603.05817

Two Localization Strategies for Sequential MCMC Data Assimilation with Applications to Nonlinear Non-Gaussian Geophysical Models

Abstract

We present a localized data assimilation (DA) scheme based on the sequential Markov Chain Monte Carlo (SMCMC) technique [Ruzayqat et al., 2024], a provably convergent method for filtering high-dimensional, nonlinear, and potentially non-Gaussian state-space models. Unlike particle filters, which are exact methods for nonlinear non-Gaussian models, SMCMC does not assign weights to samples and therefore avoids weight degeneracy in small-ensemble regimes. We design two localization approaches within the SMCMC framework that exploit spatial sparsity of observations to reduce the effective degrees of freedom and improve efficiency. The first variant collects observed blocks into a single reduced domain and runs parallel MCMC chains over this combined region. The second variant further reduces the per-chain state dimension by decomposing the observed region into independent blocks, each augmented with a compact halo, and applying Gaspari--Cohn observation-noise tapering to smoothly down-weight distant observations. When the observation model is linear and Gaussian, we show that our approximate filtering density reduces to a Gaussian mixture from which independent samples can be drawn exactly. For nonlinear or non-Gaussian observation models, we employ an MCMC kernel. We test on high-dimensional ($d \sim 10^4 - 10^5$) state-space models, including a linear Gaussian model and a nonlinear multilayer shallow water equation with both linear and nonlinear observation operators. We consider Gaussian and non-Gaussian (Student-$t$) observation noise, showing that LSMCMC naturally handles heavy-tailed errors that cause ensemble Kalman methods to diverge. Observations include synthetic and real data from the Surface Water and Ocean Topography (SWOT) mission (NASA) and ocean drifter data (NOAA). We compare the two variants against each other and the local ensemble transform Kalman filter (LETKF).

Explore related subjects

Keep this discovery

BibTeXRIS

Hamza Ruzayqat, Hristo G. Chipilski, Omar Knio. 2026-03-06. Two Localization Strategies for Sequential MCMC Data Assimilation with Applications to Nonlinear Non-Gaussian Geophysical Models. https://arxiv.org/abs/2603.05817

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