Graph-Relational Domain Adaptation

• URL: http://arxiv.org/abs/2202.03628v2
• Date: Fri, 21 Apr 2023 02:40:15 GMT
• Title: Graph-Relational Domain Adaptation
• Authors: Zihao Xu, Hao He, Guang-He Lee, Yuyang Wang, Hao Wang
• Abstract summary: Existing domain adaptation methods treat every domain equally and align them all perfectly. In this work, we relax such uniform alignment by using a domain graph to encode domain adjacency. We generalize the existing adversarial learning framework with a novel graph discriminator.
• Score: 21.47087742618527
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Existing domain adaptation methods tend to treat every domain equally and align them all perfectly. Such uniform alignment ignores topological structures among different domains; therefore it may be beneficial for nearby domains, but not necessarily for distant domains. In this work, we relax such uniform alignment by using a domain graph to encode domain adjacency, e.g., a graph of states in the US with each state as a domain and each edge indicating adjacency, thereby allowing domains to align flexibly based on the graph structure. We generalize the existing adversarial learning framework with a novel graph discriminator using encoding-conditioned graph embeddings. Theoretical analysis shows that at equilibrium, our method recovers classic domain adaptation when the graph is a clique, and achieves non-trivial alignment for other types of graphs. Empirical results show that our approach successfully generalizes uniform alignment, naturally incorporates domain information represented by graphs, and improves upon existing domain adaptation methods on both synthetic and real-world datasets. Code will soon be available at https://github.com/Wang-ML-Lab/GRDA.

Related papers

• SA-GDA: Spectral Augmentation for Graph Domain Adaptation [38.71041292000361]
  Graph neural networks (GNNs) have achieved impressive impressions for graph-related tasks. This paper presents the textitSpectral Augmentation for Graph Domain Adaptation (method) for graph node classification. We develop a dual graph convolutional network to jointly exploits local and global consistency for feature aggregation.
  arXiv  Detail & Related papers  (2024-08-17T13:01:45Z)
• Cross-domain Named Entity Recognition via Graph Matching [25.237288970802425]
  Cross-domain NER is a practical yet challenging problem since the data scarcity in the real-world scenario. We model the label relationship as a probability distribution and construct label graphs in both source and target label spaces. By representing label relationships as graphs, we formulate cross-domain NER as a graph matching problem.
  arXiv  Detail & Related papers  (2024-08-02T02:31:54Z)
• Multi-label Image Classification using Adaptive Graph Convolutional Networks: from a Single Domain to Multiple Domains [8.02139126500224]
  This paper proposes an adaptive graph-based approach for multi-label image classification. It is done by integrating an attention-based mechanism and a similarity-preserving strategy. The proposed framework is then extended to multiple domains using an adversarial training scheme.
  arXiv  Detail & Related papers  (2023-01-11T14:42:47Z)
• Unsupervised Domain Adaptation for Point Cloud Semantic Segmentation via Graph Matching [14.876681993079062]
  We propose a graph-based framework to explore the local-level feature alignment between the two domains. We also formulate a category-guided contrastive loss to guide the segmentation model to learn discriminative features on the target domain.
  arXiv  Detail & Related papers  (2022-08-09T02:30:15Z)
• Efficient Hierarchical Domain Adaptation for Pretrained Language Models [77.02962815423658]
  Generative language models are trained on diverse, general domain corpora. We introduce a method to scale domain adaptation to many diverse domains using a computationally efficient adapter approach.
  arXiv  Detail & Related papers  (2021-12-16T11:09:29Z)
• Source Free Unsupervised Graph Domain Adaptation [60.901775859601685]
  Unsupervised Graph Domain Adaptation (UGDA) shows its practical value of reducing the labeling cost for node classification. Most existing UGDA methods heavily rely on the labeled graph in the source domain. In some real-world scenarios, the source graph is inaccessible because of privacy issues. We propose a novel scenario named Source Free Unsupervised Graph Domain Adaptation (SFUGDA)
  arXiv  Detail & Related papers  (2021-12-02T03:18:18Z)
• Batch Normalization Embeddings for Deep Domain Generalization [50.51405390150066]
  Domain generalization aims at training machine learning models to perform robustly across different and unseen domains. We show a significant increase in classification accuracy over current state-of-the-art techniques on popular domain generalization benchmarks.
  arXiv  Detail & Related papers  (2020-11-25T12:02:57Z)
• Cross-Domain Facial Expression Recognition: A Unified Evaluation Benchmark and Adversarial Graph Learning [85.6386289476598]
  We develop a novel adversarial graph representation adaptation (AGRA) framework for cross-domain holistic-local feature co-adaptation. We conduct extensive and fair evaluations on several popular benchmarks and show that the proposed AGRA framework outperforms previous state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-08-03T15:00:31Z)
• Adversarial Graph Representation Adaptation for Cross-Domain Facial Expression Recognition [86.25926461936412]
  We propose a novel Adrialversa Graph Representation Adaptation (AGRA) framework that unifies graph representation propagation with adversarial learning for cross-domain holistic-local feature co-adaptation. We conduct extensive and fair experiments on several popular benchmarks and show that the proposed AGRA framework achieves superior performance over previous state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-08-03T13:27:24Z)
• 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)

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.