about
DomainBed: In Search of Lost Domain Generalization (arxiv.org)
2 points by seek3r00 on Jul 6, 2020 | hide | past | pdf | discuss on HN

In plain words: Built a shared testbed that compares ways of teaching AI to handle unfamiliar data, using the same datasets, networks, and rules for picking the best version. Plain training on the given data matched or beat every fancier method across all seven datasets.

Abstract · In Search of Lost Domain Generalization

The goal of domain generalization algorithms is to predict well on distributions different from those seen during training. While a myriad of domain generalization algorithms exist, inconsistencies in experimental conditions -- datasets, architectures, and model selection criteria -- render fair and realistic comparisons difficult. In this paper, we are interested in understanding how useful domain generalization algorithms are in realistic settings. As a first step, we realize that model selection is non-trivial for domain generalization tasks. Contrary to prior work, we argue that domain generalization algorithms without a model selection strategy should be regarded as incomplete. Next, we implement DomainBed, a testbed for domain generalization including seven multi-domain datasets, nine baseline algorithms, and three model selection criteria. We conduct extensive experiments using DomainBed and find that, when carefully implemented, empirical risk minimization shows state-of-the-art performance across all datasets. Looking forward, we hope that the release of DomainBed, along with contributions from fellow researchers, will streamline reproducible and rigorous research in domain generalization.

Ishaan Gulrajani, David Lopez-Paz
arXiv:2007.01434 · cs.LG, stat.ML · submitted Jul 2, 2020
abstract · pdf · html

add comment on HN