Learning Probabilistic Filters with Strictly Proper Scoring Rules
Summary
This paper introduces the Proper Scoring Ensemble Filter (PSEF), a transformer-based method for Bayesian filtering that trains an analysis map using strictly proper scoring rules on synthetic state-observation trajectories. It demonstrates superior performance in nonlinear, non-Gaussian filtering tasks compared to classical and learning-based methods.
View Cached Full Text
Cached at: 06/26/26, 05:20 AM
# Learning Probabilistic Filters with Strictly Proper Scoring Rules Source: [https://arxiv.org/abs/2606.26497](https://arxiv.org/abs/2606.26497) [View PDF](https://arxiv.org/pdf/2606.26497) > Abstract:Bayesian filtering of partially and noisily observed dynamical systems seeks to infer the evolving conditional distribution of the state of a dynamical system, given observations, in an online fashion\. This Bayesian filtering distribution is the natural object for uncertainty quantification, but it is rarely available as a supervised learning target\. However, one can often use the forecast model to generate synthetic system trajectories, along with synthetic observations\. We introduce the proper scoring ensemble filter \(PSEF\), an ensemble data assimilation method based on training an analysis map to approximate the filtering distribution using only synthetic state\-\-observation trajectories\. The analysis step is represented as a permutation\-invariant, transformer\-based map that takes as input a forecast ensemble and observations, producing an analysis ensemble\. Training is based on strictly proper scoring rules \-\- with the energy score used in our implementation \-\- so that probabilistic accuracy is rewarded over the whole probability distribution\. We prove that, under a realizability assumption, the population objective is minimized by the true Bayesian filtering distribution\. We also derive the finite\-ensemble empirical objective used in training and relate its single state\-\-observation trajectory form to the population objective, using a mean\-field consistency argument\. Numerical experiments show that the learned filter accurately approximates challenging filtering distributions, including nonlinear, non\-Gaussian, and multi\-modal posteriors, and achieves stronger performance in data assimilation tasks than classical methods or learning\-based methods with mean\-squared\-error objectives\. For close\-to\-Gaussian problems, learning a correction to the EnKF is the best approach, while for highly non\-Gaussian problems an end\-to\-end approach that discards this inductive bias is superior\. ## Submission history From: Bohan Chen \[[view email](https://arxiv.org/show-email/a97b8888/2606.26497)\] **\[v1\]**Thu, 25 Jun 2026 01:04:21 UTC \(5,398 KB\)
Similar Articles
Ensemble Score Filtering for Real-Data Energy Consumption Forecast Correction
This paper proposes using the Ensemble Score Filter (EnSF), a score-based diffusion data assimilation method, to correct forecasts from a pretrained spatio-temporal energy consumption model using noisy partial observations. Numerical experiments show EnSF significantly improves state estimation over open-loop propagation and outperforms the Ensemble Kalman Filter under nonlinear observations.
Learning to Bias: Machine Learning-Enhanced Particle Filters
This paper introduces Neural Optimal Particle Filters (NOPFs), which learn amortized proposal distributions to improve sample efficiency and distributional accuracy in sequential inference tasks, enhancing classical particle filters with data-driven methods.
Generative Bayesian Filtering for State Estimation
Proposes Generative Bayesian Filtering (GBF), a framework that replaces restrictive observation models with pretrained conditional generative models for state estimation, improving accuracy and robustness in synthetic and real-world applications.
EnJoi: Ensemble Joint Score Filter for Generative Data Assimilation
The paper proposes EnJoi, an ensemble joint score filter for generative data assimilation that learns the joint distribution of past and future states, enabling a modified En4DVar approach to balance confidence in the current state versus new observations. Experiments on fluid and traffic flow simulations show improved reconstruction, especially with sparse, non-homogeneous observations.
Proper Scoring Rule-based Diffusion for Probabilistic Weather Forecasting
Researchers from KAIST, Kookmin University, and NYU propose a proper scoring rule-based diffusion framework for probabilistic weather forecasting that adds auxiliary conditional denoising tasks to CRPS-trained models, enabling improved forecast accuracy and calibration at longer horizons while keeping single-forward-pass ensemble generation.