Algorithms and Theory for Multiple-Source Adaptation
This work includes a number of novel contributions for the multiple-source adaptation problem. We present new normalized solutions with strong theoretical guarantees for the cross-entropy loss and other similar losses. We also provide new guarantees that hold in the case where the conditional probabilities for the source domains are distinct. Moreover, we give new algorithms for determining the distribution-weighted combination solution for the cross-entropy loss and other losses. We report the results of a series of experiments with real-world datasets. We find that our algorithm outperforms competing approaches by producing a single robust model that performs well on any target mixture distribution. Altogether, our theory, algorithms, and empirical results provide a full solution for the multiple-source adaptation problem with very practical benefits.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Theory of Multiple-Source Adaptation with Limited Target Labeled Data
We present a theoretical and algorithmic study of the multiple-source domain adaptation problem in the common scenario where the learner has access only to a limited amount of labeled target data, but where the learner h…
Domain AdaptationModel SelectionMultiple Source Domain Adaptation with Adversarial Learning
While domain adaptation has been actively researched in recent years, most theoretical results and algorithms focus on the single-source-single-target adaptation setting. Naive application of such algorithms on multiple …
Domain AdaptationSentiment AnalysisMultiple Source Domain Adaptation with Adversarial Training of Neural Networks
While domain adaptation has been actively researched in recent years, most theoretical results and algorithms focus on the single-source-single-target adaptation setting. Naive application of such algorithms on multiple …
Domain AdaptationSentiment AnalysisTheoretical Analysis of Domain Adaptation with Optimal Transport
Domain adaptation (DA) is an important and emerging field of machine learning that tackles the problem occurring when the distributions of training (source domain) and test (target domain) data are similar but different.…
Domain AdaptationAdversarial Multiple Source Domain Adaptation
While domain adaptation has been actively researched, most algorithms focus on the single-source-single-target adaptation setting. In this paper we propose new generalization bounds and algorithms under both classificati…
ClassificationDomain AdaptationGeneral ClassificationGeneralization Bounds+3