One Model for One Graph: A New Perspective for Pretraining with Cross-domain Graphs
Jingzhe Liu, Haitao Mao, Zhikai Chen, Bingheng Li, Wenqi Fan, Mingxuan Ju, Tong Zhao, Neil Shah, Jiliang Tang

TL;DR
This paper introduces a cross-domain pretraining framework for GNNs, enabling a single model to adapt across diverse graph domains by leveraging a bank of expert models and gating functions, improving generalization and performance.
Contribution
It proposes a novel 'one model for one graph' pretraining approach with expert models and gating, addressing domain-specific design challenges in GNNs.
Findings
Outperforms existing methods on link prediction tasks.
Achieves superior results in node classification across domains.
Demonstrates effective knowledge transfer with gating functions.
Abstract
Graph Neural Networks (GNNs) have emerged as a powerful tool to capture intricate network patterns, achieving success across different domains. However, existing GNNs require careful domain-specific architecture designs and training from scratch on each dataset, leading to an expertise-intensive process with difficulty in generalizing across graphs from different domains. Therefore, it can be hard for practitioners to infer which GNN model can generalize well to graphs from their domains. To address this challenge, we propose a novel cross-domain pretraining framework, "one model for one graph," which overcomes the limitations of previous approaches that failed to use a single GNN to capture diverse graph patterns across domains with significant gaps. Specifically, we pretrain a bank of expert models, with each one corresponding to a specific dataset. When inferring to a new graph,…
Peer Reviews
Decision·Submitted to ICLR 2025
1. The paper focuses on and attempts to address a crucial yet highly challenging problem in the field of graph analysis—constructing a Graph Foundation Model (GFM). 2. On commonly used graph datasets, the model OMOG presented in the paper achieves relatively good performance in both zero-shot and few-shot settings.
1. The paper does not clearly explain the differences from other MOE-based methods, such as GraphAlign and AnyGraph. The approach seems very similar to these methods, leaving it unclear what specific advantages OMOG has over them and why it achieves improved performance. 2. A core idea of OMOG is that each pre-training dataset requires a dedicated expert. This approach poses challenges for scalability: as the volume of pre-training data increases, the model grows linearly with the data, which is
1. The presentation of this paper is good and most parts of the paper are clear. 2. This paper proposes a novel cross-domain pretraining framework. 3. The experimental results demonstrate the effectiveness of the proposed method.
1. The intuition of the generator and filter in Pretraining the gate module is not clear. 2. The authors lack the discussion about the difference between the proposed method and the mixture-of-experts based methods. 3. I am concerned about the negative transfer issue in the proposed method. Since the knowledge in the proposed methods is extracted from graphs in different domains (and most of them are irrelevant), it inevitably increases the probability of facing the negative transfer issue. How
1. By pretraining individual models for each graph dataset, OMOG effectively addresses the feature and structural heterogeneity found across diverse graphs. 2. OMOG’s model bank allows the easy addition of new expert models without retraining the entire system, providing flexibility to expand the pretraining bank with new data and adapt quickly to novel domains.
1. The primary motivation for adopting the “one model for one graph” approach is to alleviate the negative transfer limitations observed in the “one model for all graphs” method. It would be beneficial to provide comparisons and discussions on how this method differs from prior approaches that aim to reduce negative transfer through better pretraining data selection as [1]. 2. It is recommended to identify which models, pretrained on specific graphs, are selected as the best match for various te
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel-Driven Software Engineering Techniques · Graph Theory and Algorithms
