- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposed GI-RBF, a decoupled offline-online framework that uses Gaussian EBF to represent PDE solutions. The method includes a task conditioned generative initializer to predict the RBF parameter set which includes the coefficients, centers, scales, orientations and geometry. In the offline stage, the initializer is trained with solution supervision with short physics based optimization trajectories. In the online stage, its predictions are further refined through steps of physics-informed optimization. Experiments were conducted on four PDE families and a flow-mixing problem. With a matched online refinement budget, their method improves over PINN parameter methods and standard RBF initialization.
Critical strengths
1.The framework shows good compatibility with different backbone architectures: MGN, MGN-Tree, MiSE-GNN, Transolver, making it a useful wrapper beyond specific GNN designs. In addition the experiment coverage and scope are comprehensive: different PDE domains and multiple CFD and CSD datasets AND varying geometry 3D surfaces. The examination of local physics such as shock, force, stress are very helpful information to analyze the tradeoff inherent in this method.
2.The pipeline depends heavily on FiLM, thus the controlled experiments of Field-FILM was informative in isolating the effect of hidden state transfer. Other analysis experiments were also helpful, especially the fidelity sweep (table 2-3) offers insight into the tradeoff between finer and coarse mesh information propagation.
3.The paper provides a detailed analysis of computational cost. Information including inference latency, preprocessing overhead are helpful in clarifying the computation requirement of the method.
Critical weaknesses
1.The novelty of the method might be limited. There have been multiple prior methods that used low-fidelity or latent propagation with fine reconstruction for high resolution mesh solution. The author will need to elaborate on the technical contribution compared to existing work.
2.In attributing the gain to hidden-state transfer, the author compared against the hidden representation and the physical output. However this experiment also changed the representation bandwidth (80 channels versus a few fields), so it is unsure whether the benefit of hidden state is that it transfers much more information.
3.The claim that coarse mesh can expand on fixed message-passing depth needs more investigation. Coarsening simultaneously changed multiple elements such graph connectivity and regularization, thus a better accuracy might not be directly attributed to the receptive field.
4.The coarse-to-fine reconstruction can lose important localized physical information. The robust alignment method in the paper can only address the error when interpolating coarse hidden states back to fine nodes, but not when coarsening the original mesh. This limitation is also reflected in the high Mach error in Table 4. Although the global RMSE improvement is valid, the degradation in local physical quantities may limit the application of the method in many settings.
Questions for authors
1.Compared with existing coarse-to-fine latent methods like GINO, UPT, Multiscale MeshGraphNets, what is the new technical contribution that MUFI made and how does it differ from existing work?
2.Since the hidden-state-transfer experiment also changed representation bandwidth, can the author add a controlled experiment while controlling the representation dimension?
3.Can the author compare propagation on the coarse mesh to a fine-resolution GNN with long-range edges, hierarchical shortcuts or more propagation depth? I am curious about why a coarser propagation can improve accuracy compared with the fine-mesh backbone, more direct evidence will strengthen the paper claim.
4.I am also wondering if there are potential conflicts between the fine and coarse supervision training objective? Table 31 shows that the auxiliary coarse loss can improve accuracy, however these two objectives might not always be aligned. Can the author discuss this point further or provide a sensitivity analysis?
5 comments
Response to Reviewer AfQr (2/3)
Q2 / W2. Bandwidth-controlled comparison.
Thank you for this suggestion. In Table 1, each model predicts a single field, so Field-SR-FiLM transfers 1 channel and MUFI 80: the comparison changes both the content (post-readout prediction vs pre-readout state) and the width of the transferred representation. To separate the two, we ran a bandwidth-controlled variant in the Table 1 setting. A second head, with the same architecture as the native readout, maps to a single channel. This channel receives no coarse loss and is free to encode any information, while the native readout keeps its coarse loss. The 1-channel state is then aligned and fed to the same FiLM decoder. It has the width of Field-SR-FiLM and the content of a learned pre-readout state. We also tested an 8-channel linear projection of .
Table R4. 2D_Profile, MiSe-GNN, L3, Temperature RRMSE, mean ± std over three seeds. Same coarse mesh, alignment, decoder and protocol.
| Transferred to the decoder | Content | Width | RRMSE |
|---|---|---|---|
| (Field-SR-FiLM) | coarse prediction | 1 | 0.01836 ± 0.00088 |
| learned 1-channel head on | pre-readout state | 1 | 0.01591 ± 0.00056 |
| linear projection of | pre-readout state | 8 | 0.01502 ± 0.00076 |
| (MUFI) | pre-readout state | 80 | 0.01507 ± 0.00054 |
The key result is that a learned 1-channel state, with exactly the bandwidth of Field-SR-FiLM, already recovers 74% of MUFI's gain over it (13.3% lower error than the coarse prediction). Eight channels recover all of it. In this setting, the gain therefore comes mainly from what is transferred: a state learned for fine reconstruction, rather than one constrained to be the coarse prediction. We will add this control to Section 4.2.
Q3 / W3. Why can coarse propagation improve accuracy?
All three requested variants are addressed: hierarchical shortcuts and added edges by two fine-resolution baselines already in Table 2, and greater depth by a reach analysis. MGN-Tree adds hierarchical shortcuts (multiscale tree edges; Ripken et al., 2023), and MiSe-GNN augments the fine graph with error-guided edges (Nguyen et al., 2026). Both extend communication beyond MGN's mesh edges at the same 15 steps, and MUFI still improves both (MGN-Tree on 4/4 datasets, MiSe-GNN on 3/4). For greater depth, we measured reach directly (Table R5): on VKI-LS59, 30 steps on the original mesh still reach less far than 15 steps at L3. Doubling the depth would also roughly double the processor cost of full-resolution MGN, which is already 4.3× slower per epoch than MUFI-MGN (153.86 s vs 35.90 s).
Table R5. Reach of message-passing steps on the mesh graph, VKI-LS59. Median over 1,000 source nodes per mesh, 168 meshes.
| Mesh (nodes) | Steps | Reach radius / chord | Domain area reached |
|---|---|---|---|
| Original (36.4k) | 15 | 0.13 | 2.5% |
| Original (36.4k) | 30 | 0.26 | 8.5% |
| L3 (4.3k) | 15 | 0.29 | 17.6% |
For message-passing backbones, the evidence supports reach as one factor. Besides Table R5, the three GNNs differ substantially at full resolution on VKI-LS59 Mach (0.0322, 0.0217, 0.0190), whereas their L3 MUFI variants converge (0.0141, 0.0135, 0.0139): the spread shrinks from 0.0132 to 0.0005, consistent with reduced under-reaching (Section 4.3). Reach is not the only factor, however. MUFI also improves Transolver (−11.7% to −40.6%, Table 2), which attends globally at every resolution, and decoder capacity alone does not explain the gains: the full-resolution backbone with the same FiLM decoder remains worse than MUFI (0.01797 vs 0.01507 in the Table 1 setting). As you point out, coarsening also changes the graph connectivity and the regularization; our experiments do not separate these effects. We will revise Section 4.3 to present reach as one supported factor for message-passing backbones and to state this limitation.
Response to Reviewer AfQr (3/3)
W4. Loss of localized information through coarsening.
The alignment is not meant to compensate for coarsening: it transports the backbone state to the fine mesh, while the fine geometry reaches the decoder directly, through the coordinates and input features (node type, signed distance) of every fine node (Eq. 2). Coarsening therefore sets the resolution of the propagation, not the geometric information available for reconstruction, and the level is chosen like the mesh density of a numerical solver. Its effect on local quantities is measurable and positive in most cases: all models are trained on the global field loss and the local diagnostics are used for evaluation only, yet at the levels of Table 2, MUFI improves 35 of the 52 local diagnostics of Tables 20–23. This includes the high-gradient Mach error for all four backbones on VKI-LS59 and for the three GNNs on 2D_Profile. The Mach case you point to in Table 4 is specific to Transolver on 2D_Profile. A likely explanation (Section 4.4) is that Transolver already attends globally, so coarsening removes resolution near the shock without a gain in reach, whereas the message-passing backbones improve the same quantity on the same mesh. Where a local quantity matters, the level can be selected for it on the validation split: in our reply to Reviewer Fq47 (W3, Table R3), this rule keeps full resolution in that case and selects coarser, faster levels where the quantity is preserved.
Q4. Possible conflict between the fine and coarse objectives.
The coarse loss is not required by the interface; it regularizes the state passed to the fine decoder. The two targets come from the same solution: is the fine ground truth interpolated to the coarse nodes (Section 3.1), so both losses can be zero at the same time and the targets themselves do not compete. The losses also act on different outputs: reaches only through the readout, so the transferred state is anchored to the physical solution without being forced to equal the coarse field. Forcing it, as Field-SR-FiLM does, is less accurate, even at equal width (Tables R1 and R4). Table 31 supports this role. The coarse loss improves all four decoders, and most for the FiLM and cross-attention decoders (−25% and −20%, versus at most 3% for the others), which condition most directly on the transferred state. The same untuned weights, , are used in every experiment of the paper, and we see no sign that the two objectives work against each other at this weighting. We will add a sweep of the weight to Appendix F.6 and discuss this point in Section 3.5.
Response to Reviewer AfQr (1/3)
We sincerely thank the reviewer for the clear and well-targeted questions.
Q1 / W1. Difference from GINO, UPT and Multiscale MeshGraphNets; main contribution.
The three methods are new end-to-end architectures, whereas MUFI is a wrapper around an existing one. Technically:
Because MUFI is a wrapper, these architectures are not alternatives to it but possible backbones for it. Each provides what MUFI requires from a backbone, a hidden state at every node before the readout (Section 3). Within MUFI, GINO, UPT or Multiscale MGN would run unchanged on the coarse mesh, keeping its own internal compression, and MUFI would transfer its pre-readout state to the original mesh. The closest tested cases are in Table 2: MUFI improves the multiscale MGN-Tree on all four 2D datasets, and Transolver, which attends over a compressed set of learned tokens as UPT does, on all four 2D datasets and on Rotor37 (Table 5).
The two parts of the contribution are linked. The primary contribution is the controlled finding of what to transfer when an unchanged backbone is moved to a coarse mesh: a learned pre-readout state rather than the coarse prediction (Table 1, new Tables R1 and R4). The backbone-agnostic wrapper is what makes this finding reusable as an accuracy–cost knob (Table 2, Rotor37). The alignment operator and FiLM decoder are the design choices that make the interface work and are ablated (Table 6), but we do not claim them as standalone contributions.