Dual Moving Average Pseudo-Labeling for Source-Free Inductive Domain Adaptation
Not on the map. Why?
Abstract (arXiv)
Unsupervised domain adaptation reduces the reliance on data annotation in deep learning by adapting knowledge from a source to a target domain. For privacy and efficiency concerns, source-free domain adaptation extends unsupervised domain adaptation by adapting a pre-trained source model to an unlabeled target domain without accessing the source data. However, most existing source-free domain adaptation methods to date focus on the transductive setting, where the target training set is also the testing set. In this paper, we address source-free domain adaptation in the more realistic inductive setting, where the target training and testing sets are mutually exclusive. We propose a new semi-supervised fine-tuning method named Dual Moving Average Pseudo-Labeling (DMAPL) for source-free inductive domain adaptation. We first split the unlabeled training set in the target domain into a pseudo-labeled confident subset and an unlabeled less-confident subset according to the prediction confidence scores from the pre-trained source model. Then we propose a soft-label moving-average updating strategy for the unlabeled subset based on a moving-average prototypical classifier, which gradually adapts the source model towards the target domain. Experiments show that our proposed method achieves state-of-the-art performance and outperforms previous methods by large margins.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 27 of its 39 references that are in the map. First posted on arXiv 15 Dec 2022.
Builds on
27 of 39 references.
References · 27
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
- 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
- 2017CyCADA: Cycle-Consistent Adversarial Domain Adaptationcited by 1,079
- 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
- 2018ADVENT: Adversarial Entropy Minimization for Domain Adaptation in Semantic Segmentationcited by 623
- 2014Deep Domain Confusion: Maximizing for Domain Invariancecited by 597
- 2018Learning to Adapt Structured Output Space for Semantic Segmentationcited by 584
- 2017VisDA: The Visual Domain Adaptation Challengecited by 432
- 2019Confidence Regularized Self-Trainingcited by 418
- 2019Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptationcited by 235
- 2020Universal Source-Free Domain Adaptationcited by 219
15 more
- 2018A DIRT-T Approach to Unsupervised Domain Adaptationcited by 215
- 2021Exploiting the Intrinsic Neighborhood Structure for Source-free Domain Adaptationcited by 176
- 2021Generalized Source-free Domain Adaptationcited by 175
- 2021Model Adaptation: Historical Contrastive Learning for Unsupervised Domain Adaptation without Source Datacited by 152
- 2020Towards Discriminability and Diversity: Batch Nuclear-norm Maximization under Label Insufficient Situationscited by 133
- 2021Cycle Self-Training for Domain Adaptationcited by 120
- 2021Source-free Domain Adaptation via Avatar Prototype Generation and Adaptationcited by 111
- 2021AdaMatch: A Unified Approach to Semi-Supervised Learning and Domain Adaptationcited by 104
- 2021Domain Impression: A Source Data Free Domain Adaptation Methodcited by 91
- 2019HoMM: Higher-order Moment Matching for Unsupervised Domain Adaptationcited by 89
- 2022A Closer Look at Smoothness in Domain Adversarial Trainingcited by 85
- 2022Confidence Score for Source-Free Unsupervised Domain Adaptationcited by 58
- 2022Balancing Discriminability and Transferability for Source-Free Domain Adaptationcited by 58
- 2021Unsupervised Domain Adaptation of Black-Box Source Modelscited by 32
- 2021Visualizing Adapted Knowledge in Domain Transfercited by 32
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.