- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper proposes GFManifold, a graph foundation model for downstream parameter tuning-free adaptation. It employs hyperbolic and spherical constant-curvature manifolds with globally shared learnable curvature parameters. During pretraining, the model jointly optimizes a GNN encoder and manifold branches through MMD-based domain alignment and geodesic link prediction. During downstream inference, manifold-induced distances are used to reweight the target graph without updating pretrained parameters.
While the proposed adaptation strategy is practically relevant, I have substantial concerns about the methodological novelty, the justification of the geometric construction, and the validity and significance of the theoretical claims.
Critical strengths
S1. Practical downstream adaptation without parameter updates.
The graph-reweighting strategy avoids gradient-based optimization on unseen target domains while retaining a pretrained GNN encoder. This is a practically relevant design that may improve adaptation efficiency. However, its practical utility alone does not establish the claimed geometric or theoretical contribution.
Critical weaknesses
W1. Limited geometric novelty and an unsubstantiated connection to domain-invariant structural learning.
The central motivation assumes that transferable graph motifs, such as trees, cycles, and cliques, are insufficiently captured by Euclidean GFMs and can be better exploited through non-Euclidean geometry. However, the existence of recurring motifs does not imply that they are domain-invariant or label-relevant. Moreover, Euclidean-coordinate representations do not necessarily imply intrinsically flat data geometry, just as explicitly parameterizing manifold curvature does not establish that the intrinsic geometry of graph data has been learned.
GFManifold employs only two globally shared scalar curvature parameters, corresponding to predefined hyperbolic and spherical constant-curvature spaces. These parameters determine the curvature of the model spaces, not the intrinsic curvature of individual graphs. Although different embedding configurations can represent heterogeneous relations, the model provides no explicit mechanism for adapting curvature or geometric mixing to individual nodes, regions, or domains, nor a mathematical argument that its globally shared construction faithfully preserves heterogeneous transferable structures.
Furthermore, Eq. (6) combines two geodesic distances into a composite dissimilarity, rather than defining a new Riemannian manifold or unified geodesic geometry. The construction therefore amounts to combining two homogeneous geometric views through globally learned weights. Global parameter sharing does not, by itself, establish structural invariance.
This is particularly concerning given prior work such as RiemannGFM [1], GraphGlue [2], and GAUGE [3], which have already investigated non-Euclidean geometry and transferable graph structures. The main differences of GFManifold lie in global curvature parameterization, pretraining objectives, and downstream edge reweighting. The paper does not demonstrate a fundamentally new geometric capability or explain why this construction should identify domain-invariant, label-relevant structures beyond existing approaches.
W2. The theoretical analysis assumes the desired invariance and does not establish a substantive guarantee for the proposed method.
The actual learning objective combines MMD-based distribution alignment and geodesic link prediction. Neither objective explicitly separates domain-invariant from domain-specific structural information. MMD aligns marginal representation distributions without guaranteeing label-conditional invariance, while link prediction can preserve domain-specific connectivity. Since the GNN encoder processes the original graph before manifold mapping, the proposed objectives do not establish that the resulting distances isolate transferable structural components.
The theoretical analysis does not resolve this issue. Appendix E assumes, for an idealized conditional analysis, that the manifold-induced transformation corresponds to the shared structural component and that this component is invariant and sufficient for prediction. The authors acknowledge that the practical objectives are not guaranteed to recover this decomposition.
More importantly, Eq. (18) is essentially a marginalization identity for a predictor operating on the assumed shared representation, while Eqs. (19)–(20) follow directly from the definition of a minimax-optimal predictor. These results do not establish that the actual GFManifold optimization approaches the minimax solution or recovers invariant structure on unseen domains.
An additional mathematical concern arises in Eqs. (7)–(8), where a Gaussian-type kernel is constructed from squared composite geodesic distances and used for MMD. Positive semidefiniteness is required for the standard RKHS interpretation of MMD, but it is not automatically guaranteed for Gaussian kernels based on geodesic distances in curved spaces. The paper does not establish this property for its proposed composite distance.
Consequently, the theoretical analysis provides no substantive connection between the learned global curvatures, the actual optimization objectives, and the claimed cross-domain structural invariance. This is a fundamental gap in the paper's central argument rather than a minor technical omission.
Questions for authors
The following questions concern issues that could materially affect my assessment.
-
Geometric novelty and expressiveness. What fundamental geometric modeling capability does GFManifold introduce beyond RiemannGFM [1], GraphGlue [2], and GAUGE [3]? In particular, what justifies the sufficiency of two globally shared constant-curvature parameters for learning transferable structures across heterogeneous graphs, and how can their geometric contribution be distinguished from the expressivity of the jointly trained GNN encoder?
-
Structural invariance. What mathematical property or explicit training mechanism ensures that the proposed MMD and link-prediction objectives recover domain-invariant, label-relevant structures rather than generic or domain-specific graph similarities? Can the authors provide a nontrivial justification connecting the actual learned representations to the assumed invariant decomposition?
-
Mathematical validity of the distance-based objective. Are the aggregation weights in Eq. (6) constrained to be nonnegative? More importantly, can the authors establish that the Gaussian-type kernel in Eq. (7) is positive semidefinite under the proposed composite geodesic distance, thereby justifying its use in the MMD objective?
-
Theoretical significance. Beyond marginalization in Eq. (18) and the minimax definition in Eqs. (19)–(20), what nontrivial generalization property does Theorem 4.1 establish for GFManifold? How does the actual source-domain optimization connect to the stated minimax formulation involving unseen target domains?
References
[1] RiemannGFM: Learning a Graph Foundation Model from Riemannian Geometry. WWW 2025.
[2] Multi-Domain Riemannian Graph Gluing for Building Graph Foundation Models. ICLR 2026.
[3] Are Common Substructures Transferable? Riemannian Graph Foundation Model with Neural Vector Bundles. ICML 2026.