Unsupervised Multi-source Domain Adaptation for Regression
We consider the problem of unsupervised domain adaptation from multiple sources in a regression setting. We propose in this work an original method to take benefit of different sources using a weighted combination of the sources. For this purpose, we define a new measure of similarity between probab...
Saved in:
Published in | Machine Learning and Knowledge Discovery in Databases Vol. 12457; pp. 395 - 411 |
---|---|
Main Authors | , , , , |
Format | Book Chapter |
Language | English |
Published |
Switzerland
Springer International Publishing AG
2021
Springer International Publishing |
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We consider the problem of unsupervised domain adaptation from multiple sources in a regression setting. We propose in this work an original method to take benefit of different sources using a weighted combination of the sources. For this purpose, we define a new measure of similarity between probabilities for domain adaptation which we call hypothesis-discrepancy. We then prove a new bound for unsupervised domain adaptation combining multiple sources. We derive from this bound a novel adversarial domain adaptation algorithm adjusting weights given to each source, ensuring that sources related to the target receive higher weights. We finally evaluate our method on different public datasets and compare it to other domain adaptation baselines to demonstrate the improvement for regression tasks. |
---|---|
Bibliography: | Electronic supplementary materialThe online version of this chapter (https://doi.org/10.1007/978-3-030-67658-2_23) contains supplementary material, which is available to authorized users. |
ISBN: | 9783030676575 3030676579 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-030-67658-2_23 |