mlsanityData to 7 Oct 2026

A Theory of Multiple-Source Adaptation with Limited Target Labeled Data

arXiv 2007.09762 ↗First posted 19 Jul 2020cs.LG stat.MLcited by 18

Not on the map. Why?

Abstract (arXiv)

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 has at disposal a large amount of labeled data from multiple source domains. We show that a new family of algorithms based on model selection ideas benefits from very favorable guarantees in this scenario and discuss some theoretical obstacles affecting some alternative techniques. We also report the results of several experiments with our algorithms that demonstrate their practical effectiveness.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Jul 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 5; 2023: 5; 2024: 3; 2025: 0; 2026: 1.

18 papers.

Sort:

By area: