- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper addresses neural domain decomposition methods, where a learned local solver is reused across subdomains inside a Schwarz iteration to reach larger domains and unseen geometries. It points out a training-inference mismatch: local solvers are trained on reference interface states but evaluated on interface states produced by their own earlier predictions.
ONCE combines: (i) a Transolver local operator pre-trained on subdomain restrictions of existing global solutions. (ii) restricted additive Schwarz with Robin transmission conditions (optimized Schwarz). (iii) Trajectory-aligned Tuning: the pre-trained model is rolled out on the training cases, intermediate interface states are collected and paired with the reference subdomain solutions, and the model is fine-tuned on them.
Critical strengths
-
The approach is simple and cheap, and the results look promising. The observation that neural DDMs converge to a biased fixed point because of exposure bias is clearly articulated. TAT needs no extra numerical solves and no back-propagation through iterations. The controlled comparisons support the proposed approach, and the 19.7%/15.9% large-domain improvements from TAT are meaningful.
-
The evaluation is comprehensive. HeatSink-3D and UrbanRANS-2D go beyond the usual elliptic problems. Using Transolver as a mesh-agnostic local operator with METIS partitions of irregular domains makes the framework general.
Critical weaknesses
W1. The scalability claim is not substantiated in absolute terms. On the 4× Large domains, ONCE still has 26–41% relative L2 error. Moreover, the largest domains are only 128×128, ONCE needs up to 200 Schwarz iterations, and no benchmark compares time or accuracy with a numerical solver, which solves such problems exactly in milliseconds.
W2. The novelty is limited. It appears that TAT is essentially a single round of DAgger-style relabeling applied to the Schwarz iteration.
Questions for authors
Q1. For HeatSink-3D and UrbanRANS-2D, what are the wall-clock time and accuracy of the reference numerical solver (FV/FEM direct solve, simpleFoam) on the same hardware class? In what regime of domain size or geometry complexity does ONCE become cheaper at comparable accuracy?
Q2. Can the error floor on Large domains be reduced by repeating TAT (DAgger rounds using the tuned model's own trajectories), or by adding a coarse-space correction as in two-level Schwarz?
4 comments
Response to Reviewer G5LF (Part 2)
Q1: For HeatSink-3D and UrbanRANS-2D, what are the wall-clock time and accuracy of the reference numerical solver (FV/FEM direct solve, simpleFoam) on the same hardware class? In what regime of domain size or geometry complexity does ONCE become cheaper at comparable accuracy?
Please see details above in our reply in W1.(2).
Q2: Can the error floor on Large domains be reduced by repeating TAT (DAgger rounds using the tuned model's own trajectories), or by adding a coarse-space correction as in two-level Schwarz?
Thank you for this very insightful suggestions. Following your suggestions, we tested both extensions on Large Poisson.
| Comparison | Mean relative error | Error reduction | Contraction factor | Mean Schwarz sweeps |
|---|---|---|---|---|
| One TAT round → two TAT rounds | 0.2619 → 0.2523 | 3.7% | 0.940 → 0.937 | 142.8 → 141.3 |
| ONCE → ONCE with coarse correction | 0.2619 → 0.0759 | 71.0% | 0.940 → 0.706 | 142.8 → 22.8 |
(1) Repeated TAT. We collected new trajectories with the one-round TAT checkpoint and fine-tuned it for a second round. The error shows slightly reduction reflects the combined effect of the new trajectories and additional training.
(2) Coarse-space correction. We applied a coarse-space correction after each learned Schwarz iteration. On large Poisson domains, the correction reduced the overall relative error by 71%. This result demonstrate an important extension of ONCE.
We appreciate your insightful questions and suggestions, which have helped us more carefully assess ONCE’s practical computational value and investigate coarse-space correction as an extension for improving large-domain performance.
Thank you for the detailed response and additional experiments. Some of my concerns have been addressed, while some remain. So I'll maintain my original score (weak acceptance).
For scalability/cost, the added timings demonstrate speedups on UrbanRANS, but whether this is established upon comparable accuracy is still unclear. For Q2, the coarse-space correction results are encouraging and address my suggestion. Repeated tat also offers a modest improvement. For novelty, reusing existing reference solutions without additional PDE solves is a useful design choice, but I feel like there is still conceptual similarity to DAgger-style training.
Thank you very much for your timely follow-up and for acknowledging the additional experiments. We are encouraged by your positive feedback on our work.
On the scalability, there is indeed a practical trade-off for neural methods: while classical numerical solvers already excel in both speed and accuracy on simple problems, for complex simulations (e.g., intricate wind flow across dense building layouts), neural methods offer promising speedups yet SOTA global methods still fall short at extrapolation to large scales, which is the ONCE trying to tackle. In our experiments, we show that the error is reduced by ONCE, though it is still hard to achieve comparable accuracy with numerical solvers. We acknowlege this and will work more to further improve on its speed and accuracy as mentioned in our limitation section.
Thank you again for reviewing our work and we are truly grateful for your support.
Response to Reviewer G5LF (Part 1)
We thank the reviewer for focusing on absolute accuracy, computational cost, and the relationship to prior learning strategies. We address these points below.
(1) The claim of scalability.
Thank you for this thoughtful critique. Our primary goal in the scaling experiments is to compare ONCE against global baseline under the exact same limited scale training data, whereas ONCE substantially reduces error across larger domains. At the same time, we acknowledge that noticeable error still accumulates at large scales. This is primarily due to the fundemental limitation within the one-level Schwarz method (Mathew, 2008), where the information exchanges cannot efficiently propagate low-frequency global modes as the number of subdomains grows. As detailed in our response to Q2, incorporating a coarse-space correction in two-level DDM may solve this problem. This can indeed serve as an important extension based on ONCE. We refer the reviewer to the below response in Q2 for details, and we have also acknowledged this in the limitation section.
Reference: Tarek Mathew. Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations, volume 61 of Lecture Notes in Computational Science and Engineering. Springer Berlin Heidelberg, Berlin, Heidelberg, 2008. ISBN 978-3-540-77205-7 978-3-540-77209-5. doi: 10.1007/978-3-540-77209-5.
(2) Run time comparison with numerical solvers.
Following your suggestion, we added per-case timings for Poisson, HeatSink-3D, and UrbanRANS-2D in Appendix E.1, Table 5. The first row gives the mean time to generate a numerical reference solution. The second gives the ONCE speedup, computed as the reference generation time divided by the ONCE inference time.
The sparse direct solver is faster than ONCE across all Poisson and HeatSink-3D test sets—and notably, in these cases it is even faster than a single-pass global NO on Poisson and comparable in speed on HeatSink-3D. However, on UrbanRANS-2D, generating a steady-state RANS reference with OpenFOAM's
simpleFoamtakes approximately 20–294 s per case. ONCE achieves speedups of 45.9×, 21.1×, and 4.58× on the in-scale, medium, and large meshes, respectively. This also motivates ONCE to further extend to larger three-dimensional complex physical simulations.We agree with the reviewer that TAT is related to DAgger-style supervision on learner-visited states. However, we respectfully point out that the motivation of our study comes from the core limitation we obsereved from neural DDMs. Also, the standard DAgger requires querying an interactive expert oracle at every visited state which is equivalent to involving an numerical solver on the fly for every perturbed interface condition, which is mostly expensive. On contrast, TAT requires zero additional PDE solves, directly reusing pre-computed reference solutions already in the training set to pull rollout trajectories back toward the true fixed-point.