mlsanityData to 7 Oct 2026

Dual Moving Average Pseudo-Labeling for Source-Free Inductive Domain Adaptation

arXiv 2212.08187 ↗First posted 15 Dec 2022cs.LG cs.CVcited by 2

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

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
  3. 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
  4. 2017CyCADA: Cycle-Consistent Adversarial Domain Adaptationcited by 1,079
  5. 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
  6. 2018ADVENT: Adversarial Entropy Minimization for Domain Adaptation in Semantic Segmentationcited by 623
  7. 2014Deep Domain Confusion: Maximizing for Domain Invariancecited by 597
  8. 2018Learning to Adapt Structured Output Space for Semantic Segmentationcited by 584
  9. 2017VisDA: The Visual Domain Adaptation Challengecited by 432
  10. 2019Confidence Regularized Self-Trainingcited by 418
  11. 2019Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptationcited by 235
  12. 2020Universal Source-Free Domain Adaptationcited by 219
15 more
  1. 2018A DIRT-T Approach to Unsupervised Domain Adaptationcited by 215
  2. 2021Exploiting the Intrinsic Neighborhood Structure for Source-free Domain Adaptationcited by 176
  3. 2021Generalized Source-free Domain Adaptationcited by 175
  4. 2021Model Adaptation: Historical Contrastive Learning for Unsupervised Domain Adaptation without Source Datacited by 152
  5. 2020Towards Discriminability and Diversity: Batch Nuclear-norm Maximization under Label Insufficient Situationscited by 133
  6. 2021Cycle Self-Training for Domain Adaptationcited by 120
  7. 2021Source-free Domain Adaptation via Avatar Prototype Generation and Adaptationcited by 111
  8. 2021AdaMatch: A Unified Approach to Semi-Supervised Learning and Domain Adaptationcited by 104
  9. 2021Domain Impression: A Source Data Free Domain Adaptation Methodcited by 91
  10. 2019HoMM: Higher-order Moment Matching for Unsupervised Domain Adaptationcited by 89
  11. 2022A Closer Look at Smoothness in Domain Adversarial Trainingcited by 85
  12. 2022Confidence Score for Source-Free Unsupervised Domain Adaptationcited by 58
  13. 2022Balancing Discriminability and Transferability for Source-Free Domain Adaptationcited by 58
  14. 2021Unsupervised Domain Adaptation of Black-Box Source Modelscited by 32
  15. 2021Visualizing Adapted Knowledge in Domain Transfercited by 32

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 1.

2 papers.