- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2(+1)
- Soundness
- 2
Read review
Paper summary
This paper introduces Mesh–GENERIC Compatibility (MGC), which combines mesh geometry with the algebraic conditions of reversible–dissipative dynamics. The proposed MAGNS framework learns energy, entropy, and operator coefficients and assembles them into compatible operators before numerical integration. The construction guarantees admissible bulk directions, skew-adjointness, positive semidefiniteness, and energy–entropy degeneracy under the stated assumptions. The experiment results demonstrate competitive rollout accuracy and selective control of circulation through changes in the mesh declaration.
Critical strengths
- The channel assembly provides a constructive certificate that enforces mesh admissibility and the GENERIC algebraic conditions. The paper also carefully distinguishes these guarantees in continuous time from the properties of numerical integration.
Critical weaknesses
-
Figure 1 feels somewhat disjointed, making the overall method difficult to follow.
-
Although Appendix B provides asymptotic cost estimates, the paper does not report runtime or memory comparisons with the baselines. This makes the practical efficiency of MAGNS difficult to assess.
Questions for authors
-
What practical advantages does the supported-completion construction offer over a GENERIC parameterization built directly within the declared admissible subspace, using the induced Hodge metric?
-
What are the computational trade-offs of MAGNS relative to existing graph neural simulators, particularly when scaling to larger meshes?
5 comments
Response to Reviewer aTNg:Q1
Q1. Supported completion versus a direct induced-subspace construction
What practical advantages does the supported-completion construction offer over a GENERIC parameterization built directly within the declared admissible subspace, using the induced Hodge metric?
We appreciate your question about the construction's practical role, and apologize for leaving its relation to direct subspace parameterization unclear. Supported completion places thermodynamic compensation on chosen local supports, giving each channel a motion direction and an exchange location.
1. The induced metric and the completion support serve different purposes. For a basis of the declared admissible space , a direct construction can use to define adjoints and orthogonality, then impose energy–entropy degeneracy. This yields a valid compatible parameterization. With full-range lifts and unrestricted coefficient blocks, Proposition 1 characterizes the same pointwise compatible operator class. A finite model also needs local channels and their couplings. The induced metric defines inner products and adjoints; supported completion constructs directions for those channels.
2. Retain the primary motion and specify where its compensation is received. In a -orthogonal state split , write , where for reversible channels and for dissipative channels. On a receiving support with a nonzero component of , choose such that
P_xC_au \\\\ -r_a\langle g_x,P_xC_au\rangle_G \end{pmatrix},\qquad \langle g_y,r_a\rangle_G=1.$$ The first block retains the selected primary motion; the second cancels its pairing with $g$ on the chosen support, giving $\langle g,A_{F,a}u\rangle_G=0$. Already orthogonal channels need no compensation. For dissipation converted to internal heat, the supports specify which thermal degrees of freedom receive energy, while learned coefficients determine the exchange strength. Channels with different receiving locations can be combined while preserving the algebraic conditions. A direct subspace construction with the same complete local direction family can represent the corresponding operators; supported completion gives a concrete construction of that family. **3. The electromagnetic–thermal experiment tests prediction and local reception.** It combines propagation, temperature-dependent dissipation and local heat reception, without thermal conduction. We report MAGNS, three baselines and three controls. Free op removes direction binding; PostRestrict applies the restriction after full-space assembly; the single-Riesz control replaces local receiving directions with one global thermal direction. All are evaluated on the same validation set at $H=200$. MSE uses common field scales; entries are mean $\pm$ SD. | Method/control | Total MSE | Local thermal-state MSE | |---|---:|---:| | MAGNS (Full) | $(1.57\pm0.16)\times10^{-5}$ | $(1.13\pm0.68)\times10^{-5}$ | | MeshFT | $(3.72\pm0.80)\times10^{-4}$ | $(8.62\pm2.36)\times10^{-4}$ | | Local-TIGNN | $0.01023\pm0.00343$ | $0.02584\pm0.00957$ | | MGN | $0.96311\pm0.04540$ | $0.41296\pm0.14762$ | | free op | $(3.68\pm4.45)\times10^{-4}$ | $(7.86\pm10.96)\times10^{-4}$ | | PostRestrict | $(2.13\pm1.57)\times10^{-5}$ | $(2.43\pm2.34)\times10^{-5}$ | | Subspace, one thermal Riesz direction | $0.35055\pm0.00331$ | $0.95326\pm0.01122$ | The baselines compare prediction performance; the controls change direction binding, assembly order and receiving support. For Full, free op, PostRestrict and the single-Riesz control, the window-mean maximum relative learned-energy drifts are $6.72\times10^{-10}$, $6.71\times10^{-10}$, $1.11\times10^{-8}$ and $1.78\times10^{-3}$, respectively. Every sampled entropy increment is positive in all four groups. The receiving-support difference is clearest in local thermal error. On one training state evaluated with the trained model, the reference frame-averaged thermal rate has relative norm $0.306$ outside the single Riesz direction, whereas the control's corresponding component is only $2.49\times10^{-16}$. This single-Riesz support omits spatial directions present in the reference heating rate, even when algebraic degeneracy holds. Local supported completion retains receiving directions through which the spatial distribution of heat can be learned. The full comparison and mechanism analysis now appear in Section 5.5 and Appendix D.6.Response to Reviewer aTNg:Q2
Q2. Computational trade-offs and larger meshes
What are the computational trade-offs of MAGNS relative to existing graph neural simulators, particularly when scaling to larger meshes?
We appreciate your request to explain computational cost and mesh scaling, and apologize for the incomplete discussion. W2 reports costs on the 16,384-cell CFD grid. The controls below separate the costs of constitutive learning, compatible dynamics execution and time integration.
1. Constitutive flexibility versus differentiation cost. State-dependent neural functionals reduce reliance on a prescribed analytic form for unknown or complex coupled relations. The network can change the functional's shape across states, but training differentiates through its state derivatives. When a chosen functional family is adequate, one can instead learn coefficients from fixed geometry or material conditions and compute state derivatives analytically. The coefficients remain fixed during rollout, while energy, entropy and dynamics vary with the state. The coefficients are learned, may remain state-dependent, and both forms use the same compatible assembly.
A 128-node Timoshenko–Fourier thermoelastic control uses shared constitutive priors, fixed inputs, one-step Heun and batch size one. Replacing neural functionals with static coefficients reduces forward/backward time from 6.35 to 1.78 s, rollout from 35.73 to 7.07 s, and training peak memory from 695.14 to 91.87 MiB. As in the CFD example in W2, changing the constitutive form changes differentiation cost while preserving the assembly construction.
2. Per-call cost must be read with accuracy and structural capability. On the 512-cell electromagnetic–thermal task, MAGNS and MeshFT both use RK4 with two substeps per frame, hence eight RHS calls. Same-GPU measurements with matched inputs, float64 and batch size one give rollout times of 37.47 and 9.27 s, and training peak memory of 1,738 and 115 MiB. Each RHS call includes network computation, functional differentiation and operator application, so equal call counts can still give different runtimes.
The final three-seed results for this task in Q1 give total MSEs of and , and local thermal-state MSEs of and , for MAGNS and MeshFT respectively. The additional computation thus accompanies approximately 95.8% lower total error and 98.7% lower local thermal error, while retaining MAGNS's declared direction and energy–entropy compatibility. MGN's direct increment avoids multistage execution; its prediction results are in Q1. Model choice depends on this cost difference together with the required accuracy and structural properties. MGC fixes the compatibility conditions while leaving the constitutive form, network size and integrator adjustable. The static coefficients in W2 are one way to reduce cost.
3. Changing the integrator for the same model. Holding weights, initial state, mesh and forecast interval fixed, a 512-node MeshFT thermoelastic model gives MSE with either RK4 at eight substeps per frame or adaptive RK45, using 640 and 980 RHS evaluations, respectively. A separate control fixes a MAGNS model and one window. RK4 with four substeps per frame is unstable; implicit midpoint at the same step size gives MSE and maximum relative learned-energy drift , using 592 RHS evaluations. The first control reaches similar accuracy with different RHS counts; the second obtains stable integration through additional nonlinear solves. Runtime therefore depends on the method, substep count and cost of each RHS call.
4. Two effects of mesh refinement. More nodes and edges increase message passing, activation storage and channel application. Frequencies resolved by the spatial discretization also affect explicit stability limits and implicit iterations. MAGNS applies factorized operators without forming dense state-space . A rank- channel on coordinates costs with a dense coefficient block, plus projection and functional differentiation. Mesh refinement can therefore increase both the cost of one operator application and the work needed for time integration. Generalization across resolutions also requires consistent approximations on different discretizations. Combining compatible dynamics execution with graph operators offers a way to study physical constraints and discretization consistency together.
Response to Reviewer aTNg:Critical Weaknesses W1-W2
Dear Reviewer aTNg
We appreciate your recognition of the constructive compatibility certificate. We have clarified the computation and the role of supported completion, and added runtime and memory measurements.
Critical Weaknesses
W1. The computational flow in Figure 1
We apologize that the original figure left the relationship between its branches unclear, and appreciate your pointing this out. We have redrawn Figure 1 and revised its caption (p. 2) to follow constitutive learning → compatible assembly → time integration, so the reader can trace how the readouts produce a state update.
1. Constitutive learning: what the network predicts. The network reads energy E, entropy S and operator coefficients K,R from the shared representation χ. These quantities enter operator assembly; the mesh declaration supplies the metric, admissible directions and completion supports.
2. Compatible assembly: how the readouts determine the dynamics. The entropy gradient determines the supported lift AS for the reversible channel; the energy gradient determines AE for the dissipative channel. We assemble
M=\sum_b A_{E,b}R_b A_{E,b}^{\dagger}.$$ The coefficient blocks $K_a$ are skew-adjoint and $R_b$ are positive semidefinite. The lifts lie in the declared admissible space and enforce $L\nabla S=0$ and $M\nabla E=0$. The assembled $L$ acts on the energy gradient and $M$ on the entropy gradient, giving $L\nabla E+M\nabla S$. The gradients therefore have two roles: they impose orthogonality during lift construction and drive motion when the operators are applied. The revised diagram labels these relationships at the supported lifts, operator factorizations and continuous vector field. **3. Time integration: from vector field to trajectory.** Boundary ports enter the vector field before the integrator advances it to $z_{t+1}$. The next state returns to the input for the following frame, completing the autoregressive loop. Q1 explains how the supported lifts specify motion directions and energy reception. ### **W2. Measured runtime and memory** > Although Appendix B provides asymptotic cost estimates, the paper does not report runtime or memory comparisons with the baselines. This makes the practical efficiency of MAGNS difficult to assess. We appreciate your request for measured costs, and apologize for omitting them from the original manuscript. **For structured dynamical GNS, runtime and memory depend on the constitutive representation, operator execution, integrator and substep count.** Neural functionals require differentiation; substeps, implicit solves and recomputation also affect accuracy, time and memory. Our original Appendix B therefore focused on assembly's asymptotic cost, separating it from these constitutive and numerical choices. We now complement that analysis with end-to-end measurements under specified configurations on a larger CFD mesh. **Native $128\times128$ grid, comprising 16,384 spatial cells.** We compare MAGNS with neural functionals, MAGNS with static learned coefficients, and MeshFT. All use effective batch size eight and 4,500 updates, followed by $H=20$ evaluation on the same validation set. | Method/constitutive form | H20 MSE | Full training time (h) | Peak training memory (GiB) | |---|---:|---:|---:| | MAGNS, neural $E/S$ functionals | 0.23157 | 7.97 | 19.60 | | MAGNS, static learned coefficients | 0.23139 | 3.78 | 2.59 | | MeshFT | 0.24498 | 2.45 | 0.554 | Each entry is a complete run with the same training seed, and all validation windows finish. Runtime covers the full training budget; memory is peak allocated CUDA memory. MAGNS uses Heun and MeshFT uses exponential midpoint splitting, each with one substep per frame. The comparison thus includes each model and its integrator. **Controlled constitutive measurement.** On the same CFD grid, holding training inputs, effective batch size eight and Heun fixed, static coefficients reduce mean time over the first ten $H=1$ updates from 2.797 to 1.662 s, and peak memory from 4.949 to 1.162 GiB. This fixes the inputs and time-stepping method to isolate constitutive cost, while the table captures resource use over the full curriculum. Both MAGNS forms use the same compatible assembly and achieve prediction errors near 0.23 over the complete validation set. For this CFD task, static learned coefficients reduce training cost while retaining compatibility and comparable accuracy. MeshFT provides the structured-baseline comparison on the same task. We will include these configurations, errors and measured costs in the revision. Q2 uses controlled thermoelastic and electromagnetic measurements to explain where the costs arise.