Generalizing Across Domains via Cross-Gradient Training

Shiv Shankar*, Vihari Piratla*, Soumen Chakrabarti, Siddhartha Chaudhuri, Preethi Jyothi, Sunita Sarawagi

Abstract:

We present CROSSGRAD , a method to use multi-domain training data to learn a classifier that generalizes to new domains. CROSSGRAD does not need an adaptation phase via labeled or unlabeled data, or domain features in the new domain. Most existing domain adaptation methods attempt to erase domain signals using techniques like domain adversarial training. In contrast, CROSSGRAD is free to use domain signals for predicting labels, if it can prevent overfitting on training domains. We conceptualize the task in a Bayesian setting, in which a sampling step is implemented as data augmentation, based on domain-guided perturbations of input instances. CROSSGRAD jointly trains a label and a domain classifier on examples perturbed by loss gradients of each other’s objectives. This enables us to directly perturb inputs, without separating and re-mixing domain signals while making various distributional assumptions. Empirical evaluation on three different applications where this setting is natural establishes that
(1) domain-guided perturbation provides consistently better generalization to unseen domains, compared to generic instance perturbation methods, and
(2) data augmentation is a more stable and accurate method than domain adversarial training.

TL;DR: Domain guided augmentation of data provides a robust and stable method of domain generalization

Keywords: domain generalization, domain adaptation, adversarial learning, adversarial examples

Code: [ vihari/crossgrad](https://github.com/vihari/crossgrad)

Data: [MNIST](https://paperswithcode.com/dataset/mnist), [PACS](https://paperswithcode.com/dataset/pacs)

Community Implementations: [ 2 code implementations](https://www.catalyzex.com/paper/arxiv:1804.10745/code)