Pith. sign in

REVIEW 6 cited by

Graph Domain Adaptation: Challenges, Progress and Prospects

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.00904 v1 pith:FPZHSOEF submitted 2024-02-01 cs.LG cs.AI

classification cs.LGcs.AI
keywords graphsgraphadaptationdomainlearningchallengesdetailedknowledge
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

As graph representation learning often suffers from label scarcity problems in real-world applications, researchers have proposed graph domain adaptation (GDA) as an effective knowledge-transfer paradigm across graphs. In particular, to enhance model performance on target graphs with specific tasks, GDA introduces a bunch of task-related graphs as source graphs and adapts the knowledge learnt from source graphs to the target graphs. Since GDA combines the advantages of graph representation learning and domain adaptation, it has become a promising direction of transfer learning on graphs and has attracted an increasing amount of research interest in recent years. In this paper, we comprehensively overview the studies of GDA and present a detailed survey of recent advances. Specifically, we outline the research status and challenges, propose a taxonomy, introduce the details of representative works, and discuss the prospects. To the best of our knowledge, this paper is the first survey for graph domain adaptation. A detailed paper list is available at https://github.com/Skyorca/Awesome-Graph-Domain-Adaptation-Papers.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Urban Representation Learning for Fine-grained Economic Mapping: A Semi-supervised Graph-based Approach

    cs.LG 2025-05 reject novelty 5.0 of 10

    A semi-supervised graph framework maps sectoral GDP from multimodal urban data, but its headline R² scores are weakened by potential test-set leakage and test-set-based tuning.

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

    cs.LG 2024-12 conditional novelty 5.0 of 10

    A simple Laplacian smoothing loss applied to the target graph, with random-walk neighbor sampling, improves unsupervised graph domain adaptation on citation networks.

  3. Homophily Enhanced Graph Domain Adaptation

    cs.SI 2025-05 reject novelty 4.0 of 10

    Graph domain adaptation fails more when source and target graphs have different local homophily profiles, and the proposed HGDA filters and aligns homophily, heterophily, and attribute signals to improve cross-graph n...

  4. Domain Adaptive Unfolded Graph Neural Networks

    cs.LG 2024-11 conditional novelty 4.0 of 10

    Cascaded propagation, re-feeding the output of an unfolded GNN through its message passing, gives small but consistent gains in graph domain adaptation.

  5. On the Benefits of Attribute-Driven Graph Domain Adaptation

    cs.LG 2025-02 reject novelty 3.0 of 10

    The paper claims node attribute shift matters more than topology shift in graph domain adaptation, but the proof and loss formulation contain critical errors.

  6. Exploring Graph Mamba: A Comprehensive Survey on State-Space Models for Graph Learning

    cs.LG 2024-12 conditional novelty 2.0 of 10

    A survey of Graph Mamba, the adaptation of state-space models (Mamba, S4, S6) to graph learning, synthesizing roughly 30 recent papers into a taxonomy of architectures, applications, benchmarks, and open challenges.

Pith tools