利用文本鲁棒性提升视觉模型在复杂域迁移中的适应能力
TRUST: Leveraging Text Robustness for Unsupervised Domain Adaptation
- 用文本描述生成目标域伪标签,结合CLIP相似度估计不确定性
- 通过不确定性重加权损失,降低低质量描述带来的错误影响
- 设计多模态软对比学习,无需人工定义正负样本对
当前无监督域自适应(UDA)方法在处理经典域偏移(如合成到真实)上表现良好,但在复杂偏移(如地理差异)下仍面临挑战,此时背景与物体外观差异显著。已有研究发现语言模态对这类复杂偏移更具鲁棒性。本文提出TRUST,一种利用语言模态鲁棒性指导视觉模型适应的新方法。TRUST从图像的文本描述中生成目标样本的伪标签,并引入基于归一化CLIP相似度的不确定性估计策略,用于重加权分类损失,以缓解低质量描述导致的错误伪标签影响。为进一步提升视觉模型鲁棒性,提出一种多模态软对比学习损失,通过文本引导目标图像的对比训练:每对图像同时作为正负样本,其特征表示被吸引或排斥的程度由对应文本相似度决定。该方法避免了在无监督设置下难确定正负样本对的问题。实验表明,TRUST在经典域偏移(DomainNet)和复杂域偏移(GeoNet)上均达到新最优性能。
原文摘要 · Abstract (English)
Recent unsupervised domain adaptation (UDA) methods have shown great success in addressing classical domain shifts (e.g., synthetic-to-real), but they still suffer under complex shifts (e.g. geographical shift), where both the background and object appearances differ significantly across domains. Prior works showed that the language modality can help in the adaptation process, exhibiting more robustness to such complex shifts. In this paper, we introduce TRUST, a novel UDA approach that exploits the robustness of the language modality to guide the adaptation of a vision model. TRUST generates pseudo-labels for target samples from their captions and introduces a novel uncertainty estimation strategy that uses normalised CLIP similarity scores to estimate the uncertainty of the generated pseudo-labels. Such estimated uncertainty is then used to reweight the classification loss, mitigating the adverse effects of wrong pseudo-labels obtained from low-quality captions. To further increase the robustness of the vision model, we propose a multimodal soft-contrastive learning loss that aligns the vision and language feature spaces, by leveraging captions to guide the contrastive training of the vision model on target images. In our contrastive loss, each pair of images acts as both a positive and a negative pair and their feature representations are attracted and repulsed with a strength proportional to the similarity of their captions. This solution avoids the need for hardly determining positive and negative pairs, which is critical in the UDA setting. Our approach outperforms previous methods, setting the new state-of-the-art on classical (DomainNet) and complex (GeoNet) domain shifts. The code will be available upon acceptance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。