Generalizing to Unseen Domains via Adversarial Data Augmentation

By Riccardo Volpi, Hongseok Namkoong, Ozan Sener, John C. Duchi, Vittorio Murino, Silvio Savarese. 2018

918 citations recorded by the source corpus.

We are concerned with learning models that generalize well to different \emph{unseen} domains. We consider a worst-case formulation over data distributions that are near the source domain in the feature space. Only using training data from a single source distribution, we propose an iterative procedure that augments the dataset with examples from a fictitious target domain that is "hard" under the current model. We show that our iterative scheme is an adaptive data augmentation method where we append adversarial examples at each iteration. For softmax losses, we show that our method is a data-dependent regularization scheme that behaves differently from classical regularizers that regularize towards zero (e.g., ridge or lasso). On digit recognition and semantic segmentation tasks, our method learns models improve performance across a range of a priori unknown target domains.

Subfields: Artificial Intelligence, Radiology, Nuclear Medicine and Imaging, Safety, Robustness & Interpretability

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Tao A. Xiang
  2. Eric P. Xing
  3. Dacheng Tao
  4. Timothy M. Hospedales
  5. Yongxin Yang
  6. Kaiyang Zhou
  7. Sergey Levine
  8. Percy Liang

In Radiology, Nuclear Medicine and Imaging

  1. P. Heng
  2. Qi-Yan Dou
  3. Jing Qin
  4. Yongxin Yang
  5. Timothy M. Hospedales
  6. David Lopez-Paz
  7. Ishaan Gulrajani
  8. Jia-Bin Huang

In Safety, Robustness & Interpretability

  1. John C. Duchi
  2. Pradeep Ravikumar
  3. Hongseok Namkoong
  4. Yongxin Yang
  5. Timothy M. Hospedales
  6. Riccardo Volpi
  7. Vittorio Murino
  8. David Lopez-Paz

Citations in the corpus