- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper proposes MeshFiLM, a lightweight neural operator for approximately solving PDEs with neural networks. Instead of global-local interactions, a single global pooling with node feature-wise modulation (via FiLM) is applied. The papers evaluated on five PLAID dataset and AhmedML.
Critical strengths
the architecture is simple and lightweight the experiments are broad and diverse and include relevant baselines
Critical weaknesses
- On some datasets like 2DMultiscHypEl the single global-pooling step seems to be insufficient and MeshFiLM underperforms
- limited novelty as global-information informed feature processing is not novel by itself and neither is FiLM.
- insufficient justification for FiLM layer. while the global aggregation is motivated, it's not clear why the FiLM is an essential component. Simple residual updates (or low-rank) or concatenation could be potentially even more performant
Questions for authors
How does the method compare against a simple DeepSets or a GNN that globally pools node features and broadcasts the resulting representation through FiLM or concatenation? How does the method perform when changing FiLM to other components such e.g. simple additive or concat+linear layer -based conditioning?
3 comments
Response to Reviewer KC4A (2/3)
W3 and Q: why FiLM? Additive, concatenation, DeepSets and GNN baselines.
Our FiLM head is already a low-rank residual update: , of rank 32, with and initialized to zero so that the decoder starts as a plain MLP. In MeshFiLM-R, is the routed read of the region summaries, concatenated with , the encoding of the sample-level scalar inputs (Eq. 3). Concatenation followed by a linear layer is additive conditioning, , where the added term is a linear function of the context alone. The question therefore has three parts: node-wise head or concatenation, routed pooling or a single global pooling (DeepSets), and whether the multiplicative term matters. We ran the following variants in the MeshFiLM-R pipeline:
- shift only, : our FiLM head with , i.e. a low-rank residual update, still computed node-wise from and ;
- concatenated to the decoder input, or to every block;
- DeepSets + concat: routed pooling replaced by a mean over the nodes (), the pooled vector concatenated, with , to the decoder input of every node (the PointNet design, with mean instead of max pooling);
- DeepSets + FiLM: the same mean-pooled vector, broadcast through our FiLM head, i.e. MeshFiLM-R with .
Table K. Fields only, macro RRMSE (×10⁻³), one seed. Tensile2d: 2000 epochs, as in Table 2; 2D_MultiScHypEl and 2D_profile: 1000 epochs. Every run decays its learning rate over its own budget (on 2D_profile, Table 1 reports 28.14 ± 0.22 for MeshFiLM-R because its equal-epoch values are read from longer runs before the learning rate has decayed). Last column: on each dataset, the relative gap to the lowest error among the six variants with context; we report the largest of the three gaps.
| Pooling | Decoder conditioning | Tensile2d | 2D_MultiScHypEl | 2D_profile | Params (M, Tensile2d) | s/epoch (Tensile2d) | Largest gap to the best |
|---|---|---|---|---|---|---|---|
| Routed, | FiLM, (MeshFiLM-R) | 0.775 | 25.12 | 27.31 | 0.47 | 2.8 | 4.6% |
| Routed, | Shift only, | 0.766 | 24.99 | 26.12 | 0.44 | 2.6 | 2.5% |
| Routed, | concatenated to the input | 0.989 | 24.39 | 26.46 | 0.42 | 2.4 | 29% |
| Routed, | concatenated to every block | 0.828 | 24.52 | 26.26 | 0.50 | 2.4 | 8.1% |
| Mean, (DeepSets) | FiLM | 0.872 | 25.93 | 27.81 | 0.46 | 2.7 | 14% |
| Mean, (DeepSets) | concatenated to the input | 1.054 | 25.01 | 26.20 | 0.42 | 2.2 | 38% |
| None | pointwise MLP (Table 35) | 46.5 | – | – | – | 1.5 |
We draw four conclusions.
- The key contribution is the node-wise conditional modulation itself, computed from and in every decoder layer. FiLM provides the most general affine form of this conditioning; in MeshFiLM-R, a purely additive variant of the same head (shift only) performs similarly on the tested datasets (0.5–4.4% lower error, one seed). We will add these rows to Table 2 and state this in Sec. 2.2.
- Concatenating the context instead is less robust. Both forms of the head are within 5% of the best variant on every dataset. On Tensile2d, concatenating is 8–29% worse than the best variant, and DeepSets + concat (mean pooling, concatenated to the input) is 38% worse; on the two other datasets, concatenation is within 3% of the head, sometimes ahead.
- Routed pooling beats a single global pooling, which answers the DeepSets question. With the same FiLM head, the routed context lowers the error by 11% on Tensile2d, 3% on 2D_MultiScHypEl and 2% on 2D_profile.
- On 2D_MultiScHypEl and 2D_profile, the conditioning is not the bottleneck: every variant with context lies within 6.5% of the others. These datasets are limited by the stresses near the holes (W1) and by the shock, which a second pooling round removes on 2D_profile (25.72 vs. 25.80×10⁻³ for Transolver++; reply to Qy5h, W2).
Response to Reviewer KC4A (3/3)
A GNN that pools globally and broadcasts through FiLM. We added this to MGN, in the same pipeline as our MGN baseline (15 message-passing steps, width 80). After message passing, the node latents of each mesh are pooled once (mean, maximum, standard deviation, as in MeshFiLM-S), and every hidden layer of the node decoder is modulated by the same rank-32 FiLM head, computed from each node's latent and the pooled context. MGN and MGN + FiLM use the same code and budgets as Table K, one seed.
Table L. Fields only, macro RRMSE (×10⁻³), one seed.
| Model | Tensile2d | 2D_profile | Params (M) | s/epoch (Tensile2d) |
|---|---|---|---|---|
| MGN | 2.13 | 50.12 | 0.92 | 32.9 |
| MGN + pooled context through FiLM | 1.60 | 26.78 | 0.97 | 34.7 |
| MeshFiLM-R (Table K) | 0.775 | 27.31 | 0.47 | 2.8 |
The pooled context lowers the error of MGN by 25% on Tensile2d and by 47% on 2D_profile, although MGN already exchanges information along edges in 15 layers: one global summary supplies what local message passing does not. MeshFiLM-R obtains this without message passing. It is 2.1× more accurate than MGN + FiLM on Tensile2d and within 2% of it on 2D_profile, with half the parameters and 12× faster epochs.
Response to Reviewer KC4A (1/3)
We sincerely thank the reviewer for the comments, and we answer the three weaknesses and the question.
W1: 2D_MultiScHypEl.
We agree that the stress results motivate a closer look at this dataset. At the same time, MeshFiLM-R has the lowest macro error of all models on 2D_MultiScHypEl (Table 1). Grouping the fields of Table 12 shows where the remaining gap lies (Table J).
Table J. 2D_MultiScHypEl, RRMSE (×10⁻³), three seeds.
Compared with MGN-Tree, MeshFiLM-R has a 2.4× lower displacement error, trains 15× faster per epoch, and has half the parameters. The two graph networks are more accurate only on the four stress components, by 17–27% (MGN-Tree) and 12–21% (MGN). These stresses concentrate around the holes: message passing along mesh edges reads this local geometry directly, while an edge-free model sees it only through the node features. The gap is local and not a limit of the single exchange. MeshFiLM-R is ahead of Transolver and Transolver++ on every stress component, although they exchange information in every layer, and two or three pooling rounds lower its stress error by only 2% (32.18 → 31.44×10⁻³, one seed), with MGN-Tree still 19% lower.
W2: novelty.
We agree that neither FiLM nor pooling is new in isolation. Our contribution is to show that a single exchange between nodes, followed by node-wise conditioning in every decoder layer, can rival architectures that exchange information in every layer. Three points make this specific.