- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This manuscript proposes the PARA framework, which is a neural solver for hyperbolic PDEs. PARA adapts to multi-resolution cases while preserving locality and physical scale equivariance. The authors propose a TreeGrid structure where the solution is stored as non-overlapping patches at different resolutions, with each patch advanced independently and processed from different resolution levels in a single batched operation. A MultiGrid representation is introduced to convert the irregular TreeGrid into dense grids at each resolution for efficient extraction of these stencils. Instead of using dataset-level mean/std statistics, PARA derives local reference quantities such as mean density, characteristic energy velocity, and stencil length, and normalizes them into dimensionless quantities. The authors argue that this makes the solver scale-equivariant by construction. Experiments on the Well compressible Euler dataset show that PARA substantially improves one-step error for all four baselines and generally improves long-horizon rollout error. However, the experimental settings are, in general, less fair, and the results lack many critical components/metrics. It is thus difficult to recommend acceptance as-is. The authors are encouraged to provide the missing experimental data/metrics, mostly on those they already conducted/reported, to persuade me.
Critical strengths
- The decomposition of locality, adaptivity, and symmetry, with TreeGrid, multigrid, and normalization, etc., is well-motivated and insightful.
- The scale-normalization formulation embeds intuitive physical meaning.
- The experiments show that PARA works with and enhances multiple standard baselines.
Critical weaknesses
- The computational efficiency claim is not well demonstrated. The results report only the number of stencils processed rather than the actual end-to-end inference time/latency. Since this is an irregular multigrid, it consists of many irregular and small grids/stencils. On a GPU, such small/irregular batches can be much more inefficient than large ones. This means that merely "few stencils", such as reducing the number of stencils by a ratio of x%, does NOT guarantee the end-to-end latency to be decreased by x%, or even decreased. Other efficiency-related metrics, such as FLOPS, memory traffic, or GPU utilization rate, are also not reported. Moreover, the cost for multigrid hierarchy construction, restriction/prolongation, stencil extraction, etc., is also missing. None of these efficiency metrics are reported or discussed.
- The training cost is not computationally matched. For example, the UNet uses 31h by default, yet 85h with PARA.
- The experimental scope does not match the claims. Only subset is evaluated.
Questions for authors
- What is the actual end-to-end inference speedup? In the overall pipeline, which components offer true speedup, and which are wall-clock bottlenecks?
- How do legacy numerical frameworks such as MATLAB or AMGCL perform on the subset? If the proposed method fails to outperform legacy non-neural frameworks, this overall paper will be significantly weakened.
2 comments
Response to Reviewer TAFp (2/2)
-
Experimental scope and claims (see also our replies to Reviewer wFcJ, point 2, and to the fourth review, relayed by the AC, point 4): We agree. Our results are on the gamma = 1.4 subset of the benchmark, and the abstract and conclusion now say so. We chose this subset, the value for air at standard conditions, to separate learning the solution map from identifying gamma from the frame (Appendix A.3.1). All our networks, whole-frame and PARA, are trained on this subset. For the Euler equations at gamma = 1.4, we then demonstrate scale symmetry (Section 4.3, extended in this revision) and generalization to an unseen flow (Section 4.5, added in this revision). The published results on all ten values of gamma are listed for reference (Tables 1 and 2). Appendix A.6 shows how scale normalization, and with it PARA, extends to three other hyperbolic PDEs, the Burgers equation, the shallow water equations and ideal MHD.
-
Comparison against a classical solver: We agree that a neural solver should be placed against a classical solver in wall clock time, and we have added this comparison. We compare PARA with a modern classical DGSEM solver, Trixi.jl, on an unseen flow, the Kelvin-Helmholtz instability (Section 4.5, Appendix A.7). The table below is an excerpt of Table 21.
| Solver | Hardware | Stencils | Time per frame (ms) | VRMSE at step 100 |
|---|---|---|---|---|
| DGSEM, Trixi.jl | 16-core CPU, 24 threads | -- | 932 | reference |
| Whole-frame U-Net | RTX 4090 | -- | 90 | 3.19 |
| PARA U-Net, threshold 3 | RTX 4090 | 134 | 78 | 0.55 |
The DGSEM solver, at a CFL number of 0.95, requires on average 34 time steps to cover the Well's frame interval of 0.015 s, while the PARA and whole-frame U-Nets cover it in one step. As shown in the table, PARA at threshold 3 advances one frame faster than the whole-frame U-Net and the classical solver. The solver runs on a CPU and the networks on a GPU, so the costs are not like-for-like. After 100 steps the VRMSE of PARA against the solver's solution is 0.55, below the whole-frame U-Net at 3.19 and below persistence, the initial frame held fixed, at 0.97.
We are glad to discuss any of these points further.
Response to Reviewer TAFp (1/2)
We thank the reviewer for the careful review, and for the positive remarks on the decomposition into locality, adaptivity and symmetry. You asked for the missing experimental data and metrics, mostly on the experiments we had already run. We have added them to the manuscript, marked in blue, and answer each point below.
The MultiGrid exists to avoid the irregular small batches you describe. It expands the TreeGrid into one dense grid per level, from which every stencil is cut at one shape, so a standard backbone advances all levels in a single batched tensor operation. The network's forward pass takes most of a step, at 0.5 to 0.6 ms per stencil, so reducing the stencil count is what gives the speedup (Figure 17). PARA's own operations, including the MultiGrid construction and the refinement, are a fixed cost of about 5 ms per step at every threshold and are not a bottleneck.
In our main results we match the training data and the network, the same U-Net at 17.5 M parameters in both forms, not the training time. A surrogate is trained once and used many times, so what matters more is how much it learns from the same data, and the training time matters less.