Iterative Refinement for Multi-Source Visual Domain Adaptation

被引:29
作者
Wu, Hanrui [1 ]
Yan, Yuguang [2 ]
Lin, Guosheng [3 ]
Yang, Min [4 ]
Ng, Michael K. [2 ]
Wu, Qingyao [1 ]
机构
[1] South China Univ Technol, Sch Software Engn, Guangzhou 510641, Guangdong, Peoples R China
[2] Univ Hong Kong, Dept Math, Hong Kong, Peoples R China
[3] Nanyang Technol Univ, Sch Comp Sci & Engn, Singapore 639798, Singapore
[4] Chinese Acad Sci, Shenzhen Key Lab High Performance Data Min, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China
基金
新加坡国家研究基金会; 中国国家自然科学基金;
关键词
Iterative algorithms; Feature extraction; Training; Adaptation models; Support vector machines; Visualization; Data models; Domain adaptation; transfer learning; multiple sources; optimal transport; feature selection; KERNEL;
D O I
10.1109/TKDE.2020.3014697
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
One of the main challenges in multi-source domain adaptation is how to reduce the domain discrepancy between each source domain and a target domain, and then evaluate the domain relevance to determine how much knowledge should be transferred from different source domains to the target domain. However, most prior approaches barely consider both discrepancies and relevance among domains. In this paper, we propose an algorithm, called Iterative Refinement based on Feature Selection and the Wasserstein distance (IRFSW), to solve semi-supervised domain adaptation with multiple sources. Specifically, IRFSW aims to explore both the discrepancies and relevance among domains in an iterative learning procedure, which gradually refines the learning performance until the algorithm stops. In each iteration, for each source domain and the target domain, we develop a sparse model to select features in which the domain discrepancy and training loss are reduced simultaneously. Then a classifier is constructed with the selected features of the source and labeled target data. After that, we exploit optimal transport over the selected features to calculate the transferred weights. The weight values are taken as the ensemble weights to combine the learned classifiers to control the amount of knowledge transferred from source domains to the target domain. Experimental results validate the effectiveness of the proposed method.
引用
收藏
页码:2810 / 2823
页数:14
相关论文
共 55 条
[1]  
[Anonymous], 2010, P INT C MACH LEARN
[2]  
[Anonymous], 2017, P ADV NEUR INF PROC
[3]  
Aytar Y, 2011, IEEE I CONF COMP VIS, P2252, DOI 10.1109/ICCV.2011.6126504
[4]  
Benamou JD, 2000, NUMER MATH, V84, P375, DOI 10.1007/s002119900117
[5]  
Bishop C., 2006, Pattern Recognition and Machine Learning
[6]   Sliced and Radon Wasserstein Barycenters of Measures [J].
Bonneel, Nicolas ;
Rabin, Julien ;
Peyre, Gabriel ;
Pfister, Hanspeter .
JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2015, 51 (01) :22-45
[7]   Integrating structured biological data by Kernel Maximum Mean Discrepancy [J].
Borgwardt, Karsten M. ;
Gretton, Arthur ;
Rasch, Malte J. ;
Kriegel, Hans-Peter ;
Schoelkopf, Bernhard ;
Smola, Alex J. .
BIOINFORMATICS, 2006, 22 (14) :E49-E57
[8]   LIBSVM: A Library for Support Vector Machines [J].
Chang, Chih-Chung ;
Lin, Chih-Jen .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2011, 2 (03)
[9]   Multisource Domain Adaptation and Its Application to Early Detection of Fatigue [J].
Chattopadhyay, Rita ;
Sun, Qian ;
Fan, Wei ;
Davidson, Ian ;
Panchanathan, Sethuraman ;
Ye, Jieping .
ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2012, 6 (04)
[10]   Re-weighted Adversarial Adaptation Network for Unsupervised Domain Adaptation [J].
Chen, Qingchao ;
Liu, Yang ;
Wang, Zhaowen ;
Wassell, Ian ;
Chetty, Kevin .
2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, :7976-7985