Bridging Domains with Approximately Shared Features
Not on the map. Why?
Abstract (arXiv)
Multi-source domain adaptation aims to reduce performance degradation when applying machine learning models to unseen domains. A fundamental challenge is devising the optimal strategy for feature selection. Existing literature is somewhat paradoxical: some advocate for learning invariant features from source domains, while others favor more diverse features. To address the challenge, we propose a statistical framework that distinguishes the utilities of features based on the variance of their correlation to label y across domains. Under our framework, we design and analyze a learning procedure consisting of learning approximately shared feature representation from source tasks and fine-tuning it on the target task. Our theoretical analysis necessitates the importance of learning approximately shared features instead of only the strictly invariant features and yields an improved population risk compared to previous results on both source and target tasks, thus partly resolving the paradox mentioned above. Inspired by our theory, we proposed a more practical way to isolate the content (invariant+approximately shared) from environmental features and further consolidate our theoretical findings.
Key facts. Cited by 2 papers in the map (data through 13 Oct 2026). Builds on 44 of its 63 references that are in the map. First posted on arXiv 11 Mar 2024.
Builds on
44 of 63 references.
References · 44
- 2015Deep Residual Learning for Image Recognitioncited by 51,950
- 2015Domain-Adversarial Training of Neural Networkscited by 3,030
- 2019Invariant Risk Minimizationcited by 1,842
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,384
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,371
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,183
- 2019Unsupervised Data Augmentation for Consistency Trainingcited by 1,058
- 2020In Search of Lost Domain Generalizationcited by 1,048
- 2017Grad-CAM++: Improved Visual Explanations for Deep Convolutional Networkscited by 938
- 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 919
- 2022Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distributioncited by 732
- 2018Recognition in Terra Incognitacited by 656
32 more
- 2018Deep Visual Domain Adaptation: A Surveycited by 634
- 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 523
- 2020An Investigation of Why Overparameterization Exacerbates Spurious Correlationscited by 310
- 2020Few-Shot Learning via Learning the Representation, Provablycited by 213
- 2020Invariant Risk Minimization Gamescited by 188
- 2020On the Theory of Transfer Learning: The Importance of Task Diversitycited by 186
- 2020Theoretical Analysis of Self-Training with Deep Networks on Unlabeled Datacited by 179
- 2020Provable Meta-Learning of Linear Representationscited by 161
- 2020Understanding Self-Training for Gradual Domain Adaptationcited by 149
- 2021Self-supervised Learning is More Robust to Dataset Imbalancecited by 122
- 2021AdaMatch: A Unified Approach to Semi-Supervised Learning and Domain Adaptationcited by 104
- 2014Domain-Adversarial Neural Networkscited by 78
- 2020Self-training Avoids Using Spurious Features Under Domain Shiftcited by 69
- 2022Connect, Not Collapse: Explaining Contrastive Learning for Unsupervised Domain Adaptationcited by 66
- 2020Robustness to Spurious Correlations via Human Annotationscited by 62
- 2020In-N-Out: Pre-Training and Self-Training using Auxiliary Information for Out-of-Distribution Robustnesscited by 50
- 2021A Theory of Label Propagation for Subpopulation Shiftcited by 48
- 2022Beyond Separability: Analyzing the Linear Transferability of Contrastive Representations to Related Subpopulationscited by 44
- 2021Nonlinear Invariant Risk Minimization: A Causal Approachcited by 42
- 2021How Fine-Tuning Allows for Effective Meta-Learningcited by 41
- 2020The Advantage of Conditional Meta-Learning for Biased Regularization and Fine-Tuningcited by 40
- 2021Near-Optimal Linear Regression under Distribution Shiftcited by 40
- 2022Calibrated ensembles can mitigate accuracy tradeoffs under distribution shiftcited by 34
- 2022A new similarity measure for covariate shift with applications to nonparametric regressioncited by 33
- 2021Iterative Feature Matching: Toward Provable Domain Generalization with Logarithmic Environmentscited by 30
- 2022Sample Efficiency of Data Augmentation Consistency Regularizationcited by 28
- 2020Strong Consistency, Graph Laplacians, and the Stochastic Block Modelcited by 21
- 2021Information-theoretic regularization for Multi-source Domain Adaptationcited by 15
- 2023Domain Generalization via Nuclear Norm Regularizationcited by 12
- 2014Adaptation Algorithm and Theory Based on Generalized Discrepancycited by 9
- 2023Algorithm-Dependent Bounds for Representation Learning of Multi-Source Domain Adaptationcited by 7
- 2023Improved theoretical guarantee for rank aggregation via spectral methodcited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.