Enhanced Transport Distance for Unsupervised Domain Adaptation

• Published in: 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) pp. 13933 - 13941
• Main Authors: Li, Mengxue, Zhai, Yi-Ming, Luo, You-Wei, Ge, Peng-Fei, Ren, Chuan-Xian
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2020
• Subjects: Adaptation models; Feature extraction; Image reconstruction; Measurement; Neural networks; Task analysis; Training
• ISSN: 2575-7075
• DOI: 10.1109/CVPR42600.2020.01395

Unsupervised domain adaptation (UDA) is a representative problem in transfer learning, which aims to improve the classification performance on an unlabeled target domain by exploiting discriminant information from a labeled source domain. The optimal transport model has been used for UDA in the perspective of distribution matching. However, the transport distance cannot reflect the discriminant information from either domain knowledge or category prior. In this work, we propose an enhanced transport distance (ETD) for UDA. This method builds an attention-aware transport distance, which can be viewed as the prediction feedback of the iteratively learned classifier, to measure the domain discrepancy. Further, the Kantorovich potential variable is re-parameterized by deep neural networks to learn the distribution in the latent space. The entropy-based regularization is developed to explore the intrinsic structure of the target domain. The proposed method is optimized alternately in an end-to-end manner. Extensive experiments are conducted on four benchmark datasets to demonstrate the SOTA performance of ETD.