- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper proposes AMR-VNO, a neural operator that works directly on block-structured adaptive mesh refinement (AMR) hierarchies. The method uses direction-aware message passing, learned restriction/prolongation, and shared-weight V-cycle processing to predict PDE solutions on active leaf cells. The authors test the method on four PDE benchmarks and report better accuracy than several baselines, especially for the 2D problems. However, the results are less convincing on some 3D tests, and the method shows clear limitations when generalizing to different refinement depths and policies.
Critical strengths
-
The paper considers a useful and practical problem. Working directly on AMR hierarchies avoids the need to convert adaptive meshes into uniform grids and allows information exchange across different resolution levels.
-
The paper provides a reasonably broad set of experiments, including comparisons with several neural operator and graph-based methods. The ablation studies and additional tests are also helpful for understanding the performance and limitations of the proposed method.
Critical weaknesses
My main concern is that the proposed method seems to be largely built on existing ideas, such as hierarchical message passing, learned restriction/prolongation, multigrid V-cycles, and weight sharing across levels. These are already quite common in multiscale GNNs and multigrid-based neural operators (e.g., MgNO, multiscale MeshGraphNets, and adaptive-mesh GNNs). As I understand it, the main difference is that the authors apply these techniques directly to solver-generated AMR hierarchies. While this is a reasonable design choice, I am not fully convinced that it brings enough new methodological contributions compared with existing works. The paper could better explain what is really new about the proposed architecture and why it should work better than other hierarchical methods. Also, most of the key ablation studies are carried out only on Darcy, so it is not clear whether the same findings hold for other problems.
Another concern is that the experiments do not sufficiently show how well the method can work in more general AMR settings. Most of the test problems use static, input-derived mesh hierarchies. Even for Quokka, the model predicts on the current mesh without considering how the mesh may change in the future. There are no long-term rollout tests with dynamic regridding, which I think would be important for showing the usefulness of the method in realistic AMR simulations.
I am particularly concerned about the generalization results. The method performs significantly worse when just one additional refinement level is introduced, and it even becomes less accurate than the hierarchy MPNN in this case. Changing the refinement policy also leads to worse results. This suggests that the method still depends quite strongly on the mesh hierarchy used during training, despite sharing weights across levels. I think this is an important limitation for a method specifically designed for adaptive meshes.
The reported accuracy and efficiency improvements are also somewhat mixed. On Quokka, AMR-VNO performs almost the same as the hierarchy MPNN. On Darcy, its advantage becomes quite small when compared against a finer numerical reference. Also, having fewer parameters does not necessarily make the method faster or more memory-efficient, as shown by some of the runtime and memory results. The different tuning budgets and the way the benchmarks were selected also make it harder to draw strong conclusions from the comparisons.
Overall, I think the idea of working directly on AMR hierarchies has some practical value, but I am not fully convinced by the methodological novelty or the generalization and efficiency advantages demonstrated in the current paper.
Questions for authors
-
What are the main methodological differences between AMR-VNO and existing multigrid-based neural operators or hierarchical GNNs, apart from using solver-generated AMR hierarchies? Could the authors explain more clearly what is new in the proposed method?
-
Why does the method show such a large performance drop when tested with one additional refinement level or a different refinement policy, even though the weights are shared across levels? Would training on more varied mesh hierarchies help address this issue?
-
How would the method handle long-term autoregressive prediction when the mesh hierarchy changes over time? It would be useful to see experiments with actual dynamic regridding, rather than predicting only on the current mesh.
-
Could the authors provide more balanced baseline comparisons in terms of training budget, tuning effort, and computational cost?
-
Could the authors include MgNO-48, rather than only MgNO-24, in the Darcy fine-reference comparison? More generally, in what situations does AMR-VNO offer clear advantages in terms of prediction accuracy, runtime, and memory usage over existing methods?
4 comments
Also, most of the key ablation studies are carried out only on Darcy, so it is not clear whether the same findings hold for other problems.
During the discussion we ran the direction x cycles ablation on Conduction3D (the paper's 50-epoch recipe, three seeds per cell, 100 validation cases, paired case bootstrap; revised Appendix C.2):
| 1 cycle | 2 cycles | |
|---|---|---|
| Isotropic messages | 0.0215 | 0.0204 |
| Directional messages | 0.0166 | 0.0157 |
Directional messages lower error by 0.0049 at one cycle (95% interval [0.0040, 0.0058]) and 0.0047 at two ([0.0039, 0.0054]); a second cycle lowers it by 0.0011 isotropic ([0.0006, 0.0017]) and 0.0009 directional ([0.0005, 0.0013]); the interaction interval includes zero. So both Darcy findings hold on Conduction3D.
I am particularly concerned about the generalization results. The method performs significantly worse when just one additional refinement level is introduced, and it even becomes less accurate than the hierarchy MPNN in this case.
Why does the method show such a large performance drop when tested with one additional refinement level or a different refinement policy, even though the weights are shared across levels? Would training on more varied mesh hierarchies help address this issue?
Training on more varied hierarchies helps but does not fix it. During the discussion we generated 60 fresh maximum-level-6 Conduction3D cases (three families, one never used in training) and scored every fixed checkpoint once, under a plan and result wording frozen before scoring (three seeds per arm; revised Section 6.3 and Appendix C.2):
| Training data | AMR-VNO | Hierarchy MPNN |
|---|---|---|
| Level 5 only (paper models) | 0.0334 | 0.0245 |
| Levels 4 + 5 (level 6 unseen) | 0.0208 | 0.0160 |
| Levels 5 + 6 (level 6 seen) | 0.0131 | 0.0151 |
- Trained on levels 4 and 5, AMR-VNO's error at the unseen level 6 falls by 0.0126 ([0.0111, 0.0141]), but the MPNN trained the same way is still better (difference 0.0049, [0.0031, 0.0068]; AMR-VNO lower on 27% of cases; MPNN better on all three families).
- With level-6 data, AMR-VNO beats the MPNN trained the same way (difference 0.0020, [0.0012, 0.0027]; lower on 78% of cases), but that is training on the target depth, not transfer.
Why: weight sharing fixes the parameter count, not the function at a new depth. The fixed Darcy model depends strongly on its trained hierarchy: removing virtual coarse levels at inference raises validation error from 0.0022 (nine levels) to 0.16 (five; Appendix B.4, Table 25). For a changed refinement policy, most of the Darcy error comes from the coarser output space: the leaf-constant floor alone (0.00905) is 87% of AMR-VNO's squared error and 89% of that of an MgNO-24 projected to the same leaves. Within that space AMR-VNO is still worse (0.00344 vs 0.00305), and policy-mixture training did not recover the ranking (Appendix B.4). We agree this is an important limitation for an adaptive-mesh method; Section 6.3 gives these numbers, and the revised abstract and Limitations state the limitation.
There are no long-term rollout tests with dynamic regridding, which I think would be important for showing the usefulness of the method in realistic AMR simulations.
How would the method handle long-term autoregressive prediction when the mesh hierarchy changes over time? It would be useful to see experiments with actual dynamic regridding, rather than predicting only on the current mesh.
Thank you for pushing on this; we have now run that experiment (revised PDF, Appendix C.3, Table 29). On Quokka, AMR-VNO and the hierarchy MPNN were trained to predict all four conserved fields one step ahead (same 65-minute GPU budget, three seeds), then rolled out 11 steps on their own predictions from frame 2. After every step the hierarchy is rebuilt from the predicted density with a gradient-threshold rule calibrated against the solver's meshes, and fields are transferred conservatively. On 16 held-out trajectories, step-11 density error is 0.0830 for AMR-VNO, 0.0864 for the MPNN and 0.1478 for persistence (4.1% lower than the MPNN, [3.1, 5.0]; lower on all 16); momentum is 1.0% lower ([0.5, 1.5]; 14 of 16); mass drift is 0.12% vs 0.24%. All 96 rollouts stayed finite. The comparison is at equal training time (the MPNN needs activation checkpointing and completed fewer updates), and the tagging rule, not the model, decides where to refine.
Could the authors provide more balanced baseline comparisons in terms of training budget, tuning effort, and computational cost?
Tuning. During the discussion we re-searched MgNO and the hierarchy MPNN under one written procedure, with AMR-VNO not retuned (revised Section 6.1 and Appendix C.1): full-length 500-epoch trials, selection by seed-0 validation error after reloading the saved checkpoint, two further seeds for a new winner, and trial counts reported (including diverged runs). About 104, 165 and 151 training hours plus 67 and 79 for extra seeds, the same order as AMR-VNO's 160.8 retained Darcy hours. The search kept MgNO-48 on Darcy and found stronger HeatTransport2D MgNO (64 channels, 4.61M parameters) and Darcy MPNN models. We then scored all 21 fixed checkpoints (three seeds each) once on a newly generated held-out set (200 Darcy, 100 HeatTransport2D cases), with the result sentences frozen first:
| Contrast | AMR-VNO | Baseline | AMR-VNO lower on |
|---|---|---|---|
| Darcy, MgNO-48 | 0.002134 | 0.002681 | 73% of cases |
| Darcy, searched MPNN | 0.002134 | 0.005506 | 100% |
| HeatTransport2D, searched MgNO | 0.001990 | 0.002257 | 39% |
All three 95% paired case-bootstrap intervals exclude zero, but the HeatTransport2D advantage is narrow: on a typical case the searched MgNO, 61 times AMR-VNO's size, is slightly better. FNO, U-Net, CNO, GINO and the sparse U-Net were not re-searched; their numbers stand with that caveat.
Compute. No FLOP-matched runs. Matched in parameters, an 8-channel MgNO (73,504 parameters), rerun under the search protocol, reaches 0.00402 Darcy validation error at seed 0 against AMR-VNO's 0.00223 at seed 0.
On Quokka, AMR-VNO performs almost the same as the hierarchy MPNN. On Darcy, its advantage becomes quite small when compared against a finer numerical reference.
Could the authors include MgNO-48, rather than only MgNO-24, in the Darcy fine-reference comparison?
Yes, and the result goes against us. On 100 validation cases (three seeds per model, paired case bootstrap), against the fine reference MgNO-48 reaches 0.014230 and AMR-VNO 0.014295 relative L2. The 95% interval of MgNO-48 minus AMR-VNO is [-0.000109, -0.000020], and AMR-VNO is lower on only 35% of cases, so MgNO-48 is slightly but significantly more accurate there. The packaged Darcy target itself differs from the reference by 0.0141, so our Darcy headline measures emulation of the solver's discrete output, not fidelity to the PDE. The revised PDF adds MgNO-48 to the fine-reference table (Table 5) and states this in the abstract, Section 6.3 and Limitations. On Quokka we agree: AMR-VNO and the hierarchy MPNN are not distinguishable. Quokka's octree has only two levels, so there is little hierarchy for the V-cycle to use.
Also, having fewer parameters does not necessarily make the method faster or more memory-efficient, as shown by some of the runtime and memory results.
More generally, in what situations does AMR-VNO offer clear advantages in terms of prediction accuracy, runtime, and memory usage over existing methods?
- Accuracy: lower held-out mean error against the solver's discrete targets than every evaluated baseline on the two 2D benchmarks, including the searched ones on the second held-out set (narrowly on HeatTransport2D, lower on only 39% of cases), at about 1/34 of MgNO-48's parameters. On in-distribution Conduction3D the same-hierarchy MPNN has about 24% higher error. Not more accurate than MgNO-48 against the Darcy fine reference; not distinguishable from the MPNN on Quokka.
- Runtime and memory (now in the main text, Section 6.3): no advantage on Darcy (1.49 times the CPU solver's time; 81.0 vs 30.5 ms and 156.5 vs 56.0 MiB against MgNO-48 at batch one). On HeatTransport2D it is faster than the solver (0.12 times) and than MgNO-48 (99.8 vs 142.2 ms), but uses more memory (394 vs 225 MiB). In a computation-only 3D sweep at 256^3 it had the lowest latency and memory of four models when refinement covers a small part of the domain; dense models are faster at lower maximum levels.
- Transfer and rollout: none across depth or refinement policy. In an 11-step Quokka rollout with regridding after every step, AMR-VNO has lower error than the MPNN (Appendix C.3).
We agree with your overall assessment that the practical value is in working directly on AMR hierarchies; the revision states the accuracy, efficiency and generalization limits as plainly as the gains.
Thank you for the detailed review. We quote each point and answer it below. A revised PDF is uploaded; it adds the new results to the main text (Sections 4, 6.1, 6.3, Limitations) and a new Appendix C.
We agree the components are known individually. What the solver's block-AMR hierarchy forces in the architecture:
Levels and outputs, as the cited papers describe them:
The closest prior work is Perera and Agrawal, who also mimic a multigrid solver over all levels of a block-structured AMR mesh, for next-step phase-field fracture. Their graph nodes are mesh vertices, and downsampling removes the finest refinement levels; AMR-VNO's nodes are cells, it keeps covered parents and predicts on active leaf cells. We have not run their model.
Evidence that the processor and these choices matter: on the same cells and links, the paper's 32-step hierarchy MPNN has about 2.9 and 1.9 times AMR-VNO's held-out error on Darcy and HeatTransport2D, and a hierarchy graph U-Net about 2.8 and 2.9 times. In separately trained seed-0 Darcy variants of a position-aware model, removing the virtual coarse levels raises validation error from 0.0023 to 0.12. Direction-aware messages lower validation error on Darcy and on Conduction3D (next point). The revision adds Algorithm 1 with the full forward pass.