Adaptive Domain Generalization via Online Disagreement Minimization
Xin Zhang, Ying-Cong Chen

TL;DR
This paper introduces AdaODM, a test-time adaptation framework for domain generalization that minimizes disagreement among source classifiers to improve performance on unseen target domains, achieving state-of-the-art results.
Contribution
AdaODM adaptively fine-tunes source models at test time by minimizing classifier disagreement, enhancing existing DG methods' performance on unseen domains.
Findings
AdaODM improves generalization on four DG benchmarks.
AdaODM achieves state-of-the-art performance.
Test-time disagreement minimization effectively aligns target features.
Abstract
Deep neural networks suffer from significant performance deterioration when there exists distribution shift between deployment and training. Domain Generalization (DG) aims to safely transfer a model to unseen target domains by only relying on a set of source domains. Although various DG approaches have been proposed, a recent study named DomainBed, reveals that most of them do not beat the simple Empirical Risk Minimization (ERM). To this end, we propose a general framework that is orthogonal to existing DG algorithms and could improve their performance consistently. Unlike previous DG works that stake on a static source model to be hopefully a universal one, our proposed AdaODM adaptively modifies the source model at test time for different target domains. Specifically, we create multiple domain-specific classifiers upon a shared domain-generic feature extractor. The feature extractor…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Respiratory viral infections research
MethodsCorrelation Alignment for Deep Domain Adaptation · Test
