Learning Probabilistic Filters with Strictly Proper Scoring Rules
Not on the map. Why?
Abstract (arXiv)
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 rarely available as a supervised learning target. However, one can often use the forecast model to generate synthetic trajectories, with corresponding synthetic observations. We introduce the proper scoring ensemble filter (PSEF), an ensemble data assimilation method trained using only synthetic trajectories. The analysis step is represented as a permutation-equivariant, transformer-based map. 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. Under a realizability assumption, the population mean-field objective is minimized by the true Bayesian filtering distribution. Our methodology allows the same learned parameters to be shared between different ensemble sizes, subject to an ensemble-dependent fine-tuning. Numerical experiments show that the learned filter accurately approximates challenging filtering distributions, including highly 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.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 13 of its 110 references that are in the map. First posted on arXiv 25 Jun 2026.
Builds on
13 of 110 references.
References · 13
- 2018Set Transformer: A Framework for Attention-based Permutation-Invariant Neural Networkscited by 132
- 2018Validating Bayesian Inference Algorithms with Simulation-Based Calibrationcited by 124
- 2025Skillful joint probabilistic weather forecasting from marginalscited by 63
- 2025FourCastNet 3: A geometric approach to probabilistic machine-learning weather forecasting at scalecited by 62
- 2023Generative Sliced MMD Flows with Riesz Kernelscited by 37
- 2022Likelihood-Free Inference with Generative Neural Networks via Scoring Rule Minimizationcited by 15
- 2023Nonlinear Filtering with Brenier Optimal Transport Mapscited by 11
- 2025Operator learning meets inverse problems: A probabilistic perspectivecited by 11
- 2026In-Context Operator Learning on the Space of Probability Measurescited by 11
- 2024Learning Optimal Filters Using Variational Inferencecited by 9
- 2024Machine Learning for Inverse Problems and Data Assimilationcited by 7
- 2024BI-EqNO: Generalized Approximate Bayesian Inference with an Equivariant Neural Operator Frameworkcited by 6
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026On the sensitivity of machine-learned probabilistic weather forecast models to scale-aware scoring rulescited by 1
- 2026Universal Approximation of Measure-to-Measure Operators by Pushforwardscited by 1
- 2026Attention Kernels for Learning Maps Between Heavy-Tailed Measurescited by 1
- 2026Improving Ensemble Filters with Flow Matchingcited by 0
- 2026The interface of data assimilation and machine learningcited by 0
- 2026Stability of Measure-to-Measure Transformers on Sub-Gaussian Datacited by 0
- 2026Stability of Measure-to-Measure Transformers on Sub-Gaussian Data6 Oct 2026
- 2026The interface of data assimilation and machine learning5 Oct 2026
- 2026Attention Kernels for Learning Maps Between Heavy-Tailed Measures30 Sep 2026
- 2026Universal Approximation of Measure-to-Measure Operators by Pushforwards28 Sep 2026
- 2026Improving Ensemble Filters with Flow Matching23 Sep 2026
- 2026On the sensitivity of machine-learned probabilistic weather forecast models to scale-aware scoring rules21 Jul 2026