.png){kind=icon}
.png){kind=icon}
Return
Generalization Error Bounds for Multiple-Source Domain Adaptation
.png){kind=icon}
PRE
AI
N
D
J
W
DOI：10.1007/s10994-026-07120-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multiple-source domain adaptation (MDA), aims at transferring knowledge from several source domains to a little or no labeled target domain, has been widely and successfully applied in many fields of machine learning and image processing. Although many MDA algorithms have been proposed in recent years, there have been few theoretical research results. In this paper, we dedicate to studying theory and algorithm for MDA. We provide a theoretical analysis framework for multiple-source domain adaptation based on covering numbers in statistical learning theory. Under this framework, we comprehensively analyze the generalization error bounds of multiple-source domain adaptation in various situations, e.g. unsupervised MDA and semi-supervised MDA. Due to the large number of parameters involved, we also provide an efficient method for selecting parameters based on the derived generalization error bounds. Experimental results confirmed the effectiveness of the proposed method. Furthermore, we propose an adversarial multiple feature spaces adaptation network(AMFSAN) for MDA according to the theoretical results. Numerical simulations indicate that the proposed algorithm is superior to other existing algorithms.
Keywords:
Multiple-source domain adaptation
Covering number
Error analysis
Disparity discrepancy
Journal
IF:
2.9
Papers:
2.6K
Citations:
3.4W
Organization
Cited Papers