A Versatile Framework for Unsupervised Domain Adaptation Based on Instance Weighting

被引:0
作者
Zhu, Jinjing [1 ]
Ye, Feiyang [1 ,2 ]
Xiao, Qiao [3 ]
Guo, Pengxin [1 ]
Zhang, Yu [1 ]
Yang, Qiang [4 ]
机构
[1] Southern Univ Sci & Technol, Dept Comp Sci & Engn, Shenzhen 518055, Peoples R China
[2] Univ Technol Sydney, Sch Comp Sci, Ultimo, NSW 2007, Australia
[3] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5612 AZ Eindhoven, Netherlands
[4] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Hong Kong, Peoples R China
关键词
Computer science; Costs; Feature extraction; Adversarial machine learning; Entropy; Couplings; Adaptation models; Accuracy; Weight measurement; Transportation; Unsupervised domain adaptation; optimal transport; universal domain adaptation; OPTIMAL TRANSPORT;
D O I
10.1109/TIP.2024.3486617
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Despite the progress made in domain adaptation, solving Unsupervised Domain Adaptation (UDA) problems with a general method under complex conditions caused by label shifts between domains remains a challenging task. In this work, we comprehensively investigate four distinct UDA settings including closed set domain adaptation, partial domain adaptation, open set domain adaptation, and universal domain adaptation, where shared common classes between source and target domains coexist alongside domain-specific private classes. The prominent challenges inherent in diverse UDA settings center around the discrimination of common/private classes and the precise measurement of domain discrepancy. To surmount these challenges effectively, we propose a novel yet effective method called Learning Instance Weighting for Unsupervised Domain Adaptation (LIWUDA), which caters to various UDA settings. Specifically, the proposed LIWUDA method constructs a weight network to assign weights to each instance based on its probability of belonging to common classes, and designs Weighted Optimal Transport (WOT) for domain alignment by leveraging instance weights. Additionally, the proposed LIWUDA method devises a Separate and Align (SA) loss to separate instances with low similarities and align instances with high similarities. To guide the learning of the weight network, Intra-domain Optimal Transport (IOT) is proposed to enforce the weights of instances in common classes to follow a uniform distribution. Through the integration of those three components, the proposed LIWUDA method demonstrates its capability to address all four UDA settings in a unified manner. Experimental evaluations conducted on four benchmark datasets substantiate the effectiveness of the proposed LIWUDA method.
引用
收藏
页码:6633 / 6646
页数:14
相关论文
共 62 条
  • [1] Bo Fu, 2020, Computer Vision - ECCV 2020. 16th European Conference. Proceedings. Lecture Notes in Computer Science (LNCS 12360), P567, DOI 10.1007/978-3-030-58555-6_34
  • [2] Bucci Silvia, 2020, Computer Vision - ECCV 2020 16th European Conference. Proceedings. Lecture Notes in Computer Science (LNCS 12361), P422, DOI 10.1007/978-3-030-58517-4_25
  • [3] Open Set Domain Adaptation for Image and Action Recognition
    Busto, Pau Panareda
    Iqbal, Ahsan
    Gall, Juergen
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2020, 42 (02) : 413 - 429
  • [4] Free boundaries in optimal transport and Monge-Ampere obstacle problems
    Caffarelli, Luis A.
    McCann, Robert J.
    [J]. ANNALS OF MATHEMATICS, 2010, 171 (02) : 673 - 730
  • [5] Partial Adversarial Domain Adaptation
    Cao, Zhangjie
    Ma, Lijia
    Long, Mingsheng
    Wang, Jianmin
    [J]. COMPUTER VISION - ECCV 2018, PT VIII, 2018, 11212 : 139 - 155
  • [6] Learning to Transfer Examples for Partial Domain Adaptation
    Cao, Zhangjie
    You, Kaichao
    Long, Mingsheng
    Wang, Jianmin
    Yang, Qiang
    [J]. 2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, : 2980 - 2989
  • [7] Partial Transfer Learning with Selective Adversarial Networks
    Cao, Zhangjie
    Long, Mingsheng
    Wang, Jianmin
    Jordan, Michael I.
    [J]. 2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, : 2724 - 2732
  • [8] Chang WX, 2022, ADV NEUR IN
  • [9] Chapel L, 2020, Arxiv, DOI arXiv:2002.08276
  • [10] Chen ZH, 2020, PROC CVPR IEEE, P12703, DOI 10.1109/CVPR42600.2020.01272