Unified Multi-Domain Graph Pre-training for Homogeneous and Heterogeneous Graphs via Domain-Specific Expert Encoding

Chundong Liang, Yongqi Huang, Dongxiao He, Peiyuan Li, Yawen Li, Di Jin, Weixiong Zhang

Main figure for Unified Multi-Domain Graph Pre-training for Homogeneous and Heterogeneous Graphs via Domain-Specific Expert Encoding

Abstract

Graph pre-training has achieved remarkable success in recent years, delivering transferable representations for downstream adaptation. However, most existing methods are designed for either homogeneous or heterogeneous graphs, thereby hindering unified graph modeling across diverse graph types. This separation contradicts real-world applications, where mixed homogeneous and heterogeneous graphs are ubiquitous, and distribution shifts between upstream pre-training and downstream deployment are common. In this paper, we empirically demonstrate that a balanced mixture of homogeneous and heterogeneous graph pre-training benefits downstream tasks and propose a unified multi-domain Graph Pre-training method across Homogeneous and Heterogeneous graphs ($ GPH^2$). To address the lack of a unified encoder for homogeneous and heterogeneous graphs, we propose a Unified Multi-View Graph Construction that simultaneously encodes both without explicit graph-type-specific designs. To cope with the increased cross-domain distribution discrepancies arising from mixed graphs, we introduce domain-specific expert encoding. Each expert is independently pre-trained on a single graph to capture domain-specific knowledge, thereby shielding the pre-training encoder from the adverse effects of cross-domain discrepancies. For downstream tasks, we further design a Task-oriented Expert Fusion Strategy that adaptively integrates multiple experts based on their discriminative strengths. Extensive experiments on mixed graphs demonstrate that $ ^2$ enables stable transfer across graph types and domains, significantly outperforming existing graph pre-training methods.

Proposed method: GPH^2

Benchmark Results

Tested on 1 dataset 3 baseline values reported too low

Tables show presented results in global context (best 3 papers + GCN + MLP).

Heterogeneous Graph Benchmarks

#ModelMacro-F1 ↑Paper
1
ConCH
0.6475
2
HetGNN
0.6292
3
GC-HGNN
0.6247 ±0.0042
7
GCN
0.6090
8
HGMAE
actual #8 vs paper #36 28 places worse
0.6082 ±0.0051
best reported
actual #8 vs paper #36 28 places worse
paper 0.3515 ±0.0362
paper 0.3515 ±0.0362 Δ at pub 0.2567
11
HeCo
actual #11 vs paper #36 25 places worse
0.5987 ±0.0033
best reported
actual #11 vs paper #36 25 places worse
paper 0.3799 ±0.0312
paper 0.3799 ±0.0312 Δ at pub 0.2188
19
DMGI
actual #19 vs paper #37 18 places worse
0.5599 ±0.0059
best reported
actual #19 vs paper #37 18 places worse
paper 0.3337 ±0.0232
paper 0.3337 ±0.0232 Δ at pub 0.2262
33
GPH^2
0.4478 ±0.0547
This paper
36
HGPrompt
0.4078 ±0.0323
This paper
38
HERO
0.3139 ±0.0780
This paper
39
HetGPT
0.2903 ±0.0654
This paper
SOTA performance (not significantly different from the best) Proposed method (this paper) Baseline / comparison (this paper) Global context (other papers) Best at pub — reported result worse than the best known when published (best reported in green)