Unsupervised Domain Adaptation for Extra Features in the Target Domain Using Optimal Transport

• URL: http://arxiv.org/abs/2209.04594v1
• Date: Sat, 10 Sep 2022 04:35:58 GMT
• Title: Unsupervised Domain Adaptation for Extra Features in the Target Domain Using Optimal Transport
• Authors: Toshimitsu Aritake and Hideitsu Hino
• Abstract summary: Most domain adaptation methods assume that the source and target domains have the same dimensionality. In this paper, it is assumed that common features exist in both domains and that extra (new additional) features are observed in the target domain. To leverage the homogeneity of the common features, the adaptation between these source and target domains is formulated as an optimal transport problem.
• Score: 3.6042575355093907
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Domain adaptation aims to transfer knowledge of labeled instances obtained from a source domain to a target domain to fill the gap between the domains. Most domain adaptation methods assume that the source and target domains have the same dimensionality. Methods that are applicable when the number of features is different in each domain have rarely been studied, especially when no label information is given for the test data obtained from the target domain. In this paper, it is assumed that common features exist in both domains and that extra (new additional) features are observed in the target domain; hence, the dimensionality of the target domain is higher than that of the source domain. To leverage the homogeneity of the common features, the adaptation between these source and target domains is formulated as an optimal transport (OT) problem. In addition, a learning bound in the target domain for the proposed OT-based method is derived. The proposed algorithm is validated using both simulated and real-world data.

Related papers

• Meta-causal Learning for Single Domain Generalization [102.53303707563612]
  Single domain generalization aims to learn a model from a single training domain (source domain) and apply it to multiple unseen test domains (target domains) Existing methods focus on expanding the distribution of the training domain to cover the target domains, but without estimating the domain shift between the source and target domains. We propose a new learning paradigm, namely simulate-analyze-reduce, which first simulates the domain shift by building an auxiliary domain as the target domain, then learns to analyze the causes of domain shift, and finally learns to reduce the domain shift for model adaptation.
  arXiv  Detail & Related papers  (2023-04-07T15:46:38Z)
• Discovering Domain Disentanglement for Generalized Multi-source Domain Adaptation [48.02978226737235]
  A typical multi-source domain adaptation (MSDA) approach aims to transfer knowledge learned from a set of labeled source domains, to an unlabeled target domain. We propose a variational domain disentanglement (VDD) framework, which decomposes the domain representations and semantic features for each instance by encouraging dimension-wise independence.
  arXiv  Detail & Related papers  (2022-07-11T04:33:08Z)
• Exploiting Domain-Specific Features to Enhance Domain Generalization [10.774902700296249]
  Domain Generalization (DG) aims to train a model, from multiple observed source domains, in order to perform well on unseen target domains. Prior DG approaches have focused on extracting domain-invariant information across sources to generalize on target domains. We propose meta-Domain Specific-Domain Invariant (mD) - a novel theoretically sound framework.
  arXiv  Detail & Related papers  (2021-10-18T15:42:39Z)
• Self-Adversarial Disentangling for Specific Domain Adaptation [52.1935168534351]
  Domain adaptation aims to bridge the domain shifts between the source and target domains. Recent methods typically do not consider explicit prior knowledge on a specific dimension.
  arXiv  Detail & Related papers  (2021-08-08T02:36:45Z)
• Generalized Source-free Domain Adaptation [47.907168218249694]
  We propose a new domain adaptation paradigm called Generalized Source-free Domain Adaptation (G-SFDA) For target performance our method is on par with or better than existing DA and SFDA methods, specifically it achieves state-of-the-art performance (85.4%) on VisDA.
  arXiv  Detail & Related papers  (2021-08-03T16:34:12Z)
• Adaptive Domain-Specific Normalization for Generalizable Person Re-Identification [81.30327016286009]
  We propose a novel adaptive domain-specific normalization approach (AdsNorm) for generalizable person Re-ID. In this work, we propose a novel adaptive domain-specific normalization approach (AdsNorm) for generalizable person Re-ID.
  arXiv  Detail & Related papers  (2021-05-07T02:54:55Z)
• Disentanglement-based Cross-Domain Feature Augmentation for Effective Unsupervised Domain Adaptive Person Re-identification [87.72851934197936]
  Unsupervised domain adaptive (UDA) person re-identification (ReID) aims to transfer the knowledge from the labeled source domain to the unlabeled target domain for person matching. One challenge is how to generate target domain samples with reliable labels for training. We propose a Disentanglement-based Cross-Domain Feature Augmentation strategy.
  arXiv  Detail & Related papers  (2021-03-25T15:28:41Z)
• Cross-domain Self-supervised Learning for Domain Adaptation with Few Source Labels [78.95901454696158]
  We propose a novel Cross-Domain Self-supervised learning approach for domain adaptation. Our method significantly boosts performance of target accuracy in the new target domain with few source labels.
  arXiv  Detail & Related papers  (2020-03-18T15:11:07Z)
• Adapting Object Detectors with Conditional Domain Normalization [38.13526570506076]
  Conditional Domain Normalization (CDN) is designed to encode different domain inputs into a shared latent space. We incorporate CDN into various convolution stages of an object detector to adaptively address the domain shifts of different level's representation. Tests show that CDN outperforms existing methods remarkably on both real-to-real and synthetic-to-real adaptation benchmarks.
  arXiv  Detail & Related papers  (2020-03-16T08:27:29Z)

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.