USBD: Universal Structural Basis Distillation for Source-Free Graph Domain Adaptation
Yingxu Wang, Kunyu Zhang, Mengzhu Wang, Siyang Gao, Nan Yin
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 sourcetrained 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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on34
- Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain AdaptationJian Liang, Dapeng Hu, Jiashi FengICML 2020 · 1,624 citations
- Beyond Homophily in Graph Neural Networks: Current Limitations and Effective DesignsJiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann et al.NeurIPS 2020 · 1,490 citations
- Beyond Low-frequency Information in Graph Convolutional NetworksDeyu Bo, Xiao Wang, Chuan Shi, Huawei ShenAAAI 2021 · 773 citations
- Graph Structure Learning for Robust Graph Neural NetworksWei Jin, Yao Ma, Xiaorui Liu, Xianfeng Tang et al.KDD 2020 · 604 citations
- Exploiting the Intrinsic Neighborhood Structure for Source-free Domain AdaptationShiqi Yang, Yaxing Wang, Joost van de Weijer, Luis Herranz et al.NeurIPS 2021 · 371 citations
Related papers
- Source-Free Graph Foundation Model Adaptation via Pseudo-Source ReconstructionLiang Yang, Hui Ning, Jiaming Zhuo, Ziyi Ma et al.AAAI 2026
- Smoothness Really Matters: A Simple Yet Effective Approach for Unsupervised Graph Domain AdaptationWei Chen, Guo Ye, Yakun Wang, Zhao Zhang et al.AAAI 2025 · 13 citations
- Graph Distillation with Eigenbasis MatchingYang Liu, Deyu Bo, Chuan ShiICML 2024 · 17 citations
- Disentangled Graph Spectral Domain AdaptationLiang Yang, Xin Chen, Jiaming Zhuo, Di Jin et al.ICML 2025
- Collaborate to Adapt: Source-Free Graph Domain Adaptation via Bi-directional AdaptationZhen Zhang, Meihan Liu, Anhui Wang, Hongyang Chen et al.WWW 2024 · 25 citations
