- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper introduced a multiscale GNO for score-based diffusion models on an infinite-dimensional function space. It uses a resolution-invariant convolution kernel to build a bilinear finite-element function on a fixed reference patch. For a given patch, it projects its neighbors on the mesh onto its coordinate frame. It uses a hierarchical mesh architecture with a latent diffusion transformer. Both unconditional and conditional generation are evaluated in this paper on four benchmark datasets across different metrics.
Critical strengths
-
The core methodology (FEM-Conv) of this paper has a rigorous theoretical guarantee. The propositions in the paper demonstrate that its construction is a generalization of the standard convolution and can converge under mesh refinement, with a guaranteed computational complexity of O(4|N(i)|) operations per node at any filter size.
-
The method proposed by the paper achieves the best SWD and MMD across all tested resolutions, including those that are OOD, as shown in Table 1. This is strong evidence of the effectiveness of this resolution-invariant representation,
Critical weaknesses
-
The method only clearly wins on the synthetic uniform mesh (the GaussianBlobs data). On non-uniform or externally sourced datasets, the method is only second-best on unconditional MMD/SWD. Also, for the DPS conditional-sampling metrics, the method fails 3/4. On the big picture, this is concerning, because the clearest win only comes from the regime where discretization invariance matters the least.
-
On DeepJEB, there is a huge performance gap between the proposed method and the supervised baselines. While I acknowledge the distinction between the generative paradigm and the supervised paradigm, I am still not convinced why the generative paradigm is more ideal, since the task already has a single ground-truth field for each bracket.
Questions for authors
-
Even though MINO is using mean aggregation, why does it still outperform GRIFDIR on non-uniform meshes? It is hypothesized in the paper that this mean aggregation strategy would hurt MINO's performance on non-uniform Cylinder Flow meshes, but the results on the non-uniform GaussianBlobs test say otherwise. Does the lumped quadrature weight in GRIFDIR introduce another type of bias on a graded mesh? I am trying to understand under what circumstances the quadrature-based design in this work would actually help.
-
Please provide a brief sensitivity analysis on the model with regard to the covariance operator C and the noise schedule. Even though this is marked as future work in the manuscript, having those would help understand the robustness of the current hyperparameter choice.
4 comments
Final quick summary
Hi Reviewer Pvk6, thanks again for the review. Here's a quick summary of our rebuttal, we'd really appreciate a quick reply before the discussion closes on the 18th.
You asked why MINO beat us on non-uniform meshes: your question led us to a bug in our quadrature normalisation. With it fixed, GRIFDIR gets 0.079 mean MMD on the graded meshes against 0.116 for MINO, over five training runs each (Tables 1 and 10). We feel this supports our argument that proper quadrature is a necessary aspect for mesh transfer and has led to improved performance in our model.
Thank you for your careful rebuttal, which has addressed most of my concerns. I am happy to raise my score.
Thank you for the discussion and for raising your score. Your questions led to changes that improved our paper, and we appreciate the review.
Thanks a lot for your review! We're glad you find our core methodology to have rigorous theoretical guarantees, and find the evidence of of the resolution invariant representation to be strong. We address your critical weaknesses and questions below.
Weakness 1 and Questions 1 (Quadrature and Performance): Thanks for the question. You're right, our quadrature computation was slightly incorrect leading to a bias of sorts. Please refer to our General Response for details. After updating this, we see that the quadrature based design indeed significantly improves results on the graded meshes over MINO. The fix also substantially improves transfer to unseen discretisations on Pinball and the unconditional metrics on CylinderFlow.
Weakness 2 (DeepJEB). We would like to comment generative models are an established tool in scientific machine learning for tasks such as full-state reconstruction from sparse measurements, and this is the setting GRIFDIR targets. We agree with the reviewer that for predicting a single stress field, a supervised operator with a specialised architecture such as GINOT works best. DeepJEB is also a difficult target: the stress field changes sign sharply and locally, which a pointwise error punishes heavily. We have nonetheless improved our results, with the fixed quadrature and Fourier positional encodings (e.g. 0.645 → 0.587 at 6k nodes). We also now report the average of four samples for each bracket and sparse-sensor reconstruction with DPS (e.g. 0.615 → 0.470 with 10% of the nodes observed at 24K nodes). Both improve the prediction, and the second uses measurements without any retraining, which the supervised baselines here are not built to do. However, the main aim of the DeepJeb experiment was to show that the method scales to 3D, and we keep it in the paper for that reason.
Question 2 (Ablations for covariance and noise scheduling): We trained the Pinball model with the covariance length scale ℓ=0.01,0.05,0.1,0.2,0.5. The default of the paper was ℓ=0.1, following the setup in [1]. We see that for the Pinball dataset actually ℓ=0.2 gives slightly better results. We have included these results in the revised paper in Section F.2 Ablations.
For the noise schedule, we use the standard variance-exploding schedule of Karras et al. [2]. We agree that tuning the schedule is interesting, and optimal schedules for diffusion models are still an open research question, so further gains are likely. However, the schedule is a property of the forward SDE and sampler, not of the score network. Our contribution is the backbone: a score model architecture that makes the theoretical advantages of infinite-dimensional diffusion usable in practice. We therefore keep the schedule fixed, and identical across all baselines, so that differences in performance reflect the architecture alone.
[1] Yao et al. "Guided Diffusion Sampling on Function Spaces with Applications to PDEs" (2025)