Smoothness Really Matters: A Simple Yet Effective Approach for Unsupervised Graph Domain Adaptation
Wei Chen, Guo Ye, Yakun Wang, Zhao Zhang, Libang Zhang, Daixin Wang, Zhiqiang Zhang, Fuzhen Zhuang
Abstract
Unsupervised Graph Domain Adaptation (UGDA) seeks to bridge distribution shifts between domains by transferring knowledge from labeled source graphs to given unlabeled target graphs. Existing UGDA methods primarily focus on aligning features in the latent space learned by graph neural networks (GNNs) across domains, often overlooking structural shifts, resulting in limited effectiveness when addressing structurally complex transfer scenarios. Given the sensitivity of GNNs to local structural features, even slight discrepancies between source and target graphs could lead to significant shifts in node embeddings, thereby reducing the effectiveness of knowledge transfer. To address this issue, we introduce a novel approach for UGDA called Target-Domain Structural Smoothing (TDSS). TDSS is a simple and effective method designed to perform structural smoothing directly on the target graph, thereby mitigating structural distribution shifts and ensuring the consistency of node representations. Specifically, by integrating smoothing techniques with neighborhood sampling, TDSS maintains the structural coherence of the target graph while mitigating the risk of over-smoothing. Our theoretical analysis shows that TDSS effectively reduces target risk by improving model smoothness. Empirical results on three real-world datasets demonstrate that TDSS outperforms recent state-of-the-art baselines, achieving significant improvements across six transfer scenarios. The code is available in https://github.com/cwei01/TDSS .
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.
Cited by top-tier papers4
- Learning Structure-Semantic Evolution Trajectories for Graph Domain AdaptationWei Chen, Xingyu Guo, Shuang Li, Yan Zhong et al.ICLR 2026 · 8 citations
- Graph Data Selection for Domain Adaptation: A Model-Free ApproachTing-Wei Li, Ruizhong Qiu, Hanghang TongNeurIPS 2025 · 7 citations
- Learning Adaptive Distribution Alignment with Neural Characteristic Function for Graph Domain AdaptationWei Chen, Xingyu Guo, Shuang Li, Zhao Zhang et al.ICLR 2026 · 3 citations
- Semi-Supervised Blind Quality Assessment with Confidence-quantifiable Pseudo-label Learning for Authentic ImagesYan Zhong, Chenxi Yang, Suyuan Zhao, Tingting JiangICML 2025
Builds on15
- Unsupervised Domain Adaptive Graph Convolutional NetworksMan Wu, Shirui Pan, Chuan Zhou, Xiaojun Chang et al.WWW 2020 · 221 citations
- Random Walk Graph Neural NetworksGiannis Nikolentzos, Michalis VazirgiannisNeurIPS 2020 · 172 citations
- Adversarial Deep Network Embedding for Cross-Network Node ClassificationXiao Shen, Quanyu Dai, Fu-Lai Chung, Wei Lu et al.AAAI 2020 · 99 citations
- Improved OOD Generalization via Adversarial Training and PretraingMingyang Yi, Lu Hou, Jiacheng Sun, Lifeng Shang et al.ICML 2021 · 99 citations
- Direct Parameterization of Lipschitz-Bounded Deep NetworksRuigang Wang, Ian R. ManchesterICML 2023 · 66 citations
Related papers
- Can Modifying Data Address Graph Domain Adaptation?Renhong Huang, Jiarong Xu, Xin Jiang, Ruichuan An et al.KDD 2024 · 1 citation
- Rethinking Propagation for Unsupervised Graph Domain AdaptationMeihan Liu, Zeyu Fang, Zhen Zhang, Ming Gu et al.AAAI 2024 · 45 citations
- Multi-Source Unsupervised Graph Domain Adaptation via Concise Propagation-Transformation PipelineJiayi Wang, Yi Li, Xin Zheng, Junyang Chen et al.WWW 2026
- TFGDA: Exploring Topology and Feature Alignment in Semi-supervised Graph Domain Adaptation through Robust ClusteringJun Dan, Weiming Liu, Chunfeng Xie, Hua Yu et al.NeurIPS 2024 · 22 citations
- Disentangled Graph Spectral Domain AdaptationLiang Yang, Xin Chen, Jiaming Zhuo, Di Jin et al.ICML 2025
