acceptodds
Under review as a conference paper at ICLR 2027

GraphVec: Cross-Domain Graph Vectorization for Graph-Level Representation Learning

Abstract

Learning transferable graph representations across heterogeneous domains is challenging because graph datasets differ in topology, node-attribute semantics, feature dimensions, and attribute availability. We propose GraphVec, a language-model-free framework that maps heterogeneous graphs into fixed-dimensional representations for graph-level tasks. GraphVec constructs multi-scale global relational graphs and spectral embeddings to replace incomparable raw attributes with comparable relational features, and further aligns them through a density-maximization orthogonal transformation with provable convergence. A GIN–Graph Transformer backbone equipped with hierarchical reference distribution encoding captures node-distribution information beyond standard pooling. We further establish an end-to-end generalization bound connecting cross-domain contrastive pretraining to few-shot classification on unseen domains. Experiments on 13 datasets against more than 15 baselines show that GraphVec consistently performs strongly in cross-domain few-shot graph classification and graph clustering, while also yielding competitive representations for few-shot node classification.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
graph foundation model, graph representation learning, graph neural networks

Reviews

Among:
Shape:
1234this paper, Top 4%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 3.33 over 3 reviews, above 96% of the others.
Reviewer_Nh56OpenReview ↗
Rating
4
Confidence
3
Informativeness
3
Presentation
3
Soundness
3
Read review
Paper summary

The paper proposes GraphVec, a language-model-free framework for cross-domain graph-level representation learning. The method has several key components, such as multi-scale global relational graphs, density-maximization alignment, and hierarchical reference distribution encoding. The paper provides an end-to-end generalization bound connecting source contrastive pretraining to few-shot classification on an unseen target domain. GraphVec is evaluated by few-shot graph classification on diverse graph datasets from biology, social network, and computer vision. It also reports graph clustering, node classification, ablations, robustness, scalability, and hyperparameter sensitivity. GraphVec substantially outperforms recent graph pretraining, prompt-learning, and GFM baselines in several cross-domain settings.

Critical strengths
  1. The key techniques of GraphVec, including multi-scale global relational graphs, density-maximization alignment, and hierarchical reference distribution encoding are novel, well motivated, and clearly verified.

  2. GraphVec achieves large gains over strong baselines in cross-domain few-shot graph classification, e.g., average 66.14 vs. 58.63 for GCN and 58.40 for BRIDGE. The paper also evaluates unsupervised pretraining, graph clustering, node classification, ablations, robustness to noisy graphs, and scalability. This breadth makes the empirical contribution convincing.

  3. The convergence analysis for density-maximization alignment and the end-to-end generalization bound are nontrivial and go beyond typical empirical GFM papers. The theory connects contrastive pretraining, alignment, and target few-shot classification in a principled way, which materially strengthens the paper.

Critical weaknesses

The global multi-graph construction requires kernel matrices and SVD over all nodes in a dataset. Although Nyström approximation is mentioned, the reported peak RAM usage is already high for a moderate dataset, and the method may struggle with very large graphs.

Questions for authors
  1. Since density-maximization alignment only matches spectral means and does not guarantee removal of higher-order or task-relevant distributional differences, does this undermine robustness and generalization in harder cross-domain settings?

  2. The LLM-based GFMs perform poorly in several comparisons. Given that node features are numerical rather than natural-language attributes, how fair is the text conversion protocol? Could the weak LLM performance be an artifact of representation collapse caused by the conversion?

  3. How does GraphVec scale to much larger graph datasets? The reported peak RAM is high? Can the method handle million-node graphs or thousands of domains without prohibitive memory?

Reviewer_ZbzMOpenReview ↗
Rating
3
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

In this paper, the authors study cross-domain graph-level representation learning. They argue that graph datasets from different domains differ in topology, node-attribute semantics, and feature dimensions, which makes it difficult to transfer a single pretrained model across datasets. To address this issue, they propose GraphVec, a language-model-free framework. GraphVec constructs multi-scale global relational graphs with Gaussian kernels and extracts spectral embeddings to replace incomparable raw attributes, which are then aligned across datasets through a density-maximization orthogonal transformation. A GIN–Graph Transformer backbone with hierarchical reference distribution encoding is further used to obtain graph representations. Experiments on few-shot graph classification and graph clustering benchmarks verify the performance of the proposed GraphVec.

Critical strengths
  • The paper targets cross-domain graph-level representation learning without relying on language models, which is a practical and less explored setting compared with node-level graph foundation models.

  • Experiments on few-shot graph classification and graph clustering across biochemical, social network, and computer vision datasets verify the performance of the proposed GraphVec.

Critical weaknesses
  • The design of the mean alignment module is not fully consistent with its motivation. Section 3.3 motivates the alignment by the sign and order ambiguity of SVD, yet Algorithm 1 only aligns one mean vector per dataset. The ablation in Table 7 also suggests that its contribution is limited. Additionally, I found that excessively defensive statements appear extensively in Appendix H and Appendix I, such as "What the theorem does not imply" and "No claim is made that ...".
  • The theoretical analysis in the appendix provides limited practical insight. Most key terms in Theorem 3.2, such as Δres\Delta_{res}, LshiftL_{shift}, ϵaug→sem\epsilon_{aug \to sem}, and the map errors, are neither computed nor estimated in the experiments. So, it is unclear how the bound supports the design of the proposed GraphVec.
  • After carefully check the experimental results, I think the cross-domain setting in Table 1 is not fully convincing. The leave-one-out evaluation is conducted among five biochemical datasets, where NCI1, NCI109, and Mutagenicity are all small-molecule datasets and NCI1 and NCI109 share highly similar compounds. In addition, the supervised GraphVec uses the labels of these related datasets for pretraining, while the in-dataset baselines are self-supervised.
  • Some experimental results also raise concerns about the reliability of the comparison. For instance, several baselines perform close to random guessing on COIL-RAG in Table 2, GraphVec itself collapses on COIL-RAG and Cuneiform when dˉ\bar{d} increases in Table 22, and most clustering results report zero standard deviation over five random seeds without explanation.
  • Typos and presentation issues:
    • "Mutagencity" in Section 4.1;
    • "which further increase the difficulty" in Section 3.3;
    • "INPLEMENTATION DETAILS" in Appendix E.3;
    • "structral transferability" in Appendix B;
    • "GraphVec-FM" in Appendix F.12 is inconsistent with "GraphVec" elsewhere;
    • the caption of Figure 3 lists PROTEINS, NCI109, DD, and Mutagenicity, while the panels show ENZYMES, NCI1, BZR, and Letter-med.
Questions for authors

Please see weaknesses.

Reviewer_tb8tOpenReview ↗
Rating
3(+1)
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

GraphVec addresses graph-level transfer across datasets with heterogeneous or missing node attributes, without relying on language models. It combines multiscale kernel spectral features, orthogonal alignment of dataset means, and a GIN-Graph Transformer whose readout measures MMDs to learnable reference distributions. Target preprocessing uses only support graphs, with queries embedded through an inductive extension; the paper also develops alignment and generalization analyses. Experiments cover few-shot classification and clustering, reporting on five biochemical classification datasets and substantial gains on distant social and vision targets.

Critical strengths
  1. Well-motivated handling of heterogeneous graph attributes.
  2. Substantial transfer gains on Letter-med, COIL-RAG, and REDDIT-BINARY against recent baselines, supported by input/module ablations, hyperparameter sensitivity studies, and resource measurements.
  3. An explicitly inductive query protocol and theory accounting for learned preprocessing.
Critical weaknesses
  1. Pretraining is not isolated. Changing only the input features moves Letter-med from 55.33 to 85.60 (Table 12). Same-feature controls without cross-domain pretraining (e.g., GIN from scratch, WL-kernel SVM) and a re-run of EdgePrompt+ [1] would show what pretraining adds.
  2. Uneven gains are unexplained. GraphVec trails EdgePrompt+ on COLLAB and IMDB-B and leads by only ≈0.25 on NCI1 and Mutagenicity. A diagnosis of strong vs. weak targets would clarify when the method helps.
  3. Table 1 is cross-dataset rather than cross-domain. Each target shares its domain with a label-supervised source, and duplicate graphs are unchecked; deduplicated results would support the "unseen domain" claim.
  4. Objective (8) has a closed-form optimum that fixes only 1 of 32 directions per scale, so it cannot remove the sign/rotation ambiguity claimed in Sec. 3.3. A comparison with this solution and an invariance test would help.
  5. Ablations and protocol. The RD and Q ablations also change model capacity, and seeds, validation split and key settings are not stated. Capacity-matched controls and paired per-seed results would help.

[1] Fu et al. Edge Prompt Tuning for Graph Neural Networks. ICLR 2025.

Questions for authors

See weaknesses.

Comments on the paper

1 comment
Area_Chair_FWLhOpenReview ↗

Discussion reminder

Dear Reviewers,thank you for your time and thoughtful evaluation of the Paper. The authors have now submitted their rebuttal addressing the questions and concerns raised in your initial reviews. Please carefully review the authors' responses alongside the other reviews, and participate in the discussion to share your updated thoughts and comments. To help us reach a well-informed meta-review decision, please let us know if the rebuttal adequately resolves your concerns and whether you plan to adjust your final rating. Please submit your post-rebuttal comments and updated evaluation on the review portal. Thank you again for your valuable service and contribution to the review process. AC

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.