Attract, Perturb, and Explore: Learning a Feature Alignment Network for Semi-supervised Domain Adaptation

被引:76
作者
Kim, Taekyung [1 ]
Kim, Changick [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Daejeon, South Korea
来源
COMPUTER VISION - ECCV 2020, PT XIV | 2020年 / 12359卷
关键词
Domain adaptation; Semi-supervised learning;
D O I
10.1007/978-3-030-58568-6_35
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Although unsupervised domain adaptation methods have been widely adopted across several computer vision tasks, it is more desirable if we can exploit a few labeled data from new domains encountered in a real application. The novel setting of the semi-supervised domain adaptation (SSDA) problem shares the challenges with the domain adaptation problem and the semi-supervised learning problem. However, a recent study shows that conventional domain adaptation and semi-supervised learning methods often result in less effective or negative transfer in the SSDA problem. In order to interpret the observation and address the SSDA problem, in this paper, we raise the intra-domain discrepancy issue within the target domain, which has never been discussed so far. Then, we demonstrate that addressing the intradomain discrepancy leads to the ultimate goal of the SSDA problem. We propose an SSDA framework that aims to align features via alleviation of the intra-domain discrepancy. Our framework mainly consists of three schemes, i.e., attraction, perturbation, and exploration. First, the attraction scheme globally minimizes the intra-domain discrepancy within the target domain. Second, we demonstrate the incompatibility of the conventional adversarial perturbation methods with SSDA. Then, we present a domain adaptive adversarial perturbation scheme, which perturbs the given target samples in a way that reduces the intra-domain discrepancy. Finally, the exploration scheme locally aligns features in a class-wise manner complementary to the attraction scheme by selectively aligning unlabeled target features complementary to the perturbation scheme. We conduct extensive experiments on domain adaptation benchmark datasets such as DomainNet, Office-Home, and Office. Our method achieves state-of-the-art performances on all datasets.
引用
收藏
页码:591 / 607
页数:17
相关论文
共 35 条
[1]  
[Anonymous], 2017, Automatic differentiation in pytorch
[2]  
Ao SA, 2017, AAAI CONF ARTIF INTE, P1719
[3]  
Chen W. Y., 2019, INT C LEARN REPR
[4]  
Chen Y., 2018, P EUR C COMP VIS ECC
[5]   Domain Adaptive Faster R-CNN for Object Detection in the Wild [J].
Chen, Yuhua ;
Li, Wen ;
Sakaridis, Christos ;
Dai, Dengxin ;
Van Gool, Luc .
2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, :3339-3348
[6]   SaaS: Speed as a Supervisor for Semi-supervised Learning [J].
Cicek, Safa ;
Fawzi, Alhussein ;
Soatto, Stefano .
COMPUTER VISION - ECCV 2018, PT II, 2018, 11206 :152-166
[7]   Semi-Supervised Domain Adaptation with Instance Constraints [J].
Donahue, Jeff ;
Hoffman, Judy ;
Rodner, Erik ;
Saenko, Kate ;
Darrell, Trevor .
2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2013, :668-675
[8]  
Ganin Y, 2015, PR MACH LEARN RES, V37, P1180
[9]  
Grandvalet Y., 2005, Advances in Neural Information Processing Systems (NeurIPS)
[10]  
Gretton A, 2012, J MACH LEARN RES, V13, P723