Reliable Domain Adaptation with Classifiers Competition

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Unsupervised domain adaptation (UDA) aims to transfer labeled source domain knowledge to the unlabeled target domain. Previous methods usually solve it by minimizing joint distribution divergence and obtaining the pseudo target labels via source classifier. However, those methods ignore that the source classifier always misclassifies partial target data and the prediction bias seriously deteriorates adaptation performance. It remains an open issue but ubiquitous in UDA, and to alleviate this issue, a Reliable Domain Adaptation (RDA) method is proposed in this paper. Specifically, we propose double task-classifiers and dual domain-specific projections to align those easily misclassified and unreliable target samples into reliable ones in an adversarial manner. In addition, the domain shift of both manifold and category space is reduced in the projection learning step. Extensive experiments on various databases demonstrate the superiority of RDA over state-of-the-art unsupervised domain adaptation methods.

Cite

CITATION STYLE

APA

Fu, J., & Zhang, L. (2019). Reliable Domain Adaptation with Classifiers Competition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11936 LNCS, pp. 101–113). Springer. https://doi.org/10.1007/978-3-030-36204-1_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free