Certain and consistent domain adaptation

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

Abstract

Unsupervised domain adaptation algorithms seek to transfer knowledge from labeled source datasets in order to predict the labels for target datasets in the presence of domain-shift. In this paper we propose the Certain and Consistent Domain Adaptation (CCDA) model for unsupervised domain adaptation. The CCDA aligns the source and target domains using adversarial training and reduces the domain adaptation problem to a semi supervised learning (SSL) problem. We estimate the target labels using consistency regularization and entropy minimization on the domain-aligned target samples whose predictions are consistent across multiple stochastic perturbations. We evaluate the CCDA on benchmark datasets and demonstrate that it outperforms competitive baselines from domain adaptation literature.

Cite

CITATION STYLE

APA

Nagabandi, B., Dudley, A., Venkateswara, H., & Panchanathan, S. (2020). Certain and consistent domain adaptation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12015 LNCS, pp. 341–356). Springer. https://doi.org/10.1007/978-3-030-54407-2_29

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