Browse State-of-the-Art › GRAPH DOMAIN ADAPTATION
GRAPH DOMAIN ADAPTATION
20 papers with code · 1 benchmark · 0 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
1 leaderboard table shown for this task, 1 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| FRANKENSTEIN (1 row) | GALA | GALA: Graph Diffusion-based Alignment with Jigsaw for Source-free... | code | — | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 40 · with a code link: 20 · where Syntology ran a sample: 8 (7 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (8 of 40 tagged: 7 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 40 of 40, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
18 Feb 2020 2 repositories listed Syntology official: harvested, nothing ran · 8 ran (of which 7 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified (of 11 harvested samples) · 11 pointer-only (licence)This motivates us to propose an adversarial cross-network deep network embedding (ACDNE) model to integrate adversarial domain adaptation with deep network embedding so as to learn network-invariant node representations…
-
3 Jun 2019 2 repositories listedRecent works reveal that network embedding techniques enable many machine learning models to handle diverse downstream tasks on graph structured data.
-
12 Jun 2025 1 repository listedTransferring extensive knowledge from relevant social networks has emerged as a promising solution to overcome label scarcity in detecting social bots and other anomalies with GNN-based models.
-
22 May 2025 1 repository listed Syntology official (archive's flag): 7 ran · 7 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified (of 10 harvested samples) · 10 pointer-only (licence)This paper addresses the challenge of graph domain adaptation on evolving, multiple out-of-distribution (OOD) graphs.
-
13 Mar 2025 1 repository listedAs the first comprehensive library in this area, PyGDA covers more than 20 widely used graph domain adaptation methods together with different types of graph datasets.
-
16 Dec 2024 1 repository listedGiven 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…
-
22 Oct 2024 1 repository listedTo achieve domain alignment, GALA employs a graph diffusion model to reconstruct source-style graphs from target data.
-
13 Sep 2024 1 repository listedTo address the issue, we study the problem of active graph domain adaptation, which selects a small quantitative of informative nodes on the target graph for extra annotation.
-
27 Jul 2024 1 repository listedUGDA aims to facilitate knowledge transfer from a labeled source graph to an unlabeled target graph.
-
9 Jul 2024 1 repository listed Syntology official: no sample here; runs from other or unrecorded repositories · 38 ran (of which 0 constructed an object rather than computing a result; 26 with no instrument failure: 4 honoured, 0 violated, 22 with no contract checked; 12 where Syntology's instrument failed) · 9 unverified (of 47 harvested samples) · 21 pointer-only (licence)Unsupervised Graph Domain Adaptation (UGDA) involves the transfer of knowledge from a label-rich source graph to an unlabeled target graph under domain discrepancies.
-
3 Mar 2024 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 1 unverified (of 1 harvested sample) · 1 pointer-only (licence)Unsupervised Graph Domain Adaptation (UGDA) has emerged as a practical solution to transfer knowledge from a label-rich source graph to a completely unlabelled target graph.
-
2 Mar 2024 1 repository listed Syntology official (archive's flag): 5 ran · 5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified (of 5 harvested samples)Graph-based methods, pivotal for label inference over interconnected objects in many real-world applications, often encounter generalization challenges, if the graph used for model training differs significantly from…
-
8 Feb 2024 1 repository listed Syntology official (archive's flag): 1 ran · 3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples) · 3 pointer-only (licence)Motivated by our empirical analysis, we reevaluate the role of GNNs in graph domain adaptation and uncover the pivotal role of the propagation process in GNNs for adapting to different graph domains.
-
1 Feb 2024 1 repository listedTo the best of our knowledge, this paper is the first survey for graph domain adaptation.
-
31 Aug 2023 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 3 harvested samples) · 3 pointer-only (licence)Cross-network node classification (CNNC), which aims to classify nodes in a label-deficient target network by transferring the knowledge from a source network with abundant labels, draws increasing attention recently.
-
21 Jul 2023 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 1 unverified (of 1 harvested sample)Overall, OpenGDA provides a user-friendly, scalable and reproducible benchmark for evaluating graph domain adaptation models.
-
5 Jun 2023 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified (of 7 harvested samples) · 7 pointer-only (licence)This work examines different impacts of distribution shifts caused by either graph structure or node attributes and identifies a new type of shift, named conditional structure shift (CSS), which current GDA approaches…
-
15 Dec 2022 1 repository listedTo bridge the gap, in this paper, we propose rigorous generalization bounds and algorithms for cross-network transfer learning from a source graph to a target graph.
-
2 Dec 2021 1 repository listed Syntology official (archive's flag): 8 ran · 8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified (of 9 harvested samples) · 3 pointer-only (licence)To address the non-trivial adaptation challenges in this practical scenario, we propose a model-agnostic algorithm called SOGA for domain adaptation to fully exploit the discriminative ability of the source model while…
-
4 Sep 2019 1 repository listedExisting methods for single network learning cannot solve this problem due to the domain shift across networks.
-
Homophily Enhanced Graph Domain Adaptation26 May 2025 0 repositories listedGraph Domain Adaptation (GDA) transfers knowledge from labeled source graphs to unlabeled target graphs, addressing the challenge of label scarcity.
-
Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesics19 May 2025 0 repositories listedGraph neural networks, despite their impressive performance, are highly vulnerable to distribution shifts on graphs.
-
Aggregate to Adapt: Node-Centric Aggregation for Multi-Source-Free Graph Domain Adaptation5 Feb 2025 0 repositories listedUnsupervised graph domain adaptation (UGDA) focuses on transferring knowledge from labeled source graph to unlabeled target graph under domain discrepancies.
-
On the Benefits of Attribute-Driven Graph Domain Adaptation4 Feb 2025 0 repositories listedGraph Domain Adaptation (GDA) addresses a pressing challenge in cross-network learning, particularly pertinent due to the absence of labeled data in real-world graph datasets.
-
Gradual Domain Adaptation for Graph Learning29 Jan 2025 0 repositories listedExisting literature lacks a graph domain adaptation technique for handling large distribution shifts, primarily due to the difficulty in simulating an evolving path from source to target graph.
-
Graph Domain Adaptation with Dual-branch Encoder and Two-level Alignment for Whole Slide Image-based Survival Prediction21 Nov 2024 0 repositories listedIn recent years, histopathological whole slide image (WSI)- based survival analysis has attracted much attention in medical image analysis.
-
Domain Adaptive Unfolded Graph Neural Networks20 Nov 2024 0 repositories listedOver the last decade, graph neural networks (GNNs) have made significant progress in numerous graph machine learning tasks.
-
Degree-Conscious Spiking Graph for Cross-Domain Adaptation9 Oct 2024 0 repositories listedSpiking Graph Networks (SGNs) have demonstrated significant potential in graph classification by emulating brain-inspired neural dynamics to achieve energy-efficient computation.
-
Rank and Align: Towards Effective Source-free Graph Domain Adaptation22 Aug 2024 0 repositories listedGraph neural networks (GNNs) have achieved impressive performance in graph domain adaptation.
-
SA-GDA: Spectral Augmentation for Graph Domain Adaptation17 Aug 2024 0 repositories listedGraph neural networks (GNNs) have achieved impressive impressions for graph-related tasks.
-
Core Knowledge Learning Framework for Graph Adaptation and Scalability Learning2 Jul 2024 0 repositories listed
-
Graph Learning under Distribution Shifts: A Comprehensive Survey on Domain Adaptation, Out-of-distribution, and Continual Learning26 Feb 2024 0 repositories listed
-
Semi-supervised Domain Adaptation in Graph Transfer Learning19 Sep 2023 0 repositories listed
-
Bridged-GNN: Knowledge Bridge Learning for Effective Knowledge Transfer18 Aug 2023 0 repositories listed
-
Coarse-to-fine Knowledge Graph Domain Adaptation based on Distantly-supervised Iterative Training5 Nov 2022 0 repositories listed
-
Graph Domain Adaptation: A Generative View14 Jun 2021 0 repositories listed
-
GDA-HIN: A Generalized Domain Adaptive Model across Heterogeneous Information Networks10 Dec 2020 0 repositories listed
-
Graph Domain Adaptation for Alignment-Invariant Brain Surface Segmentation31 Mar 2020 0 repositories listed
-
Graph Domain Adaptation with Localized Graph Signal Representations7 Nov 2019 0 repositories listed
-
Domain Adaptation on Graphs by Learning Graph Topologies: Theoretical Analysis and an Algorithm17 Dec 2018 0 repositories listed
Syntology lines on 10 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections