Boosting Graph Foundation Model from Structural Perspective
Yao Cheng, Yige Zhao, Jianxiang Yu, Xiang Li

TL;DR
This paper introduces BooG, a novel graph foundation model that leverages virtual super nodes and contrastive pre-training to unify structural features across domains, enhancing generalizability and performance.
Contribution
The paper proposes a new structural perspective for graph foundation models using virtual super nodes and contrastive learning, addressing domain-specific structural differences.
Findings
BooG outperforms existing models on various datasets and tasks.
The use of virtual super nodes improves cross-domain structural unification.
Contrastive pre-training enhances the expressiveness and generalization of graph representations.
Abstract
Graph foundation models have recently attracted significant attention due to its strong generalizability. Although existing methods resort to language models to learn unified semantic representations across domains, they disregard the unique structural characteristics of graphs from different domains. To address the problem, in this paper, we boost graph foundation model from structural perspective and propose BooG. The model constructs virtual super nodes to unify structural characteristics of graph data from different domains. Specifically, the super nodes fuse the information of anchor nodes and class labels, where each anchor node captures the information of a node or a graph instance to be classified. Instead of using the raw graph structure, we connect super nodes to all nodes within their neighborhood by virtual edges. This new structure allows for effective information…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Computational Techniques and Applications · Simulation and Modeling Applications · Graph Theory and Algorithms
MethodsSoftmax · Attention Is All You Need
