INSURE: An Information Theory Inspired Disentanglement and Purification Model for Domain Generalization
Not on the map. Why?
Abstract (arXiv)
Domain Generalization (DG) aims to learn a generalizable model on the unseen target domain by only training on the multiple observed source domains. Although a variety of DG methods have focused on extracting domain-invariant features, the domain-specific class-relevant features have attracted attention and been argued to benefit generalization to the unseen target domain. To take into account the class-relevant domain-specific information, in this paper we propose an Information theory iNspired diSentanglement and pURification modEl (INSURE) to explicitly disentangle the latent features to obtain sufficient and compact (necessary) class-relevant feature for generalization to the unseen domain. Specifically, we first propose an information theory inspired loss function to ensure the disentangled class-relevant features contain sufficient class label information and the other disentangled auxiliary feature has sufficient domain information. We further propose a paired purification loss function to let the auxiliary feature discard all the class-relevant information and thus the class-relevant feature will contain sufficient and compact (necessary) class-relevant information. Moreover, instead of using multiple encoders, we propose to use a learnable binary mask as our disentangler to make the disentanglement more efficient and make the disentangled features complementary to each other. We conduct extensive experiments on four widely used DG benchmark datasets including PACS, OfficeHome, TerraIncognita, and DomainNet. The proposed INSURE outperforms the state-of-art methods. We also empirically show that domain-specific class-relevant features are beneficial for domain generalization.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 71 of its 97 references that are in the map. First posted on arXiv 8 Sep 2023.
Builds on
71 of 97 references.
References · 71
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
- 2019Invariant Risk Minimizationcited by 1,832
- 2017Domain Randomization for Transferring Deep Neural Networks from Simulation to the Real Worldcited by 1,401
- 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
- 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,194
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
- 2020In Search of Lost Domain Generalizationcited by 1,042
38 more
- 2017Deeper, Broader and Artier Domain Generalizationcited by 983
- 2016Deep Variational Information Bottleneckcited by 915
- 2017Learning to Generalize: Meta-Learning for Domain Generalizationcited by 762
- 2021Generalizing to Unseen Domains: A Survey on Domain Generalizationcited by 762
- 2021Domain Generalization: A Surveycited by 760
- 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 737
- 2018Recognition in Terra Incognitacited by 655
- 2021Domain Generalization with MixStylecited by 563
- 2018Generalizing to Unseen Domains via Adversarial Data Augmentationcited by 451
- 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 431
- 2020Self-Challenging Improves Cross-Domain Generalizationcited by 426
- 2021A Fourier-based Framework for Domain Generalizationcited by 287
- 2021Gradient Matching for Domain Generalizationcited by 258
- 2019Adversarial Domain Adaptation with Domain Mixupcited by 250
- 2021Invariance Principle Meets Information Bottleneck for Out-of-Distribution Generalizationcited by 220
- 2020Learning Robust Representations via Multi-View Information Bottleneckcited by 189
- 2020Improve Unsupervised Domain Adaptation with Mixup Trainingcited by 185
- 2020Adaptive Risk Minimization: Learning to Adapt to Domain Shiftcited by 183
- 2017Domain Generalization by Marginal Transfer Learningcited by 180
- 2022Surrogate Gap Minimization Improves Sharpness-Aware Trainingcited by 171
- 2021Learning to Diversify for Single Domain Generalizationcited by 170
- 2021FSDR: Frequency Space Domain Randomization for Domain Generalizationcited by 163
- 2020Domain Adaptive Ensemble Learningcited by 156
- 2021Ensemble of Averages: Improving Model Selection and Boosting Performance in Domain Generalizationcited by 144
- 2022Causality Inspired Representation Learning for Domain Generalizationcited by 136
- 2020Learning to Balance Specificity and Invariance for In and Out of Domain Generalizationcited by 128
- 2020Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustnesscited by 121
- 2021Open Domain Generalization with Domain-Augmented Meta-Learningcited by 115
- 2019DIVA: Domain Invariant Variational Autoencoderscited by 114
- 2019Domain Agnostic Learning with Disentangled Representationscited by 107
- 2020Heterogeneous Domain Generalization via Domain Mixupcited by 103
- 2020Learning to Learn with Variational Information Bottleneck for Domain Generalizationcited by 102
- 2023Sharpness-Aware Gradient Matching for Domain Generalizationcited by 102
- 2021Towards Principled Disentanglement for Domain Generalizationcited by 91
- 2019Support and Invertibility in Domain-Invariant Representationscited by 87
- 2021Invariant Information Bottleneck for Domain Generalizationcited by 86
- 2021Exploiting Domain-Specific Features to Enhance Domain Generalizationcited by 86
- 2019Domain Generalization via Multidomain Discriminant Analysiscited by 69
50 most cited of 71 All 71 (JSON)
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025Fault Diagnosis across Heterogeneous Domains via Self-Adaptive Temporal-Spatial Attention and Sample Generationcited by 1
- 2025Minimal Semantic Sufficiency Meets Unsupervised Domain Generalizationcited by 1
- 2025DMAGaze: Gaze Estimation Based on Feature Disentanglement and Multi-Scale Attentioncited by 0
- 2026Domain Generalization via Text-Anchored Information Bottleneckcited by 0
- 2026Domain Generalization via Text-Anchored Information Bottleneck2 Jul 2026
- 2025Minimal Semantic Sufficiency Meets Unsupervised Domain Generalization19 Sep 2025
- 2025Fault Diagnosis across Heterogeneous Domains via Self-Adaptive Temporal-Spatial Attention and Sample Generation16 May 2025
- 2025DMAGaze: Gaze Estimation Based on Feature Disentanglement and Multi-Scale Attention15 Apr 2025