Journal
PATTERN RECOGNITION LETTERS
Volume 65, Issue -, Pages 60-66Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.patrec.2015.07.009
Keywords
Unsupervised domain adaptation; Subspace modeling; Max-margin classifiers
Categories
Funding
- FP7 EC project AXES
- FP7 ERC Starting Grant [240530 COGNIMUND]
Ask authors/readers for more resources
Domain adaptation aims at adapting the knowledge acquired on a source domain to a new different but related target domain. Several approaches have been proposed for classification tasks in the unsupervised scenario, where no labeled target data are available. Most of the attention has been dedicated to searching a new domain-invariant representation, leaving the definition of the prediction function to a second stage. Here we propose to learn both jointly. Specifically we learn the source subspace that best matches the target subspace while at the same time minimizing a regularized misclassification loss. We provide an alternating optimization technique based on stochastic sub-gradient descent to solve the learning problem and we demonstrate its performance on several domain adaptation tasks. (C) 2015 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available