A Data-Consistent Approach to Ensemble Filtering

2026-05-11

AI Summary

This study addresses the degradation in accuracy and miscalibration of uncertainty estimates in small-ensemble filtering, which arise from low-rank covariance approximations and observation perturbations. To mitigate these issues, the authors propose a data-consistent deterministic update framework that avoids stochastic observation perturbations by introducing spectral regularization in observation space. The update is constrained to a rank-κ subspace dominated by the residual covariance, and integrates residual whitening, empirical eigendecomposition, and an empirical gain mapping to formulate the QPCA-EnDCF method. Theoretically, the work distinguishes between population-level and finite-ensemble quantities, elucidating the bias–variance structure of the resulting errors. Empirically, the approach demonstrates markedly improved ensemble-skill alignment, error tracking, and temporal reliability in strongly undersampled Lorenz-96 experiments, achieving lower RMSE than baseline configurations.

Abstract

Ensemble filtering of chaotic, partially observed systems is often performed with ensembles far smaller than the state dimension resulting in empirical covariances that are low rank. Subsequently, stochastic observation perturbations can degrade both accuracy and probabilistic calibration. We develop a data-consistent perspective on ensemble filtering and introduce the Quantity-of-Interest Principal Component Analysis Ensemble Data Consistent Filter (QPCA-EnDCF), which is a deterministic method that replaces perturbed observations with a spectrally regularized update in observation space. The method whitens forecast--observation residuals, computes an empirical eigendecomposition of the residual covariance, and restricts the correction to a rank-$κ$ subspace before mapping the increment back to state space through an empirical gain. We establish a theoretical framework that separates population and finite-ensemble objects and yields a bias--variance decomposition for the analysis mean. The analysis shows that stochastic EnKF variants incur an irreducible $\mathcal{O}(1/N)$ variance contribution from observation perturbations, whereas QPCA-EnDCF replaces this term with projector-estimation variability that is also $\mathcal{O}(1/N)$ but depends on the retained rank and the cutoff gap through eigenspace stability. Numerical experiments on the Lorenz--96 system in strongly undersampled regimes demonstrate that QPCA-EnDCF substantially improves spread--skill behavior, temporal tracking between spread and error, and rank-histogram reliability relative to sequential and four-dimensional stochastic EnKF. Under the baseline configuration, these calibration gains are accompanied by lower RMSE.

Problem

• ensemble filtering
• chaotic systems
• low-rank covariance
• observation perturbations
• probabilistic calibration

Innovation

• data-consistent filtering
• ensemble Kalman filter
• spectral regularization
• principal component analysis
• bias-variance decomposition