Trade-off between reconstruction loss and feature alignment for domain generalization
Not on the map. Why?
Abstract (arXiv)
Domain generalization (DG) is a branch of transfer learning that aims to train the learning models on several seen domains and subsequently apply these pre-trained models to other unseen (unknown but related) domains. To deal with challenging settings in DG where both data and label of the unseen domain are not available at training time, the most common approach is to design the classifiers based on the domain-invariant representation features, i.e., the latent representations that are unchanged and transferable between domains. Contrary to popular belief, we show that designing classifiers based on invariant representation features alone is necessary but insufficient in DG. Our analysis indicates the necessity of imposing a constraint on the reconstruction loss induced by representation functions to preserve most of the relevant information about the label in the latent space. More importantly, we point out the trade-off between minimizing the reconstruction loss and achieving domain alignment in DG. Our theoretical results motivate a new DG framework that jointly optimizes the reconstruction loss and the domain discrepancy. Both theoretical and numerical results are provided to justify our approach.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 30 of its 40 references that are in the map. First posted on arXiv 26 Oct 2022.
Builds on
30 of 40 references.
References · 30
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2019Invariant Risk Minimizationcited by 1,854
- 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,200
- 2020In Search of Lost Domain Generalizationcited by 1,054
- 2021Generalizing to Unseen Domains: A Survey on Domain Generalizationcited by 766
- 2021Domain Generalization: A Surveycited by 764
- 2013Domain Generalization via Invariant Feature Representationcited by 623
- 2020The Risks of Invariant Risk Minimizationcited by 262
- 2020Domain Generalization using Causal Matchingcited by 225
- 2021Invariance Principle Meets Information Bottleneck for Out-of-Distribution Generalizationcited by 220
- 2020Invariant Risk Minimization Gamescited by 188
- 2017Domain Generalization by Marginal Transfer Learningcited by 180
18 more
- 2020Understanding the Failure Modes of Out-of-Distribution Generalizationcited by 146
- 2021Does Invariant Risk Minimization Capture Invariance?cited by 116
- 2020Learning to Learn with Variational Information Bottleneck for Domain Generalizationcited by 102
- 2015Scatter Component Analysis: A Unified Framework for Domain Adaptation and Domain Generalizationcited by 96
- 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
- 2020Empirical or Invariant Risk Minimization? A Sample Complexity Perspectivecited by 62
- 2017From source to target and back: symmetric bi-directional adaptive GANcited by 53
- 2021Nonlinear Invariant Risk Minimization: A Causal Approachcited by 42
- 2020Feature Alignment and Restoration for Domain Generalization and Adaptationcited by 31
- 2020Respecting Domain Relations: Hypothesis Invariance for Domain Generalizationcited by 30
- 2021Iterative Feature Matching: Toward Provable Domain Generalization with Logarithmic Environmentscited by 30
- 2021Out-of-distribution Prediction with Invariant Risk Minimization: The Limitation and An Effective Fixcited by 27
- 2021Linear unit-tests for invariance discoverycited by 27
- 2022Conditional entropy minimization principle for learning domain invariant representation featurescited by 3
- 2020Class Distribution Alignment for Adversarial Domain Adaptationcited by 2
- 2022Joint covariate-alignment and concept-alignment: a framework for domain generalizationcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.