mlsanityData to 7 Oct 2026

Disentangling Masked Autoencoders for Unsupervised Domain Generalization

arXiv 2407.07544 ↗First posted 10 Jul 2024cs.CV cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Domain Generalization (DG), designed to enhance out-of-distribution (OOD) generalization, is all about learning invariance against domain shifts utilizing sufficient supervision signals. Yet, the scarcity of such labeled data has led to the rise of unsupervised domain generalization (UDG) - a more important yet challenging task in that models are trained across diverse domains in an unsupervised manner and eventually tested on unseen domains. UDG is fast gaining attention but is still far from well-studied. To close the research gap, we propose a novel learning framework designed for UDG, termed the Disentangled Masked Auto Encoder (DisMAE), aiming to discover the disentangled representations that faithfully reveal the intrinsic features and superficial variations without access to the class label. At its core is the distillation of domain-invariant semantic features, which cannot be distinguished by domain classifier, while filtering out the domain-specific variations (for example, color schemes and texture patterns) that are unstable and redundant. Notably, DisMAE co-trains the asymmetric dual-branch architecture with semantic and lightweight variation encoders, offering dynamic data manipulation and representation level augmentation capabilities. Extensive experiments on four benchmark datasets (i.e., DomainNet, PACS, VLCS, Colored MNIST) with both DG and UDG tasks demonstrate that DisMAE can achieve competitive OOD performance compared with the state-of-the-art DG and UDG baselines, which shed light on potential research line in improving the generalization ability with large-scale unlabeled data.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 46 of its 60 references that are in the map. First posted on arXiv 10 Jul 2024.

Builds on

46 of 60 references.

References · 46

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  4. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  5. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
  6. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  7. 2020Exploring Simple Siamese Representation Learningcited by 2,853
  8. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
  9. 2021BEiT: BERT Pre-Training of Image Transformerscited by 2,360
  10. 2020Improved Baselines with Momentum Contrastive Learningcited by 2,282
  11. 2019Invariant Risk Minimizationcited by 1,832
  12. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,818
34 more
  1. 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
  2. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
  3. 2021SimMIM: A Simple Framework for Masked Image Modelingcited by 1,147
  4. 2020In Search of Lost Domain Generalizationcited by 1,042
  5. 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,013
  6. 2017Deeper, Broader and Artier Domain Generalizationcited by 983
  7. 2021Generalizing to Unseen Domains: A Survey on Domain Generalizationcited by 762
  8. 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 737
  9. 2022Context Autoencoder for Self-Supervised Representation Learningcited by 297
  10. 2018Generalizing Across Domains via Cross-Gradient Trainingcited by 268
  11. 2021Invariance Principle Meets Information Bottleneck for Out-of-Distribution Generalizationcited by 220
  12. 2021Fishr: Invariant Gradient Variances for Out-of-Distribution Generalizationcited by 186
  13. 2020Improve Unsupervised Domain Adaptation with Mixup Trainingcited by 185
  14. 2021FSDR: Frequency Space Domain Randomization for Domain Generalizationcited by 163
  15. 2021On Calibration and Out-of-domain Generalizationcited by 134
  16. 2021AdaRNN: Adaptive Learning and Forecasting of Time Seriescited by 120
  17. 2021Toward Understanding the Feature Learning Process of Self-supervised Contrastive Learningcited by 119
  18. 2021Open Domain Generalization with Domain-Augmented Meta-Learningcited by 115
  19. 2019Domain Agnostic Learning with Disentangled Representationscited by 107
  20. 2021Towards a Theoretical Framework of Out-of-Distribution Generalizationcited by 94
  21. 2021Towards Principled Disentanglement for Domain Generalizationcited by 91
  22. 2021OoD-Bench: Quantifying and Understanding Two Dimensions of Out-of-Distribution Generalizationcited by 86
  23. 2021Exploiting Domain-Specific Features to Enhance Domain Generalizationcited by 86
  24. 2022NICO++: Towards Better Benchmarking for Domain Generalizationcited by 86
  25. 2020Learning Disentangled Semantic Representation for Domain Adaptationcited by 54
  26. 2020DecAug: Out-of-Distribution Generalization via Decomposed Feature Representation and Semantic Augmentationcited by 48
  27. 2021Self-Supervised Learning Disentangled Group Representation as Featurecited by 47
  28. 2021Towards Unsupervised Domain Generalizationcited by 40
  29. 2023The SSL Interplay: Augmentations, Inductive Bias, and Generalizationcited by 40
  30. 2022Domain-invariant Feature Exploration for Domain Generalizationcited by 34
  31. 2021Unsupervised Domain Generalization by Learning a Bridge Across Domainscited by 33
  32. 2023Domain Generalization via Rationale Invariancecited by 16
  33. 2022Equivariance and Invariance Inductive Bias for Learning from Insufficient Datacited by 14
  34. 2022Domain Invariant Masked Autoencoders for Self-supervised Learning from Multi-domainscited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 1.

3 papers.