mlsanityData to 13 Oct 2026

GALA: Graph Diffusion-based Alignment with Jigsaw for Source-free Domain Adaptation

arXiv 2410.16606 ↗First posted 22 Oct 2024cs.LG cs.AIcited by 8

On the map: Diffusion models → Flow matching, time series and science

Abstract (arXiv)

Source-free domain adaptation is a crucial machine learning topic, as it contains numerous applications in the real world, particularly with respect to data privacy. Existing approaches predominantly focus on Euclidean data, such as images and videos, while the exploration of non-Euclidean graph data remains scarce. Recent graph neural network (GNN) approaches can suffer from serious performance decline due to domain shift and label scarcity in source-free adaptation scenarios. In this study, we propose a novel method named Graph Diffusion-based Alignment with Jigsaw (GALA), tailored for source-free graph domain adaptation. To achieve domain alignment, GALA employs a graph diffusion model to reconstruct source-style graphs from target data. Specifically, a score-based graph diffusion model is trained using source graphs to learn the generative source styles. Then, we introduce perturbations to target graphs via a stochastic differential equation instead of sampling from a prior, followed by the reverse process to reconstruct source-style graphs. We feed the source-style graphs into an off-the-shelf GNN and introduce class-specific thresholds with curriculum learning, which can generate accurate and unbiased pseudo-labels for target graphs. Moreover, we develop a simple yet effective graph-mixing strategy named graph jigsaw to combine confident graphs and unconfident graphs, which can enhance generalization capabilities and robustness via consistency learning. Extensive experiments on benchmark datasets validate the effectiveness of GALA.

Key facts. Cited by 8 papers in the map (data through 13 Oct 2026). Placed in Flow matching, time series and science, one of 14 directions in Diffusion models. Builds on 46 of its 69 references that are in the map. First posted on arXiv 22 Oct 2024.

Builds on

46 of 69 references.

References · 46

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,318
  2. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,028
  3. 2017Graph Attention Networkscited by 8,888
  4. 2017Inductive Representation Learning on Large Graphscited by 6,303
  5. 2018How Powerful are Graph Neural Networks?cited by 4,373
  6. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,911
  7. 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,082
  8. 2021SDEdit: Guided Image Synthesis and Editing with Stochastic Differential Equationscited by 1,921
  9. 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,324
  10. 2018Deep Graph Infomaxcited by 1,104
  11. 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 846
  12. 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 787
34 more
  1. 2021FlexMatch: Boosting Semi-Supervised Learning with Curriculum Pseudo Labelingcited by 539
  2. 2019InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximizationcited by 441
  3. 2020Improving robustness against common corruptions by covariate shift adaptationcited by 429
  4. 2019Self-Attention Graph Poolingcited by 421
  5. 2020Evaluating Prediction-Time Batch Normalization for Robustness under Covariate Shiftcited by 236
  6. 2022Discovering Invariant Rationales for Graph Neural Networkscited by 187
  7. 2021Self-Supervised Learning of Graph Neural Networks: A Unified Reviewcited by 184
  8. 2022Handling Distribution Shifts on Graphs: An Invariance Perspectivecited by 163
  9. 2017Asymmetric Tri-training for Unsupervised Domain Adaptationcited by 152
  10. 2022G-Mixup: Graph Data Augmentation for Graph Classificationcited by 146
  11. 2021Semi-Supervised Learning of Visual Features by Non-Parametrically Predicting View Assignments with Support Samplescited by 114
  12. 2022Federated Learning on Non-IID Graphs via Structural Knowledge Sharingcited by 88
  13. 2021SUGAR: Subgraph Neural Network with Reinforcement Pooling and Self-Supervised Mutual Information Mechanismcited by 75
  14. 2019Molecular Property Prediction: A Multilevel Quantum Interactions Modeling Perspectivecited by 73
  15. 2023A Comprehensive Survey on Deep Graph Representation Learningcited by 72
  16. 2022Back to the Source: Diffusion-Driven Test-Time Adaptationcited by 71
  17. 2023Guiding Pseudo-labels with Uncertainty Estimation for Source-free Unsupervised Domain Adaptationcited by 64
  18. 2019Semi-Supervised Graph Classification: A Hierarchical Graph Perspectivecited by 55
  19. 2023CoCo: A Coupled Contrastive Framework for Unsupervised Domain Adaptive Graph Classificationcited by 46
  20. 2023Structural Re-weighting Improves Graph Domain Adaptationcited by 45
  21. 2020Topology-Aware Graph Pooling Networkscited by 44
  22. 2022GraphGDP: Generative Diffusion Processes for Permutation Invariant Graph Generationcited by 43
  23. 2022Confidence May Cheat: Self-Training on Graph Neural Networks under Distribution Shiftcited by 38
  24. 2022SizeShiftReg: a Regularization Method for Improving Size-Generalization in Graph Neural Networkscited by 36
  25. 2022Model-Agnostic Augmentation for Accurate Graph Classificationcited by 21
  26. 2022GLCC: A General Framework for Graph-Level Clusteringcited by 21
  27. 2023TGNN: A Joint Semi-supervised Framework for Graph-level Classificationcited by 19
  28. 2022KGNN: Harnessing Kernel-based Networks for Semi-supervised Graph Classificationcited by 18
  29. 2024SA-GDA: Spectral Augmentation for Graph Domain Adaptationcited by 16
  30. 2022Semi-Supervised Hierarchical Graph Classificationcited by 15
  31. 2023Learning Topology-Specific Experts for Molecular Property Predictioncited by 15
  32. 2021Graph Kernel Neural Networkscited by 13
  33. 2022GraphMAD: Graph Mixup for Data Augmentation using Data-Driven Convex Clusteringcited by 13
  34. 2021Group Contrastive Self-Supervised Learning on Graphscited by 5

Built on by

Cited by year (2026 to 13 Oct)

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

8 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024MLDGG: Meta-Learning for Domain Generalization on Graphs
  2. 2024Source-Free Domain Adaptation with Diffusion-Guided Source Data Generation
  3. 2025From Noisy to Native: LLM-driven Graph Restoration for Test-Time Graph Domain Adaptation
  4. 2023Transcending Domains through Text-to-Image Diffusion: A Source-Free Approach to Domain Adaptation
  5. 2024Cross-Domain Graph Data Scaling: A Showcase with Diffusion Models
  6. 2025Diffusion-Driven Progressive Target Manipulation for Source-Free Domain Adaptation
  7. 2025DiffGED: Computing Graph Edit Distance via Diffusion-based Graph Matching
  8. 2023Unsupervised Domain Adaptation via Domain-Adaptive Diffusion