- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
In this paper, the authors propose a dynamic Riemannian graph foundation model that models structural knowledge using a learnable curvature spectrum. The method uses a designed graph transformer to learn mixed-curvature representations. Experiments on various tasks demonstrate the effectiveness of the proposed approach.
Critical strengths
S1. This paper is well-motivated.
S2. Experiments show that DRGFM achieves the best model quality in most cases.
S3. The method is clearly described.
Critical weaknesses
W1. Some recent geometry-based GFM baselines are missing.
W2. The experimental results lack sufficient explanation.
Questions for authors
Q1. In the experimental section, the authors use some recent baselines. However, recent geometry-based baselines (e.g., R-GoG [1] and GAUGE [2]) are missing, which also improve the model quality based on Riemannian geometry. Could the authors add a comparison with these baselines to better demonstrate the effectiveness of the proposed method.
Q2. In some cases, the proposed method falls behind the baselines. For example, in Table 1 (training on Facebook), DRGFM is not better than GCOPE and GraphAny. Could the authors provide the deeper explanation for these results.
[1] Learning Graph Foundation Models on Riemannian Graph-of-Graphs. ICML 26
[2] Are Common Substructures Transferable? Riemannian Graph Foundation Model with Neural Vector Bundles. ICML 26
3 comments
Revision available: R-GFM/GAUGE comparisons and Facebook discussion
Thank you again for your constructive review. The uploaded revision incorporates the results and discussion reported in our rebuttal. For easy reference:
- Q1: recent geometry-based baselines (Section 6.2, Tables 1-2). We added R-GFM, from Learning Graph Foundation Models on Riemannian Graph-of-Graphs, and GAUGE under the same source graphs, training-step budget, and evaluation protocol. DRGFM has higher mean performance than both additions in all eight NC and eight LP entries across the four targets.
- Q2: Facebook results (Section 6.2; Appendix J, "Task-dependent results"). We now explicitly discuss the settings where DRGFM trails GCOPE or GraphAny. Classification depends on alignment with target classes and support labels as well as structural transfer; we present this as a plausible interpretation, not an established causal explanation. Tables 5-6 also show that the proposed components improve Facebook NC within the controlled architecture, while the discussion avoids claiming uniform superiority across methods or tasks.
Could you briefly confirm whether these additions address your two concerns, or indicate any point that still needs clarification? Even a short response would help us understand whether further clarification is needed during the remaining discussion period.
Thank you for your response. My concerns are fully addressed. I have improved the overall score.
Added R-GFM and GAUGE comparisons and explanation of domain-dependent results
Thank you for the positive assessment and for suggesting recent geometry-based GFMs. We added R-GFM and GAUGE comparisons and clarified the domain-dependent results.
1. Comparisons with the suggested methods. We evaluated R-GFM, from Learning Graph Foundation Models on Riemannian Graph-of-Graphs, and GAUGE, from Are Common Substructures Transferable? Riemannian Graph Foundation Model with Neural Vector Bundles. Both use the same five source graphs, training-step budget, and evaluation protocol as DRGFM; targets are unseen during pretraining.
The tables report mean±SD. NC uses 100 episodes with N=min(5,C); LP uses 10 negative-sampling runs. Target test edges are excluded from representation computation, and zero-shot LP uses no target parameter updates.
DRGFM has the highest mean in all eight NC and eight LP entries against these two additions. We will incorporate these results and the protocol details into the experimental discussion.
2. Why does DRGFM not lead every Facebook NC setting? Facebook is an unseen target, not a pretraining source; only episode support labels are used for adaptation. In 1-shot NC, DRGFM (.4671) is below GCOPE (.4852), but above GraphAny (.4365). In 5-shot, DRGFM (.5936) is below GraphAny (.6122) and SAMGPT (.6111), and close to GCOPE (.5922).
Our curvature-spectral interface learns structural representations, while NC also depends on alignment with target classes and sampled support labels. Better structural transfer need not yield the best class boundary in every setting. GCOPE's cross-domain graph composition and GraphAny's classification-oriented design provide different inductive biases. This is a plausible interpretation, not a measured causal explanation for Facebook.
The controls give within-architecture evidence: on Facebook, fixed Forman reduces 1-/5-shot accuracy from .4671/.5936 to .4050/.5379; generic edge weighting gives .3630/.4375, and removing spectral bias gives .3247/.3898. Thus, the proposed components improve Facebook classification within a controlled architecture even though DRGFM does not lead every alternative pipeline. DRGFM reaches .9820 AUC and .9848 AP in zero-shot LP on Facebook, illustrating that relative performance depends on task as well as domain. We will revise the discussion to state both the gains and remaining variation without claiming uniform superiority.