- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces SIDDY, a compact neural architecture for fluid forecasting. Its design is motivated by the potential representational burden of modeling spatial transport and changes in field values through the same latent transformations. SIDDY encodes the observation history into a shared context that guides both transport and refinement, while explicitly transporting only the latest observed field. A single transport stage per prediction step is followed by multiple reaction–diffusion refinement layers that learn corrections to the transported prediction. This organization separates historical conditioning from state evolution, avoiding repeated transport of historical observations. Experiments on simulated and real-world dynamics report lower forecasting errors with fewer parameters than the evaluated baselines.
Critical strengths
- SIDDY achieves a favorable trade-off between predictive accuracy and model size, obtaining lower relative errors than the evaluated baselines across Navier–Stokes, ink-video, and atmospheric forecasting tasks while using fewer parameters.
Critical weaknesses
- The separation between transport and non-transport evolution has direct precedents in previous works. NowcastNet (2023) uses a shared history encoder to predict motion fields and intensity residuals, combining semi-Lagrangian transport with additive updates. LUPIN (2025) similarly separates learned advection from advection-free intensity evolution, while as early as de Bezenac et al. (2018) already infer motion from history and warp the latest observed field. The authors should clarify what additional methodological insight SIDDY provides beyond these principles and isolate the benefits of its particular organization under comparable parameter and computational budgets.
Questions for authors
-
The paper motivates SIDDY by suggesting that representing transport and field-value changes through the same latent transformations increases the representational burden. Could the authors define this burden more precisely and provide theoretical reasoning or controlled experimental evidence that specifically supports its reduction through the proposed decomposition?
-
Could the authors make the motivation behind the main architectural choices in Section 3 more explicit? In particular, what motivates applying transport only once per prediction step, followed by multiple refinement layers, and using a shared history context to condition both stages?
-
Could the authors clarify the physical interpretation of the transport and refinement modules in Figures 1c and 1d? Beyond their computational definitions, concrete examples explaining the roles of the learned displacements, nonlinear updates, and diffusion stencils would be helpful. Please also distinguish physically grounded properties from architectural analogies, particularly because refinement operates in latent feature space.
-
Does each iteration of the deduction require recalculating the historical context? How does this affect the inference time?