USBD: Universal Structural Basis Distillation for Source-Free Graph Domain Adaptation

Yingxu Wang, Kunyu Zhang, Mengzhu Wang, Siyang Gao, Nan Yin

Main figure for USBD: Universal Structural Basis Distillation for Source-Free Graph Domain Adaptation

Abstract

Source-Free Graph Domain Adaptation (SF-GDA) is pivotal for privacy-preserving knowledge transfer across graph datasets. Although recent works incorporate structural information, they implicitly condition adaptation on the smoothness priors of source-trained GNNs, thereby limiting their generalization to structurally distinct targets. This dependency becomes a critical bottleneck under significant topological shifts, where the source model misinterprets distinct topological patterns unseen in the source domain as noise, rendering pseudo-label-based adaptation unreliable. To overcome this limitation, we propose the Universal Structural Basis Distillation (USBD), a framework that shifts the paradigm from adapting a biased model to learning a universal structural basis for SF-GDA. Instead of adapting a biased source model to a specific target, our core idea is to construct a structure-agnostic basis that proactively covers the full spectrum of potential topological patterns. Specifically, USBD employs a bi-level optimization framework to distill the source dataset into a compact structural basis. By enforcing the prototypes to span the full Dirichlet energy spectrum, the learned basis explicitly captures diverse topological motifs, ranging from low-frequency clusters to high-frequency chains, beyond those present in the source. This ensures that the learned basis creates a comprehensive structural covering capable of handling targets with disparate structures. For inference, we introduce a spectral-aware ensemble mechanism that dynamically activates the optimal prototype combination based on the spectral fingerprint of the target graph. Extensive experiments on benchmarks demonstrate that USBD significantly outperforms state-of-the-art methods, particularly in scenarios with severe structural shifts, while achieving superior computational efficiency by decoupling the adaptation cost from the target data scale.

Proposed method: USBD

Benchmark Results

Tested on 2 datasets 9 baseline values reported too low

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

TU Dortmund

#ModelAccuracy ↑Paper
1
WL-MLP
0.9954
2
GIN
actual #2 vs paper #543 541 places worse
0.9934
best reported
actual #2 vs paper #543 541 places worse
paper 0.6190 ±0.0190
paper 0.6190 ±0.0190 Δ at pub 0.3744
3
GCN
actual #3 vs paper #550 547 places worse
0.9727
best reported
actual #3 vs paper #550 547 places worse
paper 0.6090 ±0.0230
paper 0.6090 ±0.0230 Δ at pub 0.3637
9
WL subtree
actual #9 vs paper #582 573 places worse
0.8600 ±0.0180
best reported
actual #9 vs paper #582 573 places worse
paper 0.4220
paper 0.4220 Δ at pub 0.4380
19
CIN
actual #19 vs paper #562 543 places worse
0.8530 ±0.0120
best reported
actual #19 vs paper #562 543 places worse
paper 0.5800 ±0.0270
paper 0.5800 ±0.0270 Δ at pub 0.2730 Δ today 0.2730
115
PathNN
actual #115 vs paper #574 459 places worse
0.8230 ±0.0190
best reported
actual #115 vs paper #574 459 places worse
paper 0.5380 ±0.0330
paper 0.5380 ±0.0330 Δ at pub 0.2850 Δ today 0.2850
131
GraphSAGE
0.8200 ±0.0100
226
GMT
actual #226 vs paper #578 352 places worse
0.7990 ±0.0040
best reported
actual #226 vs paper #578 352 places worse
paper 0.5070 ±0.0220
paper 0.5070 ±0.0220 Δ at pub 0.2920
513
USBD
0.6670 ±0.0190
This paper
518
GALA
0.6600 ±0.0250
This paper
521
SOGA
0.6540 ±0.0180
This paper
537
SF(DA)^2
0.6320 ±0.0180
This paper
544
GraphCTA
0.6170 ±0.0180
This paper
553
NVC_LLN
0.6000 ±0.0180
This paper
555
SFDA_LLN
0.5990 ±0.0150
This paper
558
JacobiConv
0.5970 ±0.0210
This paper
559
AutoSGNN
0.5960 ±0.0200
This paper
#ModelAccuracy ↑Paper
1
GC-GNN (GCN)
0.9210 ±0.0810
2
SUGAR
0.8403 ±0.0133
3
Ortho-g-U-Nets
0.8387
15
SAGE
0.8088 ±0.0233
43
GCN
actual #43 vs paper #194 151 places worse
0.7912 ±0.0307
best reported
actual #43 vs paper #194 151 places worse
paper 0.4890 ±0.0200
best at pub: Hierarchical Graph Capsule Network (AAAI 2020)
paper 0.4890 ±0.0200 Δ at pub 0.3022
55
GMT
actual #55 vs paper #186 131 places worse
0.7872 ±0.0059
best reported
actual #55 vs paper #186 131 places worse
paper 0.5950 ±0.0250
paper 0.5950 ±0.0250 Δ at pub 0.1922 Δ today 0.1922
74
GIN
actual #74 vs paper #194 120 places worse
0.7805 ±0.0189
best reported
actual #74 vs paper #194 120 places worse
paper 0.5730 ±0.0220
paper 0.5730 ±0.0220 Δ at pub 0.2075
178
USBD
0.6620 ±0.0140
This paper
179
GALA
0.6560 ±0.0130
This paper
182
SOGA
0.6440 ±0.0130
This paper
183
SF(DA)^2
0.6220 ±0.0170
This paper
185
WL subtree
0.6060
This paper
186
GraphCTA
0.6060 ±0.0190
This paper
187
JacobiConv
0.5930 ±0.0120
This paper
188
SFDA_LLN
0.5920 ±0.0110
This paper
189
NVC_LLN
0.5920 ±0.0210
This paper
190
CIN
0.5910 ±0.0260
This paper
191
AutoSGNN
0.5870 ±0.0130
This paper
194
PathNN
0.5790 ±0.0180
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)