mlsanityData to 14 Oct 2026

Smoothness Really Matters: A Simple Yet Effective Approach for Unsupervised Graph Domain Adaptation

arXiv 2412.11654 ↗First posted 16 Dec 2024cs.LG cs.AIcited by 14

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Builds on 25 of its 50 references that are in the map. First posted on arXiv 16 Dec 2024.

Builds on

25 of 50 references.

References · 25

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
  4. 2014DeepWalk: Online Learning of Social Representationscited by 1,547
  5. 2019Simplifying Graph Convolutional Networkscited by 1,477
  6. 2019A Comprehensive Survey on Transfer Learningcited by 1,160
  7. 2018A Survey of Unsupervised Deep Domain Adaptationcited by 361
  8. 2022A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multimodalcited by 106
  9. 2023A Comprehensive Survey on Source-free Domain Adaptationcited by 104
  10. 2019Graph Transfer Learning via Adversarial Domain Adaptation with Graph Convolutioncited by 67
  11. 2021Improved OOD Generalization via Adversarial Training and Pre-trainingcited by 66
  12. 2023Direct Parameterization of Lipschitz-Bounded Deep Networkscited by 51
13 more
  1. 2023Structural Re-weighting Improves Graph Domain Adaptationcited by 45
  2. 2020Adversarial Deep Network Embedding for Cross-network Node Classificationcited by 44
  3. 2020A case for new neural network smoothness constraintscited by 43
  4. 2024Rethinking Propagation for Unsupervised Graph Domain Adaptationcited by 31
  5. 2024Pairwise Alignment Improves Graph Domain Adaptationcited by 25
  6. 2023A Survey on Causal Inference for Recommendationcited by 22
  7. 2023SPA: A Graph Spectral Alignment Perspective for Domain Adaptationcited by 22
  8. 2021Partial Domain Adaptation without Domain Alignmentcited by 11
  9. 2024Beyond Alignment: Blind Video Face Restoration via Parsing-Guided Temporal-Coherent Transformercited by 11
  10. 2024Optimizing Long-tailed Link Prediction in Graph Neural Networks through Structure Representation Enhancementcited by 9
  11. 2024RevGNN: Negative Sampling Enhanced Contrastive Graph Learning for Academic Reviewer Recommendationcited by 8
  12. 2015Evaluating accuracy of community detection using the relative normalized mutual informationcited by 7
  13. 2024An End-to-End Real-World Camera Imaging Pipelinecited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 3; 2026: 11.

14 papers.

Sort:

By area: