计算机科学
稳健性(进化)
域适应
边距(机器学习)
噪音(视频)
人工智能
适应(眼睛)
模式识别(心理学)
集合(抽象数据类型)
领域(数学分析)
数据挖掘
可靠性(半导体)
机器学习
图像(数学)
功率(物理)
数学
光学
物理
数学分析
基因
分类器(UML)
量子力学
生物化学
化学
程序设计语言
作者
Mattia Litrico,Alessio Del Bue,Pietro Morerio
出处
期刊:Proceedings
[Institute of Electrical and Electronics Engineers]
日期:2023-06-01
卷期号:: 7640-7650
被引量:160
标识
DOI:10.1109/cvpr52729.2023.00738
摘要
Standard Unsupervised Domain Adaptation (UDA) methods assume the availability of both source and target data during the adaptation. In this work, we investigate Source-free Unsupervised Domain Adaptation (SF-UDA), a specific case of UDA where a model is adapted to a target domain without access to source data. We propose a novel approach for the SF-UDA setting based on a loss reweighting strategy that brings robustness against the noise that inevitably affects the pseudo-labels. The classification loss is reweighted based on the reliability of the pseudo-labels that is measured by estimating their uncertainty. Guided by such reweighting strategy, the pseudo-labels are progressively refined by aggregating knowledge from neighbouring samples. Furthermore, a self-supervised contrastive framework is leveraged as a target space regulariser to enhance such knowledge aggregation. A novel negative pairs exclusion strategy is proposed to identify and exclude negative pairs made of samples sharing the same class, even in presence of some noise in the pseudo-labels. Our method outperforms previous methods on three major benchmarks by a large margin. We set the new SF-UDA state-of-the-art on VisDA-C and DomainNet with a performance gain of + 1.8% on both benchmarks and on PACS with + 12.3% in the single-source setting and +6.6% in multi-target adaptation. Additional analyses demonstrate that the proposed approach is robust to the noise, which results in significantly more accurate pseudo-labels compared to state-of-the-art approaches.
科研通智能强力驱动
Strongly Powered by AbleSci AI