mlsanityData to 7 Oct 2026

A Sample Selection Approach for Universal Domain Adaptation

arXiv 2001.05071 ↗First posted 14 Jan 2020cs.CVcited by 5

Not on the map. Why?

Abstract (arXiv)

We study the problem of unsupervised domain adaption in the universal scenario, in which only some of the classes are shared between the source and target domains. We present a scoring scheme that is effective in identifying the samples of the shared classes. The score is used to select which samples in the target domain to pseudo-label during training. Another loss term encourages diversity of labels within each batch. Taken together, our method is shown to outperform, by a sizable margin, the current state of the art on the literature benchmarks.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 Jan 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 4.

5 papers.