Graph Domain Adaptation: A Generative View
- URL: http://arxiv.org/abs/2106.07482v1
- Date: Mon, 14 Jun 2021 15:11:57 GMT
- Title: Graph Domain Adaptation: A Generative View
- Authors: Ruichu Cai, Fengzhu Wu, Zijian Li, Pengfei Wei, Lingling Yi, Kun Zhang
- Abstract summary: We propose a disentanglement-based unsupervised domain adaptation method for the graph-structured data.
Our method significantly outperforms the traditional domain adaptation methods and the disentangled-based domain adaptation methods.
- Score: 24.92864775423047
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Recent years have witnessed tremendous interest in deep learning on
graph-structured data. Due to the high cost of collecting labeled
graph-structured data, domain adaptation is important to supervised graph
learning tasks with limited samples. However, current graph domain adaptation
methods are generally adopted from traditional domain adaptation tasks, and the
properties of graph-structured data are not well utilized. For example, the
observed social networks on different platforms are controlled not only by the
different crowd or communities but also by the domain-specific policies and the
background noise. Based on these properties in graph-structured data, we first
assume that the graph-structured data generation process is controlled by three
independent types of latent variables, i.e., the semantic latent variables, the
domain latent variables, and the random latent variables. Based on this
assumption, we propose a disentanglement-based unsupervised domain adaptation
method for the graph-structured data, which applies variational graph
auto-encoders to recover these latent variables and disentangles them via three
supervised learning modules. Extensive experimental results on two real-world
datasets in the graph classification task reveal that our method not only
significantly outperforms the traditional domain adaptation methods and the
disentangled-based domain adaptation methods but also outperforms the
state-of-the-art graph domain adaptation algorithms.
Related papers
- Aggregate to Adapt: Node-Centric Aggregation for Multi-Source-Free Graph Domain Adaptation [29.723258309895655]
Unsupervised graph domain adaptation (UGDA) focuses on transferring knowledge from labeled source graph to unlabeled target graph.
We introduce a novel model named GraphATA which conducts adaptation at node granularity.
We also demonstrate the capability of GraphATA to generalize to both model-centric and layer-centric methods.
arXiv Detail & Related papers (2025-02-05T09:41:32Z) - AGLP: A Graph Learning Perspective for Semi-supervised Domain Adaptation [13.472532378889264]
In semi-supervised domain adaptation (SSDA), the model aims to leverage partially labeled target domain data along with a large amount of labeled source domain data.
This paper proposes a graph learning perspective (AGLP) for semi-supervised domain adaptation.
We apply the graph convolutional network to the instance graph which allows structural information to propagate along the weighted graph edges.
arXiv Detail & Related papers (2024-11-20T09:41:41Z) - MLDGG: Meta-Learning for Domain Generalization on Graphs [9.872254367103057]
Domain generalization on graphs aims to develop models with robust generalization capabilities.
Our framework, MLDGG, endeavors to achieve adaptable generalization across diverse domains by integrating cross-multi-domain meta-learning.
Our empirical results demonstrate that MLDGG surpasses baseline methods, showcasing its effectiveness in three different distribution shift settings.
arXiv Detail & Related papers (2024-11-19T22:57:38Z) - Collaborate to Adapt: Source-Free Graph Domain Adaptation via
Bi-directional Adaptation [40.25858820407687]
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.
We present a novel paradigm called GraphCTA, which performs model adaptation and graph adaptation collaboratively.
Our proposed model outperforms recent source-free baselines by large margins.
arXiv Detail & Related papers (2024-03-03T10:23:08Z) - Graph Learning under Distribution Shifts: A Comprehensive Survey on
Domain Adaptation, Out-of-distribution, and Continual Learning [53.81365215811222]
We provide a review and summary of the latest approaches, strategies, and insights that address distribution shifts within the context of graph learning.
We categorize existing graph learning methods into several essential scenarios, including graph domain adaptation learning, graph out-of-distribution learning, and graph continual learning.
We discuss the potential applications and future directions for graph learning under distribution shifts with a systematic analysis of the current state in this field.
arXiv Detail & Related papers (2024-02-26T07:52:40Z) - Improving Domain Generalization with Domain Relations [77.63345406973097]
This paper focuses on domain shifts, which occur when the model is applied to new domains that are different from the ones it was trained on.
We propose a new approach called D$3$G to learn domain-specific models.
Our results show that D$3$G consistently outperforms state-of-the-art methods.
arXiv Detail & Related papers (2023-02-06T08:11:16Z) - Graphonomy: Universal Image Parsing via Graph Reasoning and Transfer [140.72439827136085]
We propose a graph reasoning and transfer learning framework named "Graphonomy"
It incorporates human knowledge and label taxonomy into the intermediate graph representation learning beyond local convolutions.
It learns the global and structured semantic coherency in multiple domains via semantic-aware graph reasoning and transfer.
arXiv Detail & Related papers (2021-01-26T08:19:03Z) - Domain Adaptation in LiDAR Semantic Segmentation by Aligning Class
Distributions [9.581605678437032]
This work addresses the problem of unsupervised domain adaptation for LiDAR semantic segmentation models.
Our approach combines novel ideas on top of the current state-of-the-art approaches and yields new state-of-the-art results.
arXiv Detail & Related papers (2020-10-23T08:52:15Z) - A Review of Single-Source Deep Unsupervised Visual Domain Adaptation [81.07994783143533]
Large-scale labeled training datasets have enabled deep neural networks to excel across a wide range of benchmark vision tasks.
In many applications, it is prohibitively expensive and time-consuming to obtain large quantities of labeled data.
To cope with limited labeled training data, many have attempted to directly apply models trained on a large-scale labeled source domain to another sparsely labeled or unlabeled target domain.
arXiv Detail & Related papers (2020-09-01T00:06:50Z) - Supervised Domain Adaptation: A Graph Embedding Perspective and a
Rectified Experimental Protocol [87.76993857713217]
We show that Domain Adaptation methods using pair-wise relationships between source and target domain data can be formulated as a Graph Embedding.
Specifically, we analyse the loss functions of three existing state-of-the-art Supervised Domain Adaptation methods and demonstrate that they perform Graph Embedding.
arXiv Detail & Related papers (2020-04-23T15:46:20Z) - Supervised Domain Adaptation using Graph Embedding [86.3361797111839]
Domain adaptation methods assume that distributions between the two domains are shifted and attempt to realign them.
We propose a generic framework based on graph embedding.
We show that the proposed approach leads to a powerful Domain Adaptation framework.
arXiv Detail & Related papers (2020-03-09T12:25:13Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.