Pith. sign in

REVIEW 3 cited by

Elucidating the Design Choice of Probability Paths in Flow Matching for Forecasting

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

arxiv 2410.03229 v3 pith:BMCEFNL3 submitted 2024-10-04 stat.ML cs.LG

classification stat.MLcs.LG
keywords forecastingmodelprobabilitypathflowmatchingperformancechoice
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Flow matching has recently emerged as a powerful paradigm for generative modeling and has been extended to probabilistic time series forecasting in latent spaces. However, the impact of the specific choice of probability path model on forecasting performance remains under-explored. In this work, we demonstrate that forecasting spatio-temporal data with flow matching is highly sensitive to the selection of the probability path model. Motivated by this insight, we propose a novel probability path model designed to improve forecasting performance. Our empirical results across various dynamical system benchmarks show that our model achieves faster convergence during training and improved predictive performance compared to existing probability path models. Importantly, our approach is efficient during inference, requiring only a few sampling steps. This makes our proposed model practical for real-world applications and opens new avenues for probabilistic forecasting.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Trajectory-Aware Flow Matching for Topology Optimisation

    cs.LG 2026-07 conditional novelty 6.0 of 10

    A trajectory-aware flow matching method that builds its training path from volume-fraction-indexed BESO states generates feasible topologies in about 20 Euler steps and beats a diffusion baseline on compliance, volume...

  2. Autoregressive One-Step Generative Modeling for Dynamical System Forecasting

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    MeLISA extends pixel-space MeanFlow to one-step window-conditioned autoregressive forecasting, improving long-horizon turbulence statistics over neural-operator baselines.

  3. Flow Learners for PDEs: Toward a Physics-to-Physics Paradigm for Scientific Computing

    cs.LG 2026-04 unverdicted novelty 6.0 of 10

    Learned PDE solving should target transport over admissible futures via flow learners, not snapshot state regression.

Pith tools