Unsupervised Subdomain Adaptation Robust to Noisy Pseudo Labels Using Symmetric Loss

被引:0
作者
Guo, Longxia [1 ]
Yan, Yunlong [1 ]
Li, Yundong [1 ]
机构
[1] North China Univ Technol, Sch Informat Sci & Technol, Beijing, Peoples R China
来源
ADVANCED INTELLIGENT COMPUTING TECHNOLOGY AND APPLICATIONS, PT VIII, ICIC 2024 | 2024年 / 14869卷
基金
中国国家自然科学基金;
关键词
Unsupervised Subdomain Adaptation; Symmetric Domain Loss; Pseudo Label; Symmetric Noise;
D O I
10.1007/978-981-97-5603-2_23
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Alignment of subdomain distribution plays an important role in preventing negative transfer in domain adaptation. Due to the lack of labeled data in the target domain, the current mainstream methods prefer using pseudo labels to align the features of corresponding categories between the source and the target domains. However, the noises present in pseudo labels affect the effectiveness of subdomain alignment. In the community of domain adaptation, samples with higher confidences are believed to be more reliable when generating pseudo labels. However, we found that this conclusion does not hold for hard samples. To address this issue, we propose a pseudo label screening mechanism which considers the trade-off of quantity and quality. The qualified target samples participate in the subdomain adaptation, while the unqualified samples are randomly assigned with labels. Thus, the asymmetric noises of hard samples are converted into symmetric noises. Symmetric loss is proved to be robust to symmetric noises. Inspired by this observation, we propose a symmetric subdomain adaptation loss (SSAL) and construct a robust subdomain adaptation network (RSAN) based on SSAL accordingly. Leveraging the random label assignments of hard samples and SSAL, we reconstruct the relation between sample's confidence and the probability being correctly classified. The effectiveness of our method has been validated on public benchmarks. Compared with the SOTA method, our RSAN obtains an improvement of 2.7% in terms of average accuracy on the challenging VisDA-2017 transfer task.
引用
收藏
页码:279 / 292
页数:14
相关论文
共 22 条
  • [1] Reusing the Task-specific Classifier as a Discriminator: Discriminator-free Adversarial Domain Adaptation
    Chen, Lin
    Chen, Huaian
    Wei, Zhixiang
    Jin, Xin
    Tan, Xiao
    Jin, Yi
    Chen, Enhong
    [J]. 2022 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2022, : 7171 - 7180
  • [2] Ganin Y, 2016, J MACH LEARN RES, V17
  • [3] Unsupervised Domain Adaptation via Deep Conditional Adaptation Network
    Ge, Pengfei
    Ren, Chuan-Xian
    Xu, Xiao-Lin
    Yan, Hong
    [J]. PATTERN RECOGNITION, 2023, 134
  • [4] Deep Reconstruction-Classification Networks for Unsupervised Domain Adaptation
    Ghifary, Muhammad
    Kleijn, W. Bastiaan
    Zhang, Mengjie
    Balduzzi, David
    Li, Wen
    [J]. COMPUTER VISION - ECCV 2016, PT IV, 2016, 9908 : 597 - 613
  • [5] Ghosh A, 2017, AAAI CONF ARTIF INTE, P1919
  • [6] Discriminative Radial Domain Adaptation
    Huang, Zenan
    Wen, Jun
    Chen, Siheng
    Zhu, Linchao
    Zheng, Nenggan
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2023, 32 : 1419 - 1431
  • [7] Enhancing transferability and discriminability simultaneously for unsupervised domain adaptation
    Li, Jingyao
    Lue, Shuai
    Zhu, Wenbo
    Li, Zhanshan
    [J]. KNOWLEDGE-BASED SYSTEMS, 2022, 247
  • [8] Liu M.-Y., 2016, ADV NEURAL INFORM PR, P469
  • [9] Long MS, 2015, PR MACH LEARN RES, V37, P97
  • [10] Slimmable Domain Adaptation
    Meng, Rang
    Chen, Weijie
    Yang, Shicai
    Song, Jie
    Lin, Luojun
    Xie, Di
    Pu, Shiliang
    Wang, Xinchao
    Song, Mingli
    Zhuang, Yueting
    [J]. 2022 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2022), 2022, : 7131 - 7140