mlsanityData to 14 Oct 2026

Analysis of Pseudo-Labeling for Online Source-Free Universal Domain Adaptation

arXiv 2504.11992 ↗First posted 16 Apr 2025cs.LG cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

A domain (distribution) shift between training and test data often hinders the real-world performance of deep neural networks, necessitating unsupervised domain adaptation (UDA) to bridge this gap. Online source-free UDA has emerged as a solution for practical scenarios where access to source data is restricted and target data is received as a continuous stream. However, the open-world nature of many real-world applications additionally introduces category shifts meaning that the source and target label spaces may differ. Online source-free universal domain adaptation (SF-UniDA) addresses this challenge. Existing methods mainly rely on self-training with pseudo-labels, yet the relationship between pseudo-labeling and adaptation outcomes has not been studied yet. To bridge this gap, we conduct a systematic analysis through controlled experiments with simulated pseudo-labeling, offering valuable insights into pseudo-labeling for online SF-UniDA. Our findings reveal a substantial gap between the current state-of-the-art and the upper bound of adaptation achieved with perfect pseudo-labeling. Moreover, we show that a contrastive loss enables effective adaptation even with moderate pseudo-label accuracy, while a cross-entropy (CE) loss, though less robust to pseudo-label errors, achieves superior results when pseudo-labeling approaches perfection. Lastly, our findings indicate that pseudo-label accuracy is in general more crucial than quantity, suggesting that prioritizing fewer but high-confidence pseudo-labels is beneficial. Overall, our study highlights the critical role of pseudo-labeling in (online) SF-UniDA and provides actionable insights to drive future advancements in the field. Our code is available at https://github.com/pascalschlachter/PLAnalysis.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 16 references that are in the map. First posted on arXiv 16 Apr 2025.

Builds on

12 of 16 references.

References · 12

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Microsoft COCO: Common Objects in Contextcited by 17,608
  3. 2020Universal Source-Free Domain Adaptationcited by 220
  4. 2020Towards Inheritable Models for Open-Set Domain Adaptationcited by 64
  5. 2023Upcycling Models under Domain and Category Shiftcited by 29
  6. 2024LEAD: Learning Decomposition for Source-free Universal Domain Adaptationcited by 25
  7. 2021UMAD: Universal Model Adaptation under Domain and Category Shiftcited by 23
  8. 2020Open-Set Hypothesis Transfer with Semantic Consistencycited by 11
  9. 2024GLC++: Source-Free Universal Domain Adaptation through Global-Local Clustering and Contrastive Affinity Learningcited by 4
  10. 2024Memory-Efficient Pseudo-Labeling for Online Source-Free Universal Domain Adaptation using a Gaussian Mixture Modelcited by 4
  11. 2023COCA: Classifier-Oriented Calibration via Textual Prototype for Source-Free Universal Domain Adaptationcited by 3
  12. 2024COMET: Contrastive Mean Teacher for Online Source-Free Universal Domain Adaptationcited by 2

Built on by

Not cited yet.