Dynamically Decoding Source Domain Knowledge for Domain Generalization
Not on the map. Why?
Abstract (arXiv)
Optimizing the performance of classifiers on samples from unseen domains remains a challenging problem. While most existing studies on domain generalization focus on learning domain-invariant feature representations, multi-expert frameworks have been proposed as a possible solution and have demonstrated promising performance. However, current multi-expert learning frameworks fail to fully exploit source domain knowledge during inference, resulting in sub-optimal performance. In this work, we propose to adapt Transformers for the purpose of dynamically decoding source domain knowledge for domain generalization. Specifically, we build one domain-specific local expert per source domain and one domain-agnostic feature branch as query. A Transformer encoder encodes all domain-specific features as source domain knowledge in memory. In the Transformer decoder, the domain-agnostic query interacts with the memory in the cross-attention module, and domains that are similar to the input will contribute more to the attention output. Thus, source domain knowledge gets dynamically decoded for inference of the current input from unseen domain. This mechanism enables the proposed method to generalize well to unseen domains. The proposed method has been evaluated on three benchmarks in the domain generalization field and shown to have the best performance compared to state-of-the-art methods.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 31 of its 38 references that are in the map. First posted on arXiv 6 Oct 2021.
Builds on
31 of 38 references.
References · 31
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020End-to-End Object Detection with Transformerscited by 7,384
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
- 2020In Search of Lost Domain Generalizationcited by 1,042
- 2017Deeper, Broader and Artier Domain Generalizationcited by 983
- 2017Learning to Generalize: Meta-Learning for Domain Generalizationcited by 762
- 2021Generalizing to Unseen Domains: A Survey on Domain Generalizationcited by 762
- 2013Domain Generalization via Invariant Feature Representationcited by 622
- 2021Domain Generalization with MixStylecited by 563
19 more
- 2018Generalizing to Unseen Domains via Adversarial Data Augmentationcited by 451
- 2019Domain Generalization by Solving Jigsaw Puzzlescited by 449
- 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 431
- 2020Self-Challenging Improves Cross-Domain Generalizationcited by 426
- 2019Domain Generalization via Model-Agnostic Learning of Semantic Featurescited by 405
- 2021Bottleneck Transformers for Visual Recognitioncited by 364
- 2017Unified Deep Supervised Domain Adaptation and Generalizationcited by 322
- 2020Learning to Generate Novel Domains for Domain Generalizationcited by 296
- 2018Generalizing Across Domains via Cross-Gradient Trainingcited by 268
- 2015Domain Generalization for Object Recognition with Multi-task Autoencoderscited by 253
- 2019Episodic Training for Domain Generalizationcited by 245
- 2019Domain Generalization Using a Mixture of Multiple Latent Domainscited by 170
- 2019Learning to Optimize Domain Specific Normalization for Domain Generalizationcited by 160
- 2020Domain Adaptive Ensemble Learningcited by 156
- 2018Best sources forward: domain generalization through source-specific netscited by 81
- 2021Generalizable Person Re-identification with Relevance-aware Mixture of Expertscited by 77
- 2018Domain Generalization with Domain-Specific Aggregation Modulescited by 61
- 2020Towards Recognizing Unseen Categories in Unseen Domainscited by 56
- 2020Discriminative Adversarial Domain Generalization with Meta-learning based Cross-domain Validationcited by 16
Built on by
Citing papers per year: 2024: 1.
1 paper.