- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper focuses on multimodal graph foundation models. The novelty is the paper proposes ICE based on Clifford Algebra. It puts text and image into independent basis. During graph propagation, it uses geometric product to generate high-grade relations. Moreover, instead of global pooling, ICE saves all layers and grades into a feature bank. Thus, downstream tasks can take what they need. The author showed ICE achieves SOTA performance
Critical strengths
-
The motivation of this model design is very reasonable. Most multimodal graph models just pool everything into one final vector, and this will easily destroy the original node semantics. The author propose an idea to keep a complete grade-depth bank and let downstream tasks choose what they need by themselves is very useful. Specifically, the model uses the protected G1 route for NC, and uses high-grade bivectors for the LP. This successfully solves the conflict between node semantics and edge relations.
-
The ablation experiment (Table 4 and Figure 3) is designed very well. Unlike many papers that just do normal component removing, the authors successfully use it to prove their decoupling motivation. We can clearly see that removing the "G1 route" mainly hurts NC tasks, and removing the "Clifford product" mainly hurts LP tasks.I think this is a very smart experiment design and makes the paper much more convincing.
Critical weaknesses
-
The paper claims the proposed ice model achieves sota performance. However, I have a big concern about the fairness of the baseline comparisons. The node state dimension is expanded by 8 times, and the geometric product edge transport takes 64 times more computation. The performance gain might simply come from this larger computation capacity and wider node, rather than the Clifford algebra design. The paper lacks a strictly parameter-matched baseline comparison.
-
The paper claimed it istask-aligned field access. It means downstream tasks can freely query the feature bank. But when we look at Equation 14 in the Appendix, we can find that the Link Prediction head actually uses a manual way to extract Grade 0 and Grade 2 to build the pair feature. This is just manual hard-coding. The model does not learn to choose high-grade features adaptively by itself. So, this is totally different from what the paper claims
-
The title of this paper says it is a Graph Foundation Model. But if we look at the experiment part, the model only tests on the same 11 graphs already used in the pre-training stage. I think this is at most multi-task joint pre-training. A real foundation model should prove its zero-shot or inductive generalization ability on completely new graphs that the model never saw before. So, the current experiment results cannot support the title of Foundation Model.
Questions for authors
- Can you provide a parameter-matched matched baseline comparison?
- In Equation 14, the Link Prediction head manually extracts Grade 0 and Grade 2. Why do you use this hard-coding design? Can the network learn to dynamically select the best grades using some attention weights?
2 comments
Dear Reviewer BU44,
With the rebuttal deadline approaching, we wanted to ask whether you have had a chance to read our response.
Could you let us know if the parameter-matched comparisons, learned-gating control, and transfer results address your concerns?
We are happy to provide any further clarification. Thank you for your time.
We thank Reviewer BU44 for appreciating the node/pair motivation and retained-bank design. We address model size, learned grade selection, and transfer beyond the pretraining graphs below.
W1 & Q1: Matching size while separating the edge operation. A Clifford state contains 8h scalar channels, so matching nominal h alone is insufficient. Section 5.2 and Appendix F.2, Table 9, compare ICE's 59.51 M active encoder parameters with PLANET-PM's 59.52 M, with approximately 1.38 M allocated LP-head parameters for each. PLANET-PM sets active architecture dimensions to match the budget rather than adding unused padding. ICE achieves NC Accuracy/Macro-F1 and LP MRR of 83.20/74.90/26.24 versus 82.47/74.11/25.48.
Scalar/Hadamard transport provides a more targeted comparison. Both retain Q/K/V, dimensions, layers, bank, and the same heads, replacing only the edge operation. Their LP MRR is 25.16/25.39 versus ICE's 26.24. The improvement therefore persists with the same representation width, intermediate access, and readout (Appendix F.2).
The 64 coefficient-pair terms count one local product, rather than the whole pipeline. Dense node maps cost O(L∣Vb∣(hB)2) and edge products cost O(L∣Eb∣hB2). Appendix E.5 gives the full complexity expression with widths held constant. Appendix F.6, Table 12, compares identical hardware, batch, sampling, and precision. With ICE time/peak memory normalized to 1.00/1.00, PLANET-PM uses 0.88/0.91, scalar transport 0.79/0.94, and Hadamard transport 0.86/0.97. This reports ICE's additional cost directly without equating a local operation count with end-to-end runtime.
W2 & Q2: Specified relation summaries complement learned access to every grade. The scalar and bivector-norm relation terms are deliberate design choices. Their purpose is to summarize pair relations while preserving endpoint symmetry. They supplement endpoint sum, absolute difference, and product features from every grade and depth. The supervised LP MLP learns how to combine this complete descriptor, so access is not restricted to Grades 0/2. Section 4.3 and Appendix D.4 now make this distinction explicit.
To test the requested adaptive alternative, Appendix F.5, Table 11, adds symmetric pair-dependent softmax gates over the same grade/depth features, retaining the relation terms and projection/MLP architecture:
The gate improves MRR by 0.06/0.14/0.07 points and allocates 2,316 parameters (0.17%). At least 384 gate weights are inactive because H0 Grades 2/3 are zero. Likewise, the full LP head allocates 1,376,769 parameters, with at least 180,224 structurally inactive; same-bank controls share these zeros. The small absolute increments support retaining the simpler dictionary as the primary head. Appendices F.1 and F.5 give the parameter accounting. NC gates are class-specific, whereas AHA and the additional pair gate depend on the input.
W3: We distinguish graph reuse from inductive transfer. The original nine-graph evaluation tests new tasks on pretraining graphs (Section 5.1; Appendix A.1). Section 5.3 and Appendix F.8, Tables 4 and 14, add PLANET's graph/domain-transfer setting [1], excluding target entities, incident edges, and alternate target views from the corresponding pretraining pool. The frozen foundation then supports a fresh head trained with target-task supervision. Both tables include GraphMAE2, RiemannGFM, SAMGPT, UniGraph2, and PLANET.
OOD Movies Accuracy is 58.17 for ICE versus PLANET's reported 56.91, and Sports LP MRR is 28.16 versus 27.63. Movies 3/5-shot Accuracy is 58.12/61.09 versus 56.67/59.82; Cloth is 74.38/76.27 versus 73.12/75.36. The foundation claim concerns reuse of one pretrained encoder across graphs and prediction units. These additional settings test that reuse on excluded graphs and domains under supervised and few-shot adaptation.
References [1] S. Liu, X. Li, D. Su, R. Zhang, H. Qin, R.-H. Li, and G. Wang. Toward Effective Multimodal Graph Foundation Model: A Divide-and-Conquer Based Approach. ICML, PMLR 306:77226–77245, 2026.