Unsupervised domain adaptation with a relaxed covariate shift assumption

27Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.

Abstract

Domain adaptation addresses learning tasks where training is performed on data from one domain whereas testing is performed on data belonging to a different but related domain. Assumptions about the relationship between the source and target domains should lead to tractable solutions on the one hand, and be realistic on the other hand. Here we propose a generative domain adaptation model that allows for modelling different assumptions about this relationship, among which is a newly introduced assumption that replaces covariate shift with a possibly more realistic assumption without losing tractability due to the efficient variational inference procedure developed. In addition to the ability to model less restrictive relationships between source and target, modelling can be performed without any target labeled data (unsupervised domain adaptation). We also provide a Rademacher complexity bound of the proposed algorithm. We evaluate the model on the Amazon reviews and the CVC pedestrian detection datasets.

Cite

CITATION STYLE

APA

Adel, T., Zhao, H., & Wong, A. (2017). Unsupervised domain adaptation with a relaxed covariate shift assumption. In 31st AAAI Conference on Artificial Intelligence, AAAI 2017 (pp. 1691–1697). AAAI press. https://doi.org/10.1609/aaai.v31i1.10898

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