We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2003.13216")
get_code_for_paper("2003.13216")
have("2003.13216")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2003.13216.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2003.13216)
Connect an agent — have() is free.