arXiv:2608.24429cs.LGcs.CV2026-08

提出新方法解决标签不一致的跨域适应问题。

Joint Distribution Alignment for Universal Domain Adaptation

论文配图:Joint Distribution Alignment for Universal Domain Adaptation
图 1 · 摘自论文原文
  • 通过最小化卡方散度对齐联合分布
  • 在六个数据集上显著优于现有方法
  • 适用于标签空间不同的真实场景

无监督域适应(UDA)在机器学习、模式识别和计算机视觉中备受关注。传统UDA假设源域与目标域标签空间完全相同,仅需解决样本分布偏移问题。但在实际应用中,两域标签空间可能不同,此时存在分布偏移与类别空间差异双重挑战,即通用域适应(UniDA)场景。现有工作极少提供UniDA的理论分析。本文推导了UniDA的泛化误差上界,并据此提出一种新算法JAUA,通过最小化卡方散度实现联合分布对齐。此外,提出渐进式伪标签法为无标签目标样本分配伪标签。在六个公开图像数据集上的实验表明,JAUA在处理UniDA问题上具有显著优势。

原文摘要 · Abstract (English)

Unsupervised domain adaptation (UDA) has been widely concerned in the fields of machine learning, pattern recognition, and computer vision. Traditional UDA learning usually assumes that the label spaces of the source and target domains are exactly the same and only needs to solve the problem of sample distribution drift existing between two domains. However, in real world applications, the label spaces between two domains may be different. In this case, there are both sample distribution drift and class spatial difference between domains, namely Universal Domain Adaptation (UniDA) learning scenario. At present, existing works rarely offer theoretical analysis for universal domain adaptation. In this paper, we provide an upper bound of the generalization error for universal domain adaptation. According to the proposed generalization error bound, we propose a novel UniDA algorithm called Joint Distribution Alignment for Universal Domain Adaptation (JAUA), which aligns the joint distributions by minimizing the distribution discrepancy calculated by Chi-Square divergence. Furthermore, we propose a progressive pseudo-labeling method to assign the pseudo labels to unlabeled target samples. The experiment results on six public image datasets demonstrate the superiority of JAUA in handling the UniDA problem.

域适应图像分类无监督学习

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。