Cluster-based Adversarial Decision Boundary for domain-adaptive open set recognition

被引:0
作者
Zhong, Jian [1 ]
Jiao, Qianfen [1 ]
Wu, Si [1 ,2 ]
Liu, Cheng [3 ]
Wong, Hau-San [1 ]
机构
[1] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
[2] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510006, Peoples R China
[3] Shantou Univ, Dept Comp Sci, Shantou 515041, Peoples R China
基金
中国国家自然科学基金;
关键词
Open set; Domain adaptation; Adversarial training; Unsupervised learning;
D O I
10.1016/j.knosys.2024.111478
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Domain adaptation has achieved significant progress recently by adapting models trained on a source domain to an unlabeled target domain. Open Set Domain adaptation (OSDA) has drawn much attention nowadays, where the target domain contains some exclusive categories other than the source domain's known classes. With no label in the target data, existing OSDA methods often suffer from negative transfer. Conventional methods for unknown class rejection require an empirical setting of the confidence threshold, which lacks flexibility since the model confidence may vary during the training process, and our motivation is to omit the effort of setting the rejection threshold manually. Based on the idea that latent features of the same class should be in the same cluster to address this issue, we propose a domain adaptive open set recognition framework: Clusterbased Adversarial Decision Boundary (CADB). Specifically, we design an end-to-end unknown class rejection model consisting of three components: known class prototype estimation under the cluster assumption; known class similarity score estimation; and adaptive unknown class rejection threshold generation with adversarial feature suppression. These three components work as one entity to give a similarity score for each sample. Those samples that are less similar to the cluster prototype compared with the counterfactual features are rejected as the unknown class. Extensive evaluations are conducted to verify the effectiveness and robustness of the proposed boundary generation procedure.
引用
收藏
页数:9
相关论文
共 40 条
  • [1] [Anonymous], 2004, Knapsack Problems
  • [2] Towards Open Set Deep Networks
    Bendale, Abhijit
    Boult, Terrance E.
    [J]. 2016 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2016, : 1563 - 1572
  • [3] Open Set Domain Adaptation
    Busto, Pau Panareda
    Gall, Juergen
    [J]. 2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2017, : 754 - 763
  • [4] Chapelle O, 2005, P 10 INT WORKSH ART, P57
  • [5] Geometric Anchor Correspondence Mining with Uncertainty Modeling for Universal Domain Adaptation
    Chen, Liang
    Lou, Yihang
    He, Jianzhong
    Bai, Tao
    Deng, Minghua
    [J]. 2022 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2022), 2022, : 16113 - 16122
  • [6] Open-Set Hypothesis Transfer With Semantic Consistency
    Feng, Zeyu
    Xu, Chang
    Tao, Dacheng
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2021, 30 : 6473 - 6484
  • [7] French G., 2018, PROC INT C LEARN REP
  • [8] Ganin Y, 2016, J MACH LEARN RES, V17
  • [9] Ganin Y, 2015, PR MACH LEARN RES, V37, P1180
  • [10] Deep Residual Learning for Image Recognition
    He, Kaiming
    Zhang, Xiangyu
    Ren, Shaoqing
    Sun, Jian
    [J]. 2016 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2016, : 770 - 778