Domain adaptation based on source category prototypes

被引:6
作者
Zhou, Lihua [1 ]
Ye, Mao [1 ]
Xiao, Siying [1 ]
机构
[1] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Chengdu 611731, Peoples R China
关键词
Domain adaptation; Prototype; Category maximum mean discrepancy; Prototype-label consistency;
D O I
10.1007/s00521-022-07601-x
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Unsupervised domain adaptation (UDA), which can transfer knowledge from labeled source domain to unlabeled target domain, needs to access a large number of labeled source data in the process of generalization. However, the data of two domains may not be accessed at the same time due to data privacy protection. To solve this problem, source-data free domain adaptation (SFDA) began to receive attention. However, too little source information will lead to some performance gaps. To balance the issues between UDA and SFDA, a new setting called Prototype-based domain adaptation (Prototype-DA) is proposed, which further improves the practicability of UDA by using source category prototype instead of source data. At the same time, it can also ensure the privacy of source data like SFDA. Specifically, our training process can be divided into two steps. First, the source data is used to pre-train a source model, and the source category prototypes are obtained after the training of source model. Then, to generalize the source model to the target domain, category maximum mean discrepancy (Category-MMD) is defined so that the target data can be aligned with the source category prototypes. In this way, source category prototypes will transfer knowledge to the target domain together with the source model. Through source category prototypes, Prototype-DA can not only achieve the comparable results than the method using source data, but also protect the privacy of source data to some extent. Furthermore, the target category prototypes are constructed and the consistency between the labels of target category prototypes and the classification results is required. This prototype-label consistency regularization, proposed by us for the first time, helps to extract discriminative features in the target domain. Compared with the previous UDA methods and SFDA methods, extensive experiments on multiple public domain adaptation datasets show that Prototype-DA achieves the state-of-the-art results. At the same time, the traditional UDA theory is expanded to our method setting and makes a theoretical analysis to ensure the effectiveness of our method.
引用
收藏
页码:21191 / 21203
页数:13
相关论文
共 55 条
[1]   A theory of learning from different domains [J].
Ben-David, Shai ;
Blitzer, John ;
Crammer, Koby ;
Kulesza, Alex ;
Pereira, Fernando ;
Vaughan, Jennifer Wortman .
MACHINE LEARNING, 2010, 79 (1-2) :151-175
[2]  
Bonawitz K, 2019, PROC C MACH LEARN SY
[3]   Practical Secure Aggregation for Privacy-Preserving Machine Learning [J].
Bonawitz, Keith ;
Ivanov, Vladimir ;
Kreuter, Ben ;
Marcedone, Antonio ;
McMahan, H. Brendan ;
Patel, Sarvar ;
Ramage, Daniel ;
Segal, Aaron ;
Seth, Karn .
CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, :1175-1191
[4]  
Chen CQ, 2020, PROC CVPR IEEE, P8866, DOI 10.1109/CVPR42600.2020.00889
[5]   Progressive Feature Alignment for Unsupervised Domain Adaptation [J].
Chen, Chaoqi ;
Xie, Weiping ;
Huang, Wenbing ;
Rong, Yu ;
Ding, Xinghao ;
Huang, Yue ;
Xu, Tingyang ;
Huang, Junzhou .
2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, :627-636
[6]  
Chen MH, 2020, AAAI CONF ARTIF INTE, V34, P3521
[7]  
Chen X., 2019, International Conference on Machine Learning
[8]   Domain Adaptation in the Absence of Source Domain Data [J].
Chidlovskii, Boris ;
Clinchant, Stephane ;
Csurka, Gabriela .
KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, :451-460
[9]  
Crammer K, 2008, J MACH LEARN RES, V9, P1757
[10]  
Deng J., 2020, ARXIV