Semi-Supervised Noise Adaptation: Transferring Knowledge from Noise Domain

• URL: http://arxiv.org/abs/2606.00558v1
• Date: Sat, 30 May 2026 06:16:35 GMT
• Title: Semi-Supervised Noise Adaptation: Transferring Knowledge from Noise Domain
• Abstract summary: We develop a novel problem termed *Semi-Supervised Noise Adaptation* (SSNA)<n>We first establish a generalization bound characterizing the effect of the noise domain on generalization, based on which we propose a Noise Adaptation Framework (NAF)<n>Experiments demonstrate that NAF effectively leverages the noise domain to tighten the generalization bound of the target domain, leading to improved performance.
• Score: 16.169601998445295
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Transfer learning aims to facilitate the learning of a target domain by transferring knowledge from a source domain. The source domain typically contains semantically meaningful samples (*e.g.*, images) to facilitate effective knowledge transfer. However, a recent study observes that the noise domain constructed from simple distributions (*e.g.*, Gaussian distributions) can serve as a surrogate source domain in the semi-supervised setting, where only a small proportion of target samples are labeled while most remain unlabeled. Based on this surprising observation, we formulate a novel problem termed *Semi-Supervised Noise Adaptation* (SSNA), which aims to leverage a synthetic noise domain to improve the generalization of the target domain. To address this problem, we first establish a generalization bound characterizing the effect of the noise domain on generalization, based on which we propose a Noise Adaptation Framework (NAF). Extensive experiments demonstrate that NAF effectively leverages the noise domain to tighten the generalization bound of the target domain, leading to improved performance. The codes are available at https://github.com/AIResearch-Group/SSNA.

Related papers

• Multi-Prompt Progressive Alignment for Multi-Source Unsupervised Domain Adaptation [73.40696661117408]
  We propose a progressive alignment strategy for adapting CLIP to unlabeled downstream task.<n>We name our approach MP2A and test it on three popular UDA benchmarks, namely ImageCLEF, Office-Home, and the most challenging DomainNet.<n> Experiments showcase that MP2A achieves state-of-the-art performance when compared with most recent CLIP-based MS-UDA approaches.
  arXiv  Detail & Related papers  (2025-07-31T09:42:42Z)
• Cross-Domain Diffusion with Progressive Alignment for Efficient Adaptive Retrieval [52.67656818203429]
  Unsupervised efficient domain adaptive retrieval aims to transfer knowledge from a labeled source domain to an unlabeled target domain.<n>Existing methods fail to address potential noise in the target domain, and directly align high-level features across domains.<n>We propose a novel Cross-Domain Diffusion with Progressive Alignment method (COUPLE) to address these challenges.
  arXiv  Detail & Related papers  (2025-05-20T04:17:39Z)
• Noise-Aware Generalization: Robustness to In-Domain Noise and Out-of-Domain Generalization [19.405975017917957]
  Multi-source Domain Generalization (DG) aims to improve model robustness to new distributions.<n>However, DG methods often overlook the effect of label noise, which can confuse a model during training, reducing performance.<n>In this paper, we investigate this underexplored space, where models are evaluated under both distribution shifts and label noise.<n>Our proposed DL4ND approach improves noise detection by taking advantage of the observation that noisy samples that may appear indistinguishable within a single domain often show greater variation when compared across domains.
  arXiv  Detail & Related papers  (2025-04-03T19:37:57Z)
• 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)
• From Denoising Training to Test-Time Adaptation: Enhancing Domain Generalization for Medical Image Segmentation [8.36463803956324]
  We propose the Denoising Y-Net (DeY-Net), a novel approach incorporating an auxiliary denoising decoder into the basic U-Net architecture. The auxiliary decoder aims to perform denoising training, augmenting the domain-invariant representation that facilitates domain generalization. Building upon denoising training, we propose Denoising Test Time Adaptation (DeTTA) that further: (i) adapts the model to the target domain in a sample-wise manner, and (ii) adapts to the noise-corrupted input.
  arXiv  Detail & Related papers  (2023-10-31T08:39:15Z)
• Generative Model Based Noise Robust Training for Unsupervised Domain Adaptation [108.11783463263328]
  This paper proposes a Generative model-based Noise-Robust Training method (GeNRT) It eliminates domain shift while mitigating label noise. Experiments on Office-Home, PACS, and Digit-Five show that our GeNRT achieves comparable performance to state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-03-10T06:43:55Z)
• Divide and Contrast: Source-free Domain Adaptation via Adaptive Contrastive Learning [122.62311703151215]
  Divide and Contrast (DaC) aims to connect the good ends of both worlds while bypassing their limitations. DaC divides the target data into source-like and target-specific samples, where either group of samples is treated with tailored goals. We further align the source-like domain with the target-specific samples using a memory bank-based Maximum Mean Discrepancy (MMD) loss to reduce the distribution mismatch.
  arXiv  Detail & Related papers  (2022-11-12T09:21:49Z)
• Towards Robust Cross-domain Image Understanding with Unsupervised Noise Removal [18.21213151403402]
  We find that contemporary domain adaptation methods for cross-domain image understanding perform poorly when source domain is noisy. We propose a novel method, termed Noise Tolerant Domain Adaptation, for Weakly Supervised Domain Adaptation (WSDA) We conduct extensive experiments to evaluate the effectiveness of our method on both general images and medical images from COVID-19 and e-commerce datasets.
  arXiv  Detail & Related papers  (2021-09-09T14:06:59Z)
• Instance Level Affinity-Based Transfer for Unsupervised Domain Adaptation [74.71931918541748]
  We propose an instance affinity based criterion for source to target transfer during adaptation, called ILA-DA. We first propose a reliable and efficient method to extract similar and dissimilar samples across source and target, and utilize a multi-sample contrastive loss to drive the domain alignment process. We verify the effectiveness of ILA-DA by observing consistent improvements in accuracy over popular domain adaptation approaches on a variety of benchmark datasets.
  arXiv  Detail & Related papers  (2021-04-03T01:33:14Z)
• Divergence Optimization for Noisy Universal Domain Adaptation [32.05829135903389]
  Universal domain adaptation (UniDA) has been proposed to transfer knowledge learned from a label-rich source domain to a label-scarce target domain. This paper introduces a two-head convolutional neural network framework to solve all problems simultaneously.
  arXiv  Detail & Related papers  (2021-04-01T04:16:04Z)
• Alleviating Semantic-level Shift: A Semi-supervised Domain Adaptation Method for Semantic Segmentation [97.8552697905657]
  A key challenge of this task is how to alleviate the data distribution discrepancy between the source and target domains. We propose Alleviating Semantic-level Shift (ASS), which can successfully promote the distribution consistency from both global and local views. We apply our ASS to two domain adaptation tasks, from GTA5 to Cityscapes and from Synthia to Cityscapes.
  arXiv  Detail & Related papers  (2020-04-02T03:25:05Z)

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.