- Rating
- 3
- Confidence
- 3
- Informativeness
- 3(+1)
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper introduces MeshOp a Neural Operator approach to adaptive mesh refinement for finite element methods. MeshOp precits an adaptive finite-element refinement field which means effectively instead of having to go through multiple rounds of FEM solve and subsequent a-posteriori error estimation, the MeshOp is able to provide a one-shot estimate of regions in the domain that require fine meshes. The method is evaluated on three PDE test problems including a dynamic problem, a stationary case and a 3D example.
Critical strengths
First of all, I would like to highlight that the presentation of this paper is of significantly higher quality that most submissions I have reviewed for ML conference proceedings in recent months. The story is coherently presented and within the first few pages of the manuscript the problem statement and contributions are clearly presented. Thank you for not submitting AI slob. Beyond the presentation, I believe the scientific contribution of the manuscript to be of high value: mesh generation and adaptive meshing are of paramount importance to finite element methods which still constitute the most widely used computational technique across the sciences and engineering. The chosen numerical examples are also very appropriate for the requirement and the favourable performance of the method is clearly established.
Critical weaknesses
The manuscript contains some minor weaknesses which I would recommend the authors to consider for a camera-ready version (or revised resubmission as applicable):
-
Baselines in the numerical experiments: Although the MeshOp framework is thoroughly evaluated, I believe a stronger case could be made for this approach by providing more extensive comparisons against standard baselines in adaptive mesh refinement. In particular, there are reinforcement learning approaches to adaptive mesh refinement (e.g. Freymuth et al., 2025, as cited) at least one of which could serve as a useful baseline here.
-
To place the work more thoroughly in the appropriate literature I would encourage the authors to cite the following works:
(a) Bohn, J., and Feischl, M. (2021). Recurrent neural networks as optimal mesh refinement strategies. Computers & Mathematics with Applications.
(b) Rowbottom, J., Maierhofer, G., Deveney, T., et al. (2025). G-Adaptivity: optimised graph-based mesh relocation for finite element methods. Proceedings of the 42nd International Conference on Machine Learning (ICML 2025).
- Schematic of input/output of MeshOp: Although sections 3 and 4 do a good job in describing the MeshOp scheme, it would be nice if the authors could consider including an architectural schematic earlier on in the paper, that would showcase more clearly the input (solution field, domain representation etc) and the output (refinement field) that their model uses.
Questions for authors
- I wonder if it might be possible to derive heuristics about mesh refinement directly from the solution field. For example would it be possible to construct a "classical" refinement field from a coarse solve solution curvature field? I suspect this would be slightly more efficient than MeshOp because of negligible cost, but it might lead to worse refinement performance and error reduction?
6 comments
Response to Reviewer LJDV [Part 2]
4. Mesh generation guided by an approximate solution.
Response: Thank you for this suggestion. We conducted a preliminary Burgers experiment to test whether an approximate solution can guide mesh generation through a classical gradient-based monitor.
An FNO trained on 3000 instances predicts the Burgers solution , using the same architecture and training settings as the direct-solution baseline. We adapt the gradient-based monitor used by Hu et al. [1] to the normalized space–time coordinates :
m=1+\frac{g}{0.01\langle g\rangle},\qquad \rho=\frac{m}{\langle m\rangle}.$$ where $\langle\cdot\rangle$ denotes the domain average. The mesh-size field is $h=\operatorname{clip}(C/\sqrt{\rho},1/2048,1/32)$, where $C$ controls the overall mesh size. Derivatives are evaluated by second-order finite differences, with periodic differences in $x$; near-constant predictions use a uniform monitor. Gmsh generates the mesh from this field, followed by the same periodic P1 FEM solver and error evaluator used in the backbone/mesh-generation comparison. Test reference solutions are used only for evaluation. Results below are means over the same 100 test instances, with no additional AFEM correction and $\tau=0.5$ for NVB: | Method | Mesh generator | $C$ | ST rel. $L^2$ | FT rel. $L^2$ | Free DOF | Time (s) | |---|---|---|---|---|---|---| | MeshOp (FNO) | NVB | — | 1.243e-3 | 1.858e-3 | 14869 | 0.458 | | MeshOp (FNO) | Gmsh | — | 8.267e-4 | 1.280e-3 | 15634 | 0.912 | | FNO + gradient | Gmsh | 0.009 | 1.323e-3 | 1.640e-3 | 14270 | 0.903 | | FNO + gradient | Gmsh | 0.011 | 1.943e-3 | 2.353e-3 | 9581 | 0.598 | | FNO + gradient | Gmsh | 0.0156 | 3.985e-3 | 4.717e-3 | 4794 | 0.320 | At $C=0.009$, the solution-guided baseline achieves comparable FEM accuracy at a similar DOF count: its space–time error is slightly higher and its final-time error lower than MeshOp (FNO) with NVB. Its online time is 0.903 s, compared with 0.458 s for the NVB pipeline. When both methods use Gmsh, direct prediction of the AFEM-derived mesh-size field gives lower errors with a somewhat larger mesh and a similar online time of 0.912 s. Increasing $C$ reduces DOFs and online time at the expense of accuracy. Constructing the gradient monitor and size field takes only about 0.001 s, consistent with the expectation that this step is inexpensive. Gmsh mesh generation is the main bottleneck in the current implementation. These preliminary results show that approximate solutions can provide useful mesh guidance. We would like to investigate more efficient ways to realize these solution-derived size fields in future work. [1] Peiyan Hu, Yue Wang, and Zhi-Ming Ma. *Better Neural PDE Solvers Through Data-Free Mesh Movers.* ICLR, 2024.I am grateful to the authors for their careful consideration of my concerns and for addressing them so thoroughly. I can confirm that points 2-4 were addressed completely and that I am also grateful to see the additional baseline experiment performed by the authors and included in Appendix B of the revised manuscript. This experiment is particularly important and valuable as it helps place the advances of the current contribution within the literature.
I have therefore updated my informativeness score to 3 and I am content to keep my overall rating at 3 (weak acceptance). My main remaining concern is that the DMM comparison arguably shows only a limited advantage of the MeshOp framework (relative error from to and time from $\sim$0.6sec to $\sim$0.4sec) which on a single example might not be fully sufficient to warrant the novel methodology. To convincingly compare against baselines, in my opinion the authors would have to also include baseline comparisons in the main experiments shown in the main body of the paper.
In summary, my overall assessment is positive and elevated by the rebuttal, but the remaining concern is for the authors to demonstrate a convincing advantage of their method over baselines across a larger class of problems rather than in one specific instance.
Response to Reviewer LJDV [Part 1]
Thank you for your careful review and encouraging assessment of our work.
Response: We agree that comparisons with learned mesh-adaptation methods are important. We explored several learning-based mesh-adaptation methods as potential baselines. For Adaptive Swarm Mesh Refinement (ASMR), a reinforcement-learning approach, we did not obtain a converged policy after adapting it to our Burgers space–time FEM setting. We therefore selected the data-free mesh mover (DMM) of Hu, Wang, and Ma [1] and added a comparison using its solution-conditioned mesh relocation followed by conventional FEM. DMM is an r-adaptive mesh method that moves existing nodes while preserving their number and connectivity. In our implementation, an FNO first predicts the Burgers solution. DMM uses this prediction to move the nodes of an initially uniform space–time mesh, and the Burgers equation is then solved on the relocated mesh using periodic P1 FEM. The FNO is trained on 3000 instances; DMM is trained on the corresponding numerical solution fields with a physics-based loss, without optimal-mesh labels. At test time, mesh relocation uses only the FNO-predicted solution.
The following results are averaged over the same 100 test instances, with no additional AFEM correction and τ=0.5 for MeshOp (FNO):
At similar DOF counts, MeshOp has lower errors and online cost in this comparison. DMM can reuse solution datasets without requiring AFEM-derived mesh labels. These results are reported in the appendix subsection "Comparison with a learned mesh mover."
[1] Peiyan Hu, Yue Wang, and Zhi-Ming Ma. Better Neural PDE Solvers Through Data-Free Mesh Movers. ICLR, 2024.
Response: Thank you for highlighting these important works on learning-based mesh adaptation, which we overlooked in the original manuscript. Both references are now cited and discussed in Section 2. These additions strengthen the related-work discussion and help clarify the positioning of MeshOp within the existing literature.
Response: We have added an architecture schematic as Figure 1. It shows the functional PDE inputs, the alternative FNO, DeepONet, and CNO backbones, and the predicted refinement field. The inputs are problem data such as forcing, initial conditions, or boundary data, as appropriate to each benchmark. Figure 2 focuses on the complete offline and online workflow, including mesh realization and FEM solution.