Unsupervised Multi-Target Domain Adaptation: An Information Theoretic Approach

Behnam Gholami, Pritish Sahu, Ognjen (Oggi) Rudovic, Konstantinos Bousmalis, Vladimir Pavlovic

Abstract:

Unsupervised domain adaptation (uDA) models focus on pairwise adaptation settings where there is a single, labeled, source and a single target domain. However, in many real-world settings one seeks to adapt to multiple, but somewhat similar, target domains. Applying pairwise adaptation approaches to this setting may be suboptimal, as they would fail to leverage shared information among the multiple domains. In this work we propose an information theoretic approach for domain adaptation in the novel context of multiple target domains with unlabeled instances and one source domain with labeled instances. Our model aims to find a shared latent space common to all domains, while simultaneously accounting for the remaining private, domain-specific factors. Disentanglement of shared and private information is accomplished using a unified information-theoretic approach, which also serves to provide a stronger link between the latent representations and the observed data. The resulting single model, accompanied by an efficient optimization algorithm, allows simultaneous adaptation from a single source to multiple target domains.
We test our approach on three publicly-available datasets, showing that it outperforms several popular domain adaptation methods.

Data: [MNIST](https://paperswithcode.com/dataset/mnist), [MNIST-M](https://paperswithcode.com/dataset/mnist-m), [PACS](https://paperswithcode.com/dataset/pacs), [SVHN](https://paperswithcode.com/dataset/svhn)

Community Implementations: [ 1 code implementation](https://www.catalyzex.com/paper/unsupervised-multi-target-domain-adaptation/code)