Unsupervised Domain Adaptation with a Relaxed Covariate Shift Assumption

Adel, T. , Zhao, H. and Wong, A. (2017) Unsupervised Domain Adaptation with a Relaxed Covariate Shift Assumption. In: Thirty-First AAAI Conference on Artificial Intelligence, San Francisco, CA, USA, 4-10 Feb 2017, pp. 1691-1697.

Full text not currently available from Enlighten.

Publisher's URL: https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14769

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.

Item Type:Conference Proceedings
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Hesham, Dr Tameem Adel
Authors: Adel, T., Zhao, H., and Wong, A.
College/School:College of Science and Engineering > School of Computing Science
ISSN:2159-5399

University Staff: Request a correction | Enlighten Editors: Update this record