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.
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.
Your Probabilistic JEPA Is Secretly a Hidden Markov Model: A State-Space Interpretation of Joint-Embedding Predictive Learning
The paper establishes a theoretical connection between probabilistic Joint-Embedding Predictive Learning (JEPA) and Hidden Markov Models (HMMs), providing a state-space interpretation and introducing Markov-Chain JEPA for enhanced consistency.
PUe: Biased Positive-Unlabeled Learning Enhancement by Causal Inference
This paper proposes PUe, a framework for biased positive-unlabeled learning that uses normalized propensity scores and normalized inverse probability weighting to handle selection bias, improving classification under non-uniform label distributions.
SJEPA: Learning Elegant Latent Dynamics with Hybrid Symbolic-Neural Predictors
SJEPA introduces a reconstruction-free JEPA framework that learns hybrid symbolic-neural latent dynamics, aiming for the simplest adequate predictive representation. Experiments show it discovers simpler symbolic dynamics with lower rollout error than post-hoc fitting, while controlling symbolic-neural allocation under grammar misspecification.