- The connection between theoretical stability guarantees and the practical learned dynamics is insufficiently established.
The theoretical analysis provides exponential transverse stability guarantees for an ideal path-relative vector field. However, the corresponding guarantee for the learned vector field requires a uniform bound on the transverse approximation error.
The actual training procedure minimizes a sampled regression objective, which does not directly ensure that this uniform approximation-error condition holds throughout the relevant neighborhood of the reference trajectory. Consequently, the theoretical results do not automatically establish comparable stability properties for the learned model.
Although the two-dimensional and Navier–Stokes experiments provide encouraging evidence, these evaluations are relatively limited and do not fully establish whether the predicted stability behavior generalizes to more complex, high-dimensional dynamical systems.
The paper would benefit from a clearer distinction between guarantees for the ideal vector field and empirical properties of the learned dynamics, together with more systematic validation across perturbation magnitudes, trajectories, and model initializations.
- The experimental comparisons are insufficient to establish consistent advantages over existing continuous-time and stochastic generative models.
While the experiments cover several application domains, the comparative results are mixed, and some important baselines are missing.
First, on the KTH Actions benchmark, the proposed method improves over Vid-ODE in extrapolation but underperforms it on all three reported interpolation metrics (SSIM, PSNR, and LPIPS). This raises questions about the consistency of the claimed benefits of score-induced interpolation, particularly because generating plausible intermediate states is a central motivation of the paper.
Second, the Gray–Scott experiments reveal a trade-off between geometric plausibility and trajectory accuracy. In Table 3, Neural ODE achieves a lower relative L2 error (0.060 versus 0.115), whereas the proposed method achieves a better spectral plausibility score (0.335 versus 0.482). These results suggest that improved manifold adherence does not necessarily translate into more accurate recovery of the true intermediate dynamics. This distinction deserves greater emphasis.
Third, the stochastic long-horizon evaluation primarily compares the proposed probabilistic model against a deterministic Fourier Neural Operator (FNO). Since the deterministic baseline cannot represent multiple plausible futures, the reported distributional advantage partly reflects differences in modeling capacity rather than necessarily demonstrating the superiority of score-guided dynamics.
More competitive comparisons against stochastic continuous-time models, such as latent ODE-based or other probabilistic dynamics approaches, would strengthen the experimental conclusions. Similarly, the natural video evaluation relies primarily on Vid-ODE, leaving the performance relative to more recent generative approaches insufficiently explored.
Overall, the experiments demonstrate the feasibility of the proposed framework, but they do not yet provide sufficiently consistent evidence of its advantages in prediction accuracy, stochastic generation, and general-purpose continuous-time modeling.
Dear reviewer, we thank you for your feedback and for the positive overall assessment of our paper, especially regarding its motivation and presentation.
We have addressed your concerns through a new pipeline overview and a clarification of the computational requirements at inference. Details are provided below and incorporated into a revised version of the paper, with changes marked in blue. We also made several further additions, summarized below.
We believe these additions address your concerns and strengthen our evidence. We hope they will reinforce your positive assessment and support a higher rating. If any relevant concerns remain, we would greatly appreciate the opportunity to address them.
Weakness: Complex Pipeline
Thank you for pointing this out. We have added Figure 5 (Appendix D.1), which provides an overview of the complete pipeline and distinguishes the components required during training and inference. We hope that this improves accessibility of the paper.
Regarding the complexity itself, our framework builds on a pretrained score-based prior. We expect such models to become increasingly available as general-purpose priors, potentially removing the need to train this component from scratch. Furthermore, the interpolator amortizes the cost of finding geodesic-like paths under this prior and could potentially be replaced by more efficient geometric constructions.
Beyond these components, the architecture follows standard CVAE machinery, consisting of a latent prior, posterior, and velocity network. Moreover, the score model and interpolator are frozen during the final training stage. Thus, the additional complexity primarily concerns the construction of geometric supervision rather than the generative model itself.
Question: Computational Overhead
The score model, interpolator, and posterior are not required at inference time. Generation only involves sampling a latent from the history-conditioned prior and evolving the learned vector field (Figure 5, Appendix D.1).
Consequently, inference has essentially the same computational structure as standard Neural ODE or Flow Matching sampling. For h=0, we solve an ODE using only the velocity network, while for h>0, each finite-step update requires just one velocity-network evaluation, allowing direct rollouts without an ODE solver.
Thus, our geometric machinery introduces no additional per-step inference cost. As with standard Neural ODEs, the actual NFE depends on the solver, its tolerances, and the learned field. Figures 9–10 (Appendix E.2) report rollout quality against step size and NFE across direct, fixed-step, and adaptive integration, showing that our robustness improvements persist across these settings.
Further Additions
Beyond your specific concerns, we made several additions that further strengthen the geometric and stability contributions you highlighted.
First, Corollary 3.1 and the accompanying remark (Section 3.2, Appendix C.4) connect our stability theory more directly to the MSE-based training objective, without requiring a uniform approximation-error bound. Furthermore, we added video-level metrics (tOF, Ewarp, FVD), showing improved temporal consistency over Vid-ODE, including on KTH interpolation (Tables 5–6).
We also introduced two stochastic generative baselines, autoregressive Flow Matching and a latent Neural ODE. Our model achieves competitive long-horizon distributional performance while supporting continuous-time generation, and remains stable through four times its training horizon, whereas the latent ODE diverges (Section 4.4, Table 4).
Finally, a new experiment confirms finite-step self-consistency, with composed and direct steps differing by only 1.5–5% of the reference displacement for h≤0.5 (Appendix E.1, Table 16).