arXiv:2601.21315cs.LGcs.AI2026-01中稿 · ICLR被引 1

提出鲁棒框架,提升少样本目标域的无监督域适应性能。

Distributionally Robust Classification for Multi-source Unsupervised Domain Adaptation

  • 同时考虑输入分布和标签条件分布的不确定性建模
  • 在目标数据极少时仍显著优于主流基线方法
  • 可无缝集成到现有UDA方法中,适用多源与单源场景

无监督域适应(UDA)指训练数据(源域)分布与测试数据(目标域)分布不一致的情况。此时仅能访问源域的标注数据和目标域的未标注数据,目标是利用两者构建在目标域上泛化良好的模型。尽管潜力巨大,现有UDA方法在目标域数据稀缺或源域存在虚假相关性时表现不佳。为此,我们提出一种新型分布鲁棒学习框架,同时建模协变量分布和条件标签分布的不确定性。该方法虽以多源域适应为背景,但也可直接应用于单源场景,具有强实用性。我们设计了高效的算法,可无缝集成至现有UDA方法。在多种分布偏移设置下的大量实验表明,本方法在目标数据极度稀缺时仍持续优于强基线。

原文摘要 · Abstract (English)

Unsupervised domain adaptation (UDA) is a statistical learning problem when the distribution of training (source) data is different from that of test (target) data. In this setting, one has access to labeled data only from the source domain and unlabeled data from the target domain. The central objective is to leverage the source data and the unlabeled target data to build models that generalize to the target domain. Despite its potential, existing UDA approaches often struggle in practice, particularly in scenarios where the target domain offers only limited unlabeled data or spurious correlations dominate the source domain. To address these challenges, we propose a novel distributionally robust learning framework that models uncertainty in both the covariate distribution and the conditional label distribution. Our approach is motivated by the multi-source domain adaptation setting but is also directly applicable to the single-source scenario, making it versatile in practice. We develop an efficient learning algorithm that can be seamlessly integrated with existing UDA methods. Extensive experiments under various distribution shift scenarios show that our method consistently outperforms strong baselines, especially when target data are extremely scarce.

域适应鲁棒学习无监督

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