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.
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
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | WL-MLP | 0.9954 | |
| 2 | GIN | 0.9934 best reported | best at pub: 1-WL Expressiveness Is (Almost) All You Need (2022) |
| 3 | GCN | 0.9727 best reported | best at pub: 1-WL Expressiveness Is (Almost) All You Need (2022) |
| 9 | WL subtree | 0.8600
±0.0180 best reported | best at pub: Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernels (NeurIPS 2019) |
| 19 | CIN | 0.8530
±0.0120 best reported | best at pub: CIN++: Enhancing Topological Message Passing (2023) best today: Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes (AAAI 2023) |
| 115 | PathNN | 0.8230
±0.0190 best reported | best at pub: Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes (AAAI 2023) best today: Scalable Graph Compressed Convolutions (2024) |
| 131 | GraphSAGE | 0.8200
±0.0100 | |
| 226 | GMT | 0.7990
±0.0040 best reported | best at pub: Graph Classification via Reference Distribution Learning: Theory and Practice (NeurIPS 2024) |
| 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 |
| # | Model | Accuracy ↑ | 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 | 0.7912
±0.0307 best reported | best at pub: Hierarchical Graph Capsule Network (AAAI 2020) |
| 55 | GMT | 0.7872
±0.0059 best reported | best at pub: Structural Entropy Guided Graph Hierarchical Pooling (ICML 2022) best today: Cluster-wise Graph Transformer with Dual-granularity Kernelized Attention (NeurIPS 2024) |
| 74 | GIN | 0.7805
±0.0189 best reported | best at pub: Multi-grained Semantics-aware Graph Neural Networks (2020) |
| 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 |
