Unsupervised Multi-Class Domain Adaptation: Theory, Algorithms, and Practice

• URL: http://arxiv.org/abs/2002.08681v2
• Date: Sun, 22 Nov 2020 09:36:34 GMT
• Title: Unsupervised Multi-Class Domain Adaptation: Theory, Algorithms, and Practice
• Authors: Yabin Zhang, Bin Deng, Hui Tang, Lei Zhang, and Kui Jia
• Abstract summary: We study the formalism of unsupervised multi-class domain adaptation (multi-class UDA) We introduce a new algorithm of Domain-Symmetric Networks (SymmNets)
• Score: 41.26481166771589
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we study the formalism of unsupervised multi-class domain adaptation (multi-class UDA), which underlies a few recent algorithms whose learning objectives are only motivated empirically. Multi-Class Scoring Disagreement (MCSD) divergence is presented by aggregating the absolute margin violations in multi-class classification, and this proposed MCSD is able to fully characterize the relations between any pair of multi-class scoring hypotheses. By using MCSD as a measure of domain distance, we develop a new domain adaptation bound for multi-class UDA; its data-dependent, probably approximately correct bound is also developed that naturally suggests adversarial learning objectives to align conditional feature distributions across source and target domains. Consequently, an algorithmic framework of Multi-class Domain-adversarial learning Networks (McDalNets) is developed, and its different instantiations via surrogate learning objectives either coincide with or resemble a few recently popular methods, thus (partially) underscoring their practical effectiveness. Based on our identical theory for multi-class UDA, we also introduce a new algorithm of Domain-Symmetric Networks (SymmNets), which is featured by a novel adversarial strategy of domain confusion and discrimination. SymmNets affords simple extensions that work equally well under the problem settings of either closed set, partial, or open set UDA. We conduct careful empirical studies to compare different algorithms of McDalNets and our newly introduced SymmNets. Experiments verify our theoretical analysis and show the efficacy of our proposed SymmNets. In addition, we have made our implementation code publicly available.

Related papers

• MLNet: Mutual Learning Network with Neighborhood Invariance for Universal Domain Adaptation [70.62860473259444]
  Universal domain adaptation (UniDA) is a practical but challenging problem. Existing UniDA methods may suffer from the problems of overlooking intra-domain variations in the target domain. We propose a novel Mutual Learning Network (MLNet) with neighborhood invariance for UniDA.
  arXiv  Detail & Related papers  (2023-12-13T03:17:34Z)
• Domain Adaptive Few-Shot Open-Set Learning [36.39622440120531]
  We propose Domain Adaptive Few-Shot Open Set Recognition (DA-FSOS) and introduce a meta-learning-based architecture named DAFOSNET. Our training approach ensures that DAFOS-NET can generalize well to new scenarios in the target domain. We present three benchmarks for DA-FSOS based on the Office-Home, mini-ImageNet/CUB, and DomainNet datasets.
  arXiv  Detail & Related papers  (2023-09-22T12:04:47Z)
• Label Distribution Learning for Generalizable Multi-source Person Re-identification [48.77206888171507]
  Person re-identification (Re-ID) is a critical technique in the video surveillance system. It is difficult to directly apply the supervised model to arbitrary unseen domains. We propose a novel label distribution learning (LDL) method to address the generalizable multi-source person Re-ID task.
  arXiv  Detail & Related papers  (2022-04-12T15:59:10Z)
• Semi-supervised Domain Adaptive Structure Learning [72.01544419893628]
  Semi-supervised domain adaptation (SSDA) is a challenging problem requiring methods to overcome both 1) overfitting towards poorly annotated data and 2) distribution shift across domains. We introduce an adaptive structure learning method to regularize the cooperation of SSL and DA.
  arXiv  Detail & Related papers  (2021-12-12T06:11:16Z)
• f-Domain-Adversarial Learning: Theory and Algorithms [82.97698406515667]
  Unsupervised domain adaptation is used in many machine learning applications where, during training, a model has access to unlabeled data in the target domain. We derive a novel generalization bound for domain adaptation that exploits a new measure of discrepancy between distributions based on a variational characterization of f-divergences.
  arXiv  Detail & Related papers  (2021-06-21T18:21:09Z)
• Information-theoretic regularization for Multi-source Domain Adaptation [5.444459446244819]
  Adversarial learning strategy has demonstrated remarkable performance in dealing with single-source Domain Adaptation (DA) problems. It has recently been applied to Multi-source DA (MDA) problems. Here we adopt an information-theoretic approach to identify and resolve the potential adverse effect of the multiple domain discriminators on MDA.
  arXiv  Detail & Related papers  (2021-04-04T09:11:35Z)
• A Theory of Multiple-Source Adaptation with Limited Target Labeled Data [66.53679520072978]
  We show that a new family of algorithms based on model selection ideas benefits from very favorable guarantees in this scenario. We also report the results of several experiments with our algorithms that demonstrate their practical effectiveness.
  arXiv  Detail & Related papers  (2020-07-19T19:34:48Z)

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.