Learning to Learn Single Domain Generalization

By Fengchun Qiao, Long Zhao, Xi Peng. Computer Vision and Pattern Recognition, 2020

556 citations recorded by the source corpus.

We are concerned with a worst-case scenario in model generalization, in the sense that a model aims to perform well on many unseen domains while there is only one single domain available for training. We propose a new method named adversarial domain augmentation to solve this Out-of-Distribution (OOD) generalization problem. The key idea is to leverage adversarial training to create "fictitious" yet "challenging" populations, from which a model can learn to generalize with theoretical guarantees. To facilitate fast and desirable domain augmentation, we cast the model training in a meta-learning scheme and use a Wasserstein Auto-Encoder (WAE) to relax the widely used worst-case constraint. Detailed theoretical analysis is provided to testify our formulation, while extensive experiments on multiple benchmark datasets indicate its superior performance in tackling single domain generalization.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/89b95fb53727ee45be440045efef656718517c4c

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. Chen Change Loy
  2. Yu Qiao
  3. Ziwei Liu
  4. Kaiyang Zhou
  5. Tao A. Xiang
  6. P. Heng
  7. Qi-Yan Dou
  8. Jing Qin

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Chen Change Loy
  3. Dacheng Tao
  4. Yu Qiao
  5. Xiaogang Wang
  6. Ming-Hsuan Yang
  7. Yi Yang
  8. Cordelia Schmid

Citations in the corpus