- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper presents PACE, a physics-aware mesh coarsening framework. A gnn predicts edge-wise coarsening scores and a topology-constrained parallel edge-collapse procedure applies the predicted coarsening. The training objective is motivated by error equidistribution. The paper evaluates the method on steady and transient PDE problems, including flow cases, and reports solution errors, rollout RMSE, coarsening ratios, and runtime comparisons against learned and QEM-based baselines.
Critical strengths
- The paper addresses a practical problem: reducing mesh size while preserving the accuracy of downstream PDE simulations. Incorporating physical-field information into edge selection is a reasonable direction.
- The evaluation covers multiple PDE settings and reports both numerical accuracy and computational efficiency. The comparisons with learned coarsening baselines and QEM variants provide some evidence that the proposed approach can be useful.
Critical weaknesses
-
The form is motivated by a general interpolation-error estimate, but the paper does not show that this proxy tracks actual post-coarsening error or report its correlation with PDE solution error. The value and selection procedure for gamma are also unclear.
-
The paper reports 60 training samples across four PDEs, but does not provide the sample count for each PDE or explain how samples are split by equation, initial condition, and mesh instance.
-
QEM baselines are evaluated only on steady-state problems. In the large-scale CFD experiments, MeshGraphNet does not reach the target coarsening ratio, so the main comparison is against uniform coarsening. It is therefore unclear whether PACE remains better than other learned methods at the same mesh size.
-
The runtime results are ambiguously reported and strongly scale-dependent. Table 2 reports only “10k-level” and “1k-level” meshes, without exact vertex or element counts. One row labels both meshes “10k-level,” despite a nearly twofold difference in solve time. The total speedup also ranges from 1.07× at the 10k scale to 18.75× at the 100k scale. Exact mesh sizes and per-seed results are needed to assess these claims.
-
Text and labels in several figures are too small to read, which makes the results difficult to interpret, please improve the figure layouts and increase the font sizes to make all text and labels legible
Questions for authors
- Could the authors clarify the theoretical connection between the error proxy and the actual post-coarsening error, and provide sensitivity analyses for key hyperparameters,?
- Could the authors report the sample counts and data splits for each PDE, as well as the exact numbers of vertices and elements before and after coarsening in Table 2?
3 comments
Author response to reviewer pNtm
We thank the reviewer for the thoughtful feedback. Below, we provide our responses to the weaknesses (W4 to W5) and questions (Q2) raised in the review.
Response to W4
Thanks for your comment. We have revised Table 2 to report the exact numbers of triangular elements before and after coarsening. The updated results are reproduced below.
| Dense elems. | Coarse elems. | Coarsening (s) | Dense solve (s) | Coarse solve (s) | Solve speedup | Total speedup |
|---|---|---|---|---|---|---|
| 14,516 | 8,715 | 11.56 | 27.68 | 14.26 | 1.94× | 1.07× |
| 25,886 | 15,567 | 18.15 | 55.51 | 28.63 | 1.94× | 1.19× |
| 173,208 | 10,315 | 102.83 | 3,250.28 | 147.52 | 22.03× | 12.98× |
| 248,924 | 5,446 | 142.40 | 4,241.92 | 83.84 | 50.60× | 18.75× |
We have clarified the timing definitions in Appendix E.3. The total speedup is calculated as the dense-mesh solve time divided by the sum of the coarsening time and coarse-mesh solve time. The pre-solve time is reported separately, as the calculation assumes that the coarse input trajectory is available.
Response to W5
Thanks for your comment. We have revised the layout of all figures and enlarged the font size of text and labels to ensure readability. Please refer to the revised manuscript.
Response to Q2
Thank you for this suggestion. The per-PDE sample counts and the 36/12/12 split are added in Appendix D.1 and detailed in Response to W2. The case-level grouping preserves temporal frames, paired solutions and mesh instances within each subset.
The current Table 2 (detailed in Response to W4) lists exact triangular element numbers before and after coarsening for all four configurations, along with uniform coarse-mesh solve time and PACE timing results. We have clarified the statistical aggregation of timing results in the table caption.
Thank you for the response. However, I believe the paper still has the following issues:
- You use an interpolation-based proxy to drive the training objective. However, the rebuttal does not empirically demonstrate that this proxy correlates with the actual post-coarsening PDE solution error. Furthermore, the requested sensitivity analysis for the hyperparameter is missing.
- In the large-scale airfoil experiment, MeshGraphNet fails to reach the same target coarsening ratio as PACE. Comparing errors at different mesh sizes is unfair.
- Due to the significant differences in coarsening ratios across configurations, the runtime speedups vary drastically. Although the authors updated the exact element counts in their response, a comparison at a fixed coarsening ratio is still missing.
Although the authors added an appendix using Cea's lemma to justify the theoretical connection, it only covers linear coercive elliptic problems with conforming P1 elements and does not fully cover the experimental cases in this paper. The lack of empirical correlation between the proxy and actual error remains a critical flaw.
Given that the theoretical justification and the mentioned experimental issues remain unresolved, I maintain my rating of weak reject.
Author response to reviewer pNtm
We thank the reviewer for the thoughtful feedback. Below, we provide our responses to the weaknesses (W1 to W3) and questions (Q1) raised in the review.
Response to W1 and Q1
Thank you for your comment. We agree that the interpolation-based motivation alone does not establish whether the proxy accurately reflects the error after coarsening. To clarify this connection, we have added Appendix B.3 to explain the connection using a linear coercive elliptic problem. For conforming piecewise-linear finite elements, under standard solution regularity and mesh regularity assumptions, Cea's lemma and interpolation estimates bound the coarse-mesh solution error through the interpolation accuracy of the coarse mesh. The discrepancy from the fine-mesh reference further satisfies the triangle inequality:
\leq \lVert u-u_h\rVert_{H^1(\Omega)} + \lVert u-u_H\rVert_{H^1(\Omega)}.$$ Here, $u$ is the exact solution on the computational domain $\Omega$, while $u_h$ and $u_H$ denote the conforming piecewise-linear finite element solutions on the fine and coarsened meshes, respectively. The notation $\lVert\cdot\rVert_{H^1(\Omega)}$ denotes the standard $H^1$ norm. The local gradient interpolation error depends on the element diameter and the local second-order variation of the solution. PACE defines the target edge length as $\hat l_e=s_e\bar l_e$, where $\bar l_e$ is the local reference length and $s_e$ is the predicted size factor for edge $e$. If the realized element diameter $h_K$ is bounded by a constant multiple of the target length, the local interpolation estimate gives $$\lvert u-I_Hu\rvert_{H^1(K)} \leq C_{\mathrm{int}}c_l \left( \bar l_e \lvert u\rvert_{H^2(K)} \right)s_e.$$ Here, $I_Hu$ is the piecewise-linear interpolant on the coarse mesh, $K$ denotes a coarse element, and $\lvert u\rvert_{H^2(K)}$ measures the local second-order variation. The constants $C_{\mathrm{int}}$ and $c_l$ are independent of the element size and predicted size factors, respectively, under the stated assumptions. This bound relates the local approximation error to the solution variation and the size factor, providing an interpolation-based motivation for the proxy $\widetilde E_e=\eta_e s_e^{\gamma}$. Here, $\eta_e$ is the normalized local physical indicator combining first- and second-order variations, and $\gamma$ controls the influence of the predicted size factor. # Response to W2 Thank you for your insightful comment. The 60 samples constitute the complete dataset used for model development, with 36 samples for training, 12 for validation, and 12 for internal evaluation. We have added the per-PDE breakdown in Appendix D.1, as shown below. | Governing equation | Total | Training | Validation | Internal evaluation | |:---|---:|---:|---:|---:| | Burgers | 12 | 8 | 2 | 2 | | Pressure diffusion | 12 | 8 | 2 | 2 | | Scalar advection-diffusion | 18 | 10 | 4 | 4 | | Vector wave | 18 | 10 | 4 | 4 | | Total | 60 | 36 | 12 | 12 | For each PDE, we split the samples by physical case. All temporal states and mesh instances associated with the same initial condition are assigned to the same subset. # Response to W3 Thanks for your comment. Classical QEM evaluates geometric distortion at a given mesh configuration through quadric error metrics. Extending this formulation to transient problems requires additional rules for aggregating physical information across time and incorporating it into the collapse cost. Therefore, We only evaluate the QEM baselines on steady-state problems, where the spatial physical field is used to guide coarsening. The large-scale evaluation also includes a comparison with MeshGraphNet in the FX63137 airfoil experiment at an angle of attack of 15 degrees, as shown in Figure 4(b). The pressure-error curves show that PACE maintains lower relative $L_2$ errors than MeshGraphNet and uniform coarsening across the saved steady-solver iterations after initialization. At the final saved iteration, the errors are approximately 12% for PACE, 83% for MeshGraphNet, and 69% for uniform coarsening, as estimated from the plotted curves. The mesh visualization further shows that PACE preserves finer resolution near the airfoil while applying stronger coarsening in the far field. The timing results in Figure 4(b) show that PACE requires 20 coarsening rounds, compared with approximately 53 for MeshGraphNet, and achieves a lower recorded coarsening time.