pith. sign in

arxiv: 2508.13313 · v5 · pith:FAX47J3Inew · submitted 2025-08-18 · 📊 stat.ML · cs.LG· math.OC

Flow Matching for Efficient and Scalable Data Assimilation

classification 📊 stat.ML cs.LGmath.OC
keywords flowfilterassimilationenffensembledataefficienthigh-dimensional
0
0 comments X
read the original abstract

Data assimilation (DA) estimates a dynamical system's state from noisy observations. Recent generative models like the ensemble score filter (EnSF) improve DA in high-dimensional nonlinear settings but are computationally expensive. We introduce the ensemble flow filter (EnFF), a training-free, flow matching (FM)-based framework that accelerates sampling and offers flexibility in flow design. EnFF uses Monte Carlo estimators for the marginal flow field, localized guidance for observation assimilation, and utilizes a novel flow path that exploits the Bayesian DA formulation. It generalizes classical filters such as the bootstrap particle filter and ensemble Kalman filter. Experiments on high-dimensional benchmarks demonstrate EnFF's improved cost-accuracy tradeoffs and scalability, highlighting FM's potential for efficient, scalable DA. Code is available at https://github.com/Utah-Math-Data-Science/Data-Assimilation-Flow-Matching.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Generative Model Proposal based Particle Filtering for Data Assimilation

    cs.LG 2026-07 unverdicted novelty 6.0

    FPPF uses a learned conditional generative proposal approximating the optimal proposal in particle filters, with tractable likelihoods for Bayesian updates and localization for high dimensions, outperforming baselines...