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

• URL: http://arxiv.org/abs/2504.11992v1
• Date: Wed, 16 Apr 2025 11:34:18 GMT
• Title: Analysis of Pseudo-Labeling for Online Source-Free Universal Domain Adaptation
• Authors: Pascal Schlachter, Jonathan Fuss, Bin Yang,
• Abstract summary: A shift between training and test data often hinders the real-world performance of deep neural networks.<n>Online source-free universal domain adaptation (SF-UniDA) addresses this challenge.<n>Existing methods mainly rely on self-training with pseudo-labels, yet the relationship between pseudo-labeling and adaptation outcomes has not been studied yet.
• Score: 3.1265626879839923
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 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.

Related papers

• Source-free domain adaptation based on label reliability for cross-domain bearing fault diagnosis [11.377646664126644]
  Source-free domain adaptation (SFDA) has been exploited for cross-domain bearing fault diagnosis without access to source data.<n>We propose a novel SFDA-based approach for bearing fault diagnosis that exploits both reliable and unreliable pseudo-labels.<n>Our approach achieves significant performance improvements against existing SFDA-based bearing fault diagnosis methods.
  arXiv  Detail & Related papers  (2025-03-11T13:02:18Z)
• Fuzzy-aware Loss for Source-free Domain Adaptation in Visual Emotion Recognition [17.617780698468465]
  Source-free domain adaptation in visual emotion recognition (SFDA-VER) is a highly challenging task.<n>We propose a novel fuzzy-aware loss (FAL) to enable the VER model to better learn and adapt to new domains under fuzzy labels.
  arXiv  Detail & Related papers  (2025-01-26T13:20:52Z)
• Trust And Balance: Few Trusted Samples Pseudo-Labeling and Temperature Scaled Loss for Effective Source-Free Unsupervised Domain Adaptation [16.5799094981322]
  We introduce Few Trusted Samples Pseudo-labeling (FTSP) and Temperature Scaled Adaptive Loss (TSAL) FTSP employs a limited subset of trusted samples from the target data to construct a classifier to infer pseudo-labels for the entire domain. TSAL is designed with a unique dual temperature scheduling, adeptly balance diversity, discriminability, and the incorporation of pseudo-labels.
  arXiv  Detail & Related papers  (2024-09-01T15:09:14Z)
• Unsupervised Domain Adaptation for Brain Vessel Segmentation through Transwarp Contrastive Learning [46.248404274124546]
  Unsupervised domain adaptation (UDA) aims to align the labelled source distribution with the unlabelled target distribution to obtain domain-invariant predictive models. This paper proposes a simple yet potent contrastive learning framework for UDA to narrow the inter-domain gap between labelled source and unlabelled target distribution.
  arXiv  Detail & Related papers  (2024-02-23T10:01:22Z)
• Online Feature Updates Improve Online (Generalized) Label Shift Adaptation [51.328801874640675]
  Our novel method, Online Label Shift adaptation with Online Feature Updates (OLS-OFU), leverages self-supervised learning to refine the feature extraction process. By carefully designing the algorithm, OLS-OFU maintains the similar online regret convergence to the results in the literature while taking the improved features into account.
  arXiv  Detail & Related papers  (2024-02-05T22:03:25Z)
• De-Confusing Pseudo-Labels in Source-Free Domain Adaptation [14.954662088592762]
  Source-free domain adaptation aims to adapt a source-trained model to an unlabeled target domain without access to the source data. We introduce a novel noise-learning approach tailored to address noise distribution in domain adaptation settings.
  arXiv  Detail & Related papers  (2024-01-03T10:07:11Z)
• All Points Matter: Entropy-Regularized Distribution Alignment for Weakly-supervised 3D Segmentation [67.30502812804271]
  Pseudo-labels are widely employed in weakly supervised 3D segmentation tasks where only sparse ground-truth labels are available for learning. We propose a novel learning strategy to regularize the generated pseudo-labels and effectively narrow the gaps between pseudo-labels and model predictions.
  arXiv  Detail & Related papers  (2023-05-25T08:19:31Z)
• Adapting to Online Label Shift with Provable Guarantees [137.89382409682233]
  We formulate and investigate the problem of online label shift. The non-stationarity and lack of supervision make the problem challenging to be tackled. Our algorithms enjoy optimal dynamic regret, indicating that performance is competitive with a clairvoyant nature.
  arXiv  Detail & Related papers  (2022-07-05T15:43:14Z)
• Unsupervised Domain Adaptive Salient Object Detection Through Uncertainty-Aware Pseudo-Label Learning [104.00026716576546]
  We propose to learn saliency from synthetic but clean labels, which naturally has higher pixel-labeling quality without the effort of manual annotations. We show that our proposed method outperforms the existing state-of-the-art deep unsupervised SOD methods on several benchmark datasets.
  arXiv  Detail & Related papers  (2022-02-26T16:03:55Z)
• Adaptive Pseudo-Label Refinement by Negative Ensemble Learning for Source-Free Unsupervised Domain Adaptation [35.728603077621564]
  Existing Unsupervised Domain Adaptation (UDA) methods presumes source and target domain data to be simultaneously available during training. A pre-trained source model is always considered to be available, even though performing poorly on target due to the well-known domain shift problem. We propose a unified method to tackle adaptive noise filtering and pseudo-label refinement.
  arXiv  Detail & Related papers  (2021-03-29T22:18:34Z)
• Cycle Self-Training for Domain Adaptation [85.14659717421533]
  Cycle Self-Training (CST) is a principled self-training algorithm that enforces pseudo-labels to generalize across domains. CST recovers target ground truth, while both invariant feature learning and vanilla self-training fail. Empirical results indicate that CST significantly improves over prior state-of-the-arts in standard UDA benchmarks.
  arXiv  Detail & Related papers  (2021-03-05T10:04:25Z)
• A Free Lunch for Unsupervised Domain Adaptive Object Detection without Source Data [69.091485888121]
  Unsupervised domain adaptation assumes that source and target domain data are freely available and usually trained together to reduce the domain gap. We propose a source data-free domain adaptive object detection (SFOD) framework via modeling it into a problem of learning with noisy labels.
  arXiv  Detail & Related papers  (2020-12-10T01:42:35Z)
• Selective Pseudo-Labeling with Reinforcement Learning for Semi-Supervised Domain Adaptation [116.48885692054724]
  We propose a reinforcement learning based selective pseudo-labeling method for semi-supervised domain adaptation. We develop a deep Q-learning model to select both accurate and representative pseudo-labeled instances. Our proposed method is evaluated on several benchmark datasets for SSDA, and demonstrates superior performance to all the comparison methods.
  arXiv  Detail & Related papers  (2020-12-07T03:37:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.