Adversarial Feature Augmentation for Unsupervised Domain Adaptation

Riccardo Volpi, Pietro Morerio, Silvio Savarese, Vittorio Murino
11/23/2017
cs.CV

Official code: ricvolpi/adversarial-feature-augmentation (131 stars, MIT, last commit 2019-01-08).

Abstract

Recent works showed that Generative Adversarial Networks (GANs) can be successfully applied in unsupervised domain adaptation, where, given a labeled source dataset and an unlabeled target dataset, the goal is to train powerful classifiers for the target samples. In particular, it was shown that a GAN objective function can be used to learn target features indistinguishable from the source ones. In this work, we extend this framework by (i) forcing the learned feature extractor to be domain-invariant, and (ii) training it through data augmentation in the feature space, namely performing feature augmentation. While data augmentation in the image space is a well established technique in deep learning, feature augmentation has not yet received the same level of attention. We accomplish it by means of a feature generator trained by playing the GAN minimax game against source features. Results show that both enforcing domain-invariance and performing feature augmentation lead to superior or comparable performance to state-of-the-art results in several unsupervised domain adaptation benchmarks.

View on arXivView PDF

Code Implementations(1)

MIT

Code for the paper "Adversarial Feature Augmentation for Unsupervised Domain Adaptation", CVPR 2018

13135Shell, PythonNov 18, 20177 years agoMIT

Similar Papers

Cite this paper

@article{volpi2017adversarial,
  title  = {Adversarial Feature Augmentation for Unsupervised Domain Adaptation},
  author = {Riccardo Volpi and Pietro Morerio and Silvio Savarese and Vittorio Murino},
  year   = {2017},
  eprint = {1711.08561},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1711.08561}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1711.08561.svg)](https://codeofpaper.com/paper/1711.08561)

Discussion