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

Ting-Wei Li, Ruizhong Qiu, Hanghang Tong
5/22/2025
cs.LG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{li2025graph,
  title  = {Graph Data Selection for Domain Adaptation: A Model-Free Approach},
  author = {Ting-Wei Li and Ruizhong Qiu and Hanghang Tong},
  year   = {2025},
  eprint = {2505.17293},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.17293v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.17293.svg)](https://codeofpaper.com/paper/2505.17293)

Discussion