articleOct 1, 2019Closed access

Semi-Supervised Domain Adaptation via Minimax Entropy

University of California, Berkeley

Indexed incrossref

Abstract

Contemporary domain adaptation methods are very effective at aligning feature distributions of source and target domains without any target supervision. However, we show that these techniques perform poorly when even a few labeled examples are available in the target domain. To address this semi-supervised domain adaptation (SSDA) setting, we propose a novel Minimax Entropy (MME) approach that adversarially optimizes an adaptive few-shot model. Our base model consists of a feature encoding network, followed by a classification layer that computes the features' similarity to estimated prototypes (representatives of each class). Adaptation is achieved by alternately maximizing the conditional entropy of…

Citation impact

658
total citations
FWCI
44.83
Percentile
100%
References
79
Citations per year

Authors

5

Topics & keywords

Keywords
  • Computer science
  • Domain adaptation
  • Entropy (arrow of time)
  • Artificial intelligence
  • Encoder
  • Pattern recognition (psychology)
  • Minimax
  • Source code
No related works found for this paper.