REVIEW 2 cited by
Flow Matching for Efficient and Scalable Data Assimilation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
Forward citations
Cited by 2 Pith papers
-
Generative Model Proposal based Particle Filtering for Data Assimilation
FPPF learns a conditional flow-matching proposal that approximates the optimal particle-filter proposal, retains exact importance weights, and with localization outperforms classical and generative DA baselines on cha...
-
Generative Model Proposal based Particle Filtering for Data Assimilation
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...
Discussion (0). Sign in to comment.