Affiliations: [a] Department of Mathematics, College of Sciences, Shanghai University, Shanghai, China
| [b] Bank of Communications Co., Ltd. Zhejiang Provincial Branch, Hangzhou, China
| [c] School of Computer Science, East China Normal University, Shanghai, China
Correspondence:
[*]
Corresponding author. Yangchun Zhang, Department of Mathematics, College of Sciences, Shanghai University,Shanghai, China. E-mail: [email protected].
Abstract: Domain adaptation solves the challenge of inadequate labeled samples in the target domain by leveraging the knowledge learned from the labeled source domain. Most existing approaches aim to reduce the domain shift by performing some coarse alignments such as domain-wise alignment and class-wise alignment. To circumvent the limitation, we propose a coarse-to-fine unsupervised domain adaptation method based on metric learning, which can fully utilize more geometric structure and sample-wise information to obtain a finer alignment. The main advantages of our approach lie in four aspects: (1) it employs a structure-preserving algorithm to automatically select the optimal subspace dimension on the Grassmannian manifold; (2) based on coarse distribution alignment using maximum mean discrepancy, it utilizes the smooth triplet loss to leverage the supervision information of samples to improve the discrimination of data; (3) it introduces structure regularization to preserve the geometry of samples; (4) it designs a graph-based sample reweighting method to adjust the weight of each source domain sample in the cross-domain task. Extensive experiments on several public datasets demonstrate that our method achieves remarkable superiority over several competitive methods (more than 1.5% improvement of the average classification accuracy over the best baseline).
