English

Learning to Learn Single Domain Generalization

Computer Vision and Pattern Recognition 2020-03-31 v1

Abstract

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.

Keywords

Cite

@article{arxiv.2003.13216,
  title  = {Learning to Learn Single Domain Generalization},
  author = {Fengchun Qiao and Long Zhao and Xi Peng},
  journal= {arXiv preprint arXiv:2003.13216},
  year   = {2020}
}

Comments

In CVPR 2020 (13 pages including supplementary material). The source code and pre-trained models are publicly available at: https://github.com/joffery/M-ADA

R2 v1 2026-06-23T14:31:20.742Z