mlsanityData to 7 Oct 2026

Graph Data Selection for Domain Adaptation: A Model-Free Approach

arXiv 2505.17293 ↗First posted 22 May 2025cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Graph domain adaptation (GDA) is a fundamental task in graph machine learning, with techniques like shift-robust graph neural networks (GNNs) and specialized training procedures to tackle the distribution shift problem. Although these model-centric approaches show promising results, they often struggle with severe shifts and constrained computational resources. To address these challenges, we propose a novel model-free framework, GRADATE (GRAph DATa sElector), that selects the best training data from the source domain for the classification task on the target domain. GRADATE picks training samples without relying on any GNN model's predictions or training recipes, leveraging optimal transport theory to capture and adapt to distribution changes. GRADATE is data-efficient, scalable and meanwhile complements existing model-centric GDA approaches. Through comprehensive empirical studies on several real-world graph-level datasets and multiple covariate shift types, we demonstrate that GRADATE outperforms existing selection methods and enhances off-the-shelf GDA methods with much fewer training data.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 49 of its 85 references that are in the map. First posted on arXiv 22 May 2025.

Builds on

49 of 85 references.

References · 49

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2018How Powerful are Graph Neural Networks?cited by 4,355
  5. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  6. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  7. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  8. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
  9. 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
  10. 2023DoReMi: Optimizing Data Mixtures Speeds Up Language Model Pretrainingcited by 385
  11. 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
  12. 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 224
37 more
  1. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
  2. 2024Data Mixing Laws: Optimizing Data Mixtures by Predicting Language Modeling Performancecited by 179
  3. 2024RegMix: Data Mixture as Regression for Language Model Pre-trainingcited by 172
  4. 2020Geometric Dataset Distances via Optimal Transportcited by 157
  5. 2022DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problemscited by 127
  6. 2020From Local Structures to Size Generalization in Graph Neural Networkscited by 119
  7. 2022Condensing Graphs via One-Step Gradient Matchingcited by 100
  8. 2018Fused Gromov-Wasserstein distance for structured objects: theoretical foundations and mathematical propertiescited by 93
  9. 2014Propagation Kernelscited by 88
  10. 2023DoGE: Domain Reweighting with Generalization Estimationcited by 87
  11. 2021Size-Invariant Graph Representations for Graph Classification Extrapolationscited by 82
  12. 2024Discrete-state Continuous-time Diffusion for Graph Generationcited by 73
  13. 2023LAVA: Data Valuation without Pre-Specified Learning Algorithmscited by 69
  14. 2019Graph Transfer Learning via Adversarial Domain Adaptation with Graph Convolutioncited by 67
  15. 2020SkipGNN: Predicting Molecular Interactions with Skip-Graph Networkscited by 44
  16. 2022Non-IID Transfer Learning on Graphscited by 43
  17. 2022Tree Mover's Distance: Bridging Graph Metrics and Stability of Graph Neural Networkscited by 39
  18. 2024How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmarkcited by 39
  19. 2022OOD Link Prediction Generalization Capabilities of Message-Passing GNNs in Larger Test Graphscited by 38
  20. 2019AdaGCN: Adaboosting Graph Convolutional Networks into Deep Modelscited by 37
  21. 2024Rethinking Propagation for Unsupervised Graph Domain Adaptationcited by 31
  22. 2023Class-Imbalanced Graph Learning without Class Rebalancingcited by 29
  23. 2023Ensuring User-side Fairness in Dynamic Recommender Systemscited by 27
  24. 2024Pairwise Alignment Improves Graph Domain Adaptationcited by 25
  25. 2023Hierarchical Multi-Marginal Optimal Transport for Network Alignmentcited by 24
  26. 2025Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesicscited by 17
  27. 2023MuSe-GNN: Learning Unified Gene Representation From Multimodal Biological Graph Datacited by 14
  28. 2024Smoothness Really Matters: A Simple Yet Effective Approach for Unsupervised Graph Domain Adaptationcited by 14
  29. 2023A Metadata-Driven Approach to Understand Graph Neural Networkscited by 10
  30. 2025Joint Optimal Transport and Embedding for Network Alignmentcited by 10
  31. 2022Improving Molecular Representation Learning with Metric Learning-enhanced Optimal Transportcited by 9
  32. 2022On a linear fused Gromov-Wasserstein distance for graph structured datacited by 9
  33. 2023Multi-Behavior Recommendation with Cascading Graph Convolution Networkscited by 8
  34. 2023A Survey on Graph Classification and Link Prediction based on GNNcited by 8
  35. 2024Rank and Align: Towards Effective Source-free Graph Domain Adaptationcited by 7
  36. 2023OpenGDA: Graph Domain Adaptation Benchmark for Cross-network Learningcited by 5
  37. 2025Subsampling Graphs with GNN Performance Guaranteescited by 4

Built on by

Cited by year (2026 to 7 Oct)

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

7 papers.