Given labeled instances on a source domain and unlabeled ones on a target domain, unsupervised domain adaptation aims to learn a task classifier that can well classify target instances. Recent advances rely on domain-adversarial training of deep networks to learn domain-invariant features. However, due to an issue of mode collapse induced by the separate design of task and domain classifiers, these methods are limited in aligning the joint distributions of feature and category across domains. To overcome it, we propose a novel adversarial learning method termed Discriminative Adversarial Domain Adaptation (DADA). Based on an integrated category and domain classifier, DADA has a novel adversarial objective that encourages a mutually inhibitory relation between category and domain predictions for any input instance. We show that under practical conditions, it defines a minimax game that can promote the joint distribution alignment. Except for the traditional closed set domain adaptation, we also extend DADA for extremely challenging problem settings of partial and open set domain adaptation. Experiments show the efficacy of our proposed methods and we achieve the new state of the art for all the three settings on benchmark datasets.

提出了一种基于判别式对抗领域适应(DADA)的新型对抗学习方法，其鼓励在输入实例的任何情况下，类别和域预测之间存在相互抑制关系，以解决现有方法中任务和域分类器相互独立导致的收敛问题，该方法能够在实际条件下定义一个最小极值博弈，促进联合分布对齐。除传统的闭集领域适应以外，还将DADA扩展到部分和开放集领域适应的极具挑战性的问题设置中，在基准数据集上实验表明了该方法的有效性并达到了三个场景下的最新成果。

判别式对抗领域自适应