Sciweavers

Share
ACML
2009
Springer

Learning Algorithms for Domain Adaptation

3 years 9 months ago
Learning Algorithms for Domain Adaptation
A fundamental assumption for any machine learning task is to have training and test data instances drawn from the same distribution while having a sufficiently large number of training instances. In many practical settings, this ideal assumption is invalidated as the labeled training instances are scarce and there is a high cost associated with labeling them. On the other hand, we might have access to plenty of labeled data from a different domain, which can provide useful information for the present domain. In this paper, we discuss adaptive learning techniques to address this specific problem: learning with little training data from the same distribution along with a large pool of data from a different distribution. An underlying theme of our work is to identify situations when the auxiliary data is likely to help in training with the primary data. We propose two algorithms for the domain adaptation task: dataset reweighting and subset selection. We present theoretical analysis of ...
Manas A. Pathak, Eric Nyberg
Added 23 Jul 2010
Updated 23 Jul 2010
Type Conference
Year 2009
Where ACML
Authors Manas A. Pathak, Eric Nyberg
Comments (0)
books