Generative Forecasting from Coarse-Grained Observations: When Does Cascading Help?
Abstract
We study probabilistic forecasting of dynamical systems such as fluids and waves from coarse observations. Since the unseen fine scales influence the dynamics, the same coarse initial state can evolve into a whole distribution of futures. Generative forecasters may produce visually plausible samples, but it is hard to tell whether they sample the right conditional distribution, since trajectory data contain a single future for each initial state. We address this problem by generating reference data in a hierarchical way: for each coarse initial state, we generate many different fine-scale components and numerically evolve the full states. Using these conditional ensembles, we show that standard diffusion models and stochastic interpolants make substantial distributional errors. We then show that cascading shorter forecasts greatly reduces these errors for the turbulent flows and waves we study, but we also find and characterize cases in which it hurts. Since the coarse process is not Markov, cascading discards information about the unresolved fine scales even with exact transitions. To understand this, we propose a solvable analytic model which shows that the optimal cascade depth decreases as the coupling between the unresolved and observed scales gets stronger, and increases as the dependence of the forecast on the observation becomes more oscillatory. Consistent with our experiments, cascading is detrimental when the direct forecast is ``easy'' to learn, for example Gaussian as in the passive scalar case. We release our datasets as a first benchmark for probabilistic forecasting with ground-truth conditional ensembles.
The following analysis is generated by AI and may contain errors. It is separate from the authors’ abstract and is not peer review.
Research summary
The paper provides a rigorous theoretical and experimental analysis of when cascading generative forecasters improves probabilistic accuracy, introducing a novel benchmark for evaluating conditional distributions in dynamical systems.
Methodology
The paper introduces a rigorous experimental framework for evaluating probabilistic forecasters by generating "reference ensembles" via hierarchical data generation. This allows for the direct comparison of the learned conditional distribution $P(X_T|X_0)$ against the true conditional distribution, addressing a critical gap where standard trajectory data only provides single futures. The theoretical contribution is significant, proposing a solvable analytic model (rotation driven by a hidden Ornstein-Uhlenbeck process) that isolates the trade-off between approximation error (favoring shorter transitions) and memory loss (favoring direct forecasts due to non-Markovian coarse-graining). The authors prove that an optimal finite cascade depth exists under specific conditions, providing a theoretical foundation for why cascading helps in some systems (turbulent flows) but hurts in others (passive scalars).
Results & evaluation
The experiments are extensive, covering five distinct physical systems (Euler, SQG, Heterogeneous Waves, Klein-Gordon, Passive Scalar) to test the generality of the findings. The use of spatial FID and conditional energy distance on large reference ensembles (10,000 samples per test observation) provides statistically robust evaluation. The results clearly demonstrate that direct diffusion models and stochastic interpolants fail to capture the correct conditional distribution despite producing visually plausible samples, while cascaded SIs recover the distribution in nonlinear systems. The finding that cascading is detrimental for the passive scalar case is a strong, counter-intuitive result supported by the theory.
Reproducibility
The paper provides detailed descriptions of the numerical solvers, initial conditions, and model architectures. The release of the datasets as a benchmark is a major contribution to reproducibility. However, the text provided does not explicitly list a GitHub URL, though it mentions releasing datasets. The hyperparameters and training protocols are described in sufficient detail for replication.
Limitations
The study is limited to 2D periodic domains and specific PDEs. The "fixed budget" constraint (equalizing the number of supervised pairs) is a harsh constraint that may not reflect all practical scenarios where intermediate data is abundant. The theory, while elegant, is based on a simplified linear model and may not fully capture the complexities of highly chaotic 3D turbulence. The inference cost of cascading increases with depth, which is a practical limitation not fully explored in terms of compute-time trade-offs.
Broader impact
This work has high impact on the field of scientific machine learning and probabilistic forecasting. It provides a new benchmark for evaluating generative forecasters and a theoretical understanding of when autoregressive/cascaded approaches are beneficial. This is crucial for weather forecasting and fluid dynamics simulation, where capturing the correct uncertainty distribution is as important as the mean forecast. The insights into the non-Markovian nature of coarse-grained processes will influence how future models handle partial observations. The paper provides a rigorous theoretical and experimental analysis of when cascading generative forecasters improves probabilistic accuracy, introducing a novel benchmark for evaluating conditional distributions in dynamical systems.
Author of this paper? Send a correction.