- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Purely data-driven neural networks for fluid dynamics often suffer from rapidly accumulating errors during autoregressive rollout over large time intervals, motivating the introduction of NeNS^2, a neural surrogate designed to learn large-step incompressible flow dynamics with an explicit Navier-Stokes structure. By representing flow on rectangular domains using analytical eigenfunctions of the Stokes operator, the framework satisfies incompressibility and boundary conditions by construction while parameterizing nonlinear dynamics with a low-rank skew-symmetric bilinear operator to inherently preserve kinetic-energy conservation.
Critical strengths
-
The authors provide comparison with numerical solver baselines.
-
The model demonstrates outstanding empirical performance compared to strong baselines and achieving excellent out-of-distribution generalization on complex independent scenarios.
Critical weaknesses
-
The experiments are only conducted on rectangular domains with periodic or free-slip boundaries, making it unclear how the method generalizes to irregular meshes and other boundary conditions (particularly whether the Stokes eigenbasis can be calculated on an irregular mesh).
-
While the authors claim their method satisfies incompressibility and boundary conditions by construction, they should report the incompressibility error, boundary error, and boundary residual to justify this, and clarify exactly how uncommon conditions (such as integral boundary conditions) are mathematically satisfied.
-
The authors should discuss and compare their approach with existing neural PDE solvers that use eigenbases and spectral representations to decompose spatial or temporal dynamics into characteristic modes, which generalize beyond the Navier-Stokes equation.
-
It is unclear if all baselines also use RK4; if not, the comparison is unfair, as the baselines could potentially improve their performance by integrating RK4. The authors must also report wall-clock inference time, as the proposed model will be significantly slower if it is the only one using RK4.
-
More details are needed in Section 4.3 (Efficiency Against Classical Spectral Simulation), specifically regarding what ground truth data was used to calculate the error against the classical method and whether the evaluation follows the fair protocols established by [1, 2].
[1] Weak baselines and reporting biases lead to overoptimism in machine learning for fluid-related partial differential equations
[2] FD-Bench: A Modular and Fair Benchmark for Data-driven Fluid Simulation
Questions for authors
-
Which specific step in the methodology is restricted to the Navier-Stokes equation, and can this framework be extended to other PDEs?
-
How does the methodology actively support large-step predictions as highlighted in the title, and exactly how large is the experimental step compared to existing works?
-
Why did FNO and LNO diverge during testing? This divergence, particularly for FNO on periodic Navier-Stokes equations, directly contradicts existing literature and requires further analysis to validate the experimental results.
3 comments
(2/3) Response to Reviewer qfNK's comments
(Continue)
4. Baseline Fairness and Inference Efficiency (W4)
We appreciate the reviewer's concern regarding the fairness of numerical integration settings. In the original submission, the neural baselines used their native prediction schemes rather than RK4 integration. To address this concern, we have added a new comparison in which all models use RK4 with the same two internal substeps per prediction interval, ensuring consistent integration settings across methods (see Table 10 in the revised manuscript). All baseline checkpoints are reused without retraining.
We evaluate both prediction accuracy and wall-clock inference time over the complete 120-step leapfrogging OOD rollout:
| Model | Vorticity Error ↓ | Runtime ↓ |
|---|---|---|
| NeNS² | 5.033% | 0.301 s |
| U-Net | 102.898% | 6.759 s |
| PDE-T SC-100 (scratch) | 48.539% | 30.524 s |
| PDE-T SC-B (scratch) | 47.956% | 30.877 s |
| PDE-T SC-B (pretrained) | 48.222% | 30.487 s |
NeNS² achieves both the lowest prediction error and the fastest inference time under the same RK4 integration settings. We have also clarified the integration settings and wall-clock timing protocol in the revised manuscript.
5. Classical Solver Comparison (W5)
We are grateful for this constructive point regarding reference solutions and benchmarking fairness. We have clarified the ground-truth construction and evaluation protocols in Appendix E.8.
For the trajectory prediction experiments in Section 4.1, the reference solutions are generated using an independent float64 DOP853 integration of the resolved Galerkin system. For the efficiency comparison in Section 4.3, we use the same retained modes, initial conditions, prediction interval, and NVIDIA A100 GPU to evaluate the classical solver and NeNS².
All reported timings include the complete numerical integration process, including the classical solver's internal substeps and all generator evaluations required by NeNS². We also report the classical periodic solver at its native resolution to make the effect of numerical configuration explicit.
We have further clarified the error definitions and measurement protocols in Appendix E.8, following the principles of controlled comparisons emphasized by FD-Bench [4] and McGreivy and Hakim [5].
6. Large-Step Prediction (Q2)
We would like to clarify that our use of “large-step” is relative to the time-step restrictions of conventional explicit modal integration. As discussed by Cui et al. [6], explicit integration can require very small time steps to maintain stability, with a reported maximum stable step size of approximately at 1,000 modes. This motivated their use of implicit time integration.
To provide further evidence, we have added a comparison with the explicit integration scheme discussed by Cui et al. [6] (see Appendix E.6, Table 13, and Fig. 8 in the revised manuscript). We use an output interval of and evaluate 120-step rollouts up to , varying the number of internal substeps.
| Method | Substeps | Mean Vorticity Error ↓ | Mean Velocity Error ↓ |
|---|---|---|---|
| Cui et al. (explicit) | 1–16 | Diverged | — |
| Cui et al. (explicit) | 32 | 4.716% | 1.461% |
| NeNS² | 2 | 5.033% | 1.356% |
As shown above, the explicit scheme requires at least 32 substeps to remain stable in this experiment, whereas NeNS² achieves stable prediction with only two substeps, corresponding to a 16× larger internal time step.
Side-by-side rollout videos illustrating the divergence of explicit stepping across different substeps are available in the supplementary web viewer under Structural analysis Large-step.
We hope this additional comparison helps clarify the intended meaning of “large-step” in our work and provides further empirical support for our choice of prediction interval.
(3/3) Response to Reviewer qfNK's comments
(Continue)
7. Analysis of Baseline Divergence (Q3)
The divergence of FNO and LNO over long rollouts stems primarily from the evaluation setup: all models are evaluated under the same single-frame autoregressive setting, where the current state is used to predict the next state. In contrast, previous FNO and LNO evaluations commonly use multiple historical frames (e.g., 10 input frames) to predict the next frame.
This single-frame setting is more challenging for these baselines, as they cannot leverage temporal information from previous observations. However, it ensures a consistent comparison with NeNS², which also predicts the next state from a single current state.
We believe this difference in evaluation settings helps explain the weaker performance and eventual divergence observed in some baselines during long-term autoregressive rollout.
Summary
We sincerely thank the reviewer for the careful and constructive evaluation. We hope the additional experiments, clarified evaluation protocols, and expanded discussion address the concerns regarding physical consistency, baseline fairness, and large-step prediction. We welcome any further discussion.
References
[1] K. Taira and T. Colonius. "The Immersed Boundary Method: A Projection Approach." Journal of Computational Physics, 225(2), 2118–2137, 2007. https://doi.org/10.1016/j.jcp.2007.03.005
[2] V. S. Fanaskov and I. V. Oseledets. "Spectral Neural Operators." Doklady Mathematics, 108(Suppl 2), S226–S232, 2023. https://doi.org/10.1134/S1064562423701107
[3] "Laplace Neural Operator." Nature Machine Intelligence, 2024. https://doi.org/10.1038/s42256-024-00844-4
[4] "FD-Bench: A Modular and Fair Benchmark for Data-driven Fluid Simulation." https://arxiv.org/abs/2505.20349
[5] N. McGreivy and A. Hakim. "Weak Baselines and Reporting Biases Lead to Overoptimism in Machine Learning for Fluid-Related Partial Differential Equations." https://arxiv.org/abs/2407.07218
[6] Q. Cui, P. Sen, and T. Kim. "Scalable Laplacian Eigenfluids." ACM Transactions on Graphics, 37(4), Article 87, 2018. https://doi.org/10.1145/3197517.3201352
(1/3) Response to Reviewer qfNK's comments
We sincerely appreciate the reviewer’s thoughtful feedback and constructive suggestions. We address each point in detail below:
Please refer to the revised PDF with all changes highlighted in blue. The updated supplementary web viewer at
CLICKME.htmlfurther provides side-by-side video comparisons of the evaluated rollouts and baselines.1. Boundary Conditions and Geometry (W1)
Our framework already supports irregular geometries and no-slip boundary conditions through the immersed-boundary method (IBM) [1]. As demonstrated in the single-cylinder and two-cylinder experiments in Section 4.4, NeNS² successfully reproduces vortex deflection and transport around unseen obstacles without retraining. IBM imposes no-slip constraints through boundary forces, allowing us to handle complex geometries while retaining the original analytical Stokes basis.
Our choice of IBM reflects a practical trade-off between boundary accuracy and computational efficiency. While IBM imposes boundary constraints approximately, a more rigorous alternative would be to compute geometry-adapted numerical Stokes eigenfunctions, which incorporate the prescribed boundary conditions directly into the modal basis. However, computing thousands of eigenmodes on irregular domains can incur substantial computational overhead. We therefore favor IBM for its efficiency and flexibility, while viewing numerical Stokes bases as a promising direction for improving boundary accuracy in future work.
We have expanded the discussion in the revised manuscript (see Section 4.4 and Appendix E.7) to clarify our treatment of complex geometries and no-slip boundaries, along with the associated computational trade-offs. The corresponding obstacle flow rollouts are available in the supplementary web viewer under Passive-dye rollouts.
2. Physical Constraints and Boundary Residuals (W2)
Our Stokes basis satisfies incompressibility and the prescribed periodic or free-slip boundary conditions by construction. To further verify these properties numerically, we evaluated a 121-frame free-slip rollout on a 128×128 grid, computing spatial derivatives analytically from the Stokes basis (see Appendix E.5 and Table 11 in the revised manuscript). We report the maximum normalized residual over the entire rollout, using the RMS velocity for normalization.
All measured residuals are near numerical precision, consistent with the structural guarantees of our formulation. The boundary residuals correspond to the no-penetration and zero-tangential-stress conditions of the homogeneous free-slip setting.
For more general boundary conditions, including compatible integral constraints, the immersed-boundary formulation can incorporate additional constraint forces. Specifically, a discrete constraint Cwn+1=b can be enforced by correcting the predicted modal coefficients w∗ through a force term Gλ, where λ is obtained by solving CGλ=b−Cw∗. This provides a possible extension to more general boundary constraints.
3. Related Spectral Methods and PDE Generalization (W3, Q1)
Following this suggestion, we have expanded the Related Work section to include Spectral Neural Operators [2] and the Laplace Neural Operator [3], which also exploit spectral representations for learning PDE dynamics.
Our approach differs in that the spectral representation is coupled with the specific algebraic structure of the Navier–Stokes equations. In particular, the divergence-free Stokes basis enforces incompressibility and boundary conditions, the viscous operator is diagonalized, and the skew-symmetric quadratic generator preserves the energy-conserving structure of nonlinear advection.
The general framework could also be extended to other PDEs by replacing these Navier–Stokes-specific components with appropriate spectral bases, linear operators, and nonlinear structures. The underlying idea of learning structured modal dynamics through differentiable temporal integration remains applicable.