Unveiling the Superior Paradigm: A Comparative Study of Source-Free Domain Adaptation and Unsupervised Domain Adaptation
Not on the map. Why?
Abstract (arXiv)
In domain adaptation, there are two popular paradigms: Unsupervised Domain Adaptation (UDA), which aligns distributions using source data, and Source-Free Domain Adaptation (SFDA), which leverages pre-trained source models without accessing source data. Evaluating the superiority of UDA versus SFDA is an open and timely question with significant implications for deploying adaptive algorithms in practical applications. In this study, we demonstrate through predictive coding theory and extensive experiments on multiple benchmark datasets that SFDA generally outperforms UDA in real-world scenarios. Specifically, SFDA offers advantages in time efficiency, storage requirements, targeted learning objectives, reduced risk of negative transfer, and increased robustness against overfitting. Notably, SFDA is particularly effective in mitigating negative transfer when there are substantial distribution discrepancies between source and target domains. Additionally, we introduce a novel data-model fusion scenario, where data sharing among stakeholders varies (e.g., some provide raw data while others provide only models), and reveal that traditional UDA and SFDA methods do not fully exploit their potential in this context. To address this limitation and capitalize on the strengths of SFDA, we propose a novel weight estimation method that effectively integrates available source data into multi-SFDA (MSFDA) approaches, thereby enhancing model performance within this scenario. This work provides a thorough analysis of UDA versus SFDA and advances a practical approach to model adaptation across diverse real-world environments.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 66 references that are in the map. First posted on arXiv 24 Nov 2024.
Builds on
18 of 66 references.
References · 18
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
- 2020In Search of Lost Domain Generalizationcited by 1,042
- 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
- 2016Deep Transfer Learning with Joint Adaptation Networkscited by 609
- 2019Bridging Theory and Algorithm for Domain Adaptationcited by 332
- 2021Exploiting the Intrinsic Neighborhood Structure for Source-free Domain Adaptationcited by 176
- 2021Model Adaptation: Historical Contrastive Learning for Unsupervised Domain Adaptation without Source Datacited by 152
- 2021Source-free Domain Adaptation via Avatar Prototype Generation and Adaptationcited by 111
- 2017Adversarial Dropout Regularizationcited by 106
- 2022Attracting and Dispersing: A Simple Approach for Source-free Domain Adaptationcited by 93
- 2022Balancing Discriminability and Transferability for Source-Free Domain Adaptationcited by 58
6 more
- 2021Your Classifier can Secretly Suffice Multi-Source Domain Adaptationcited by 42
- 2019Domain Aggregation Networks for Multi-Source Domain Adaptationcited by 37
- 2022On Balancing Bias and Variance in Unsupervised Multi-Source-Free Domain Adaptationcited by 16
- 2017Conditional Adversarial Domain Adaptationcited by 10
- 2022OneRing: A Simple Method for Source-free Open-partial Domain Adaptationcited by 2
- 2024A Class-aware Optimal Transport Approach with Higher-Order Moment Matching for Unsupervised Domain Adaptationcited by 2
Built on by
Not cited yet.