Positive-Unlabeled Domain Adaptation
Jonas Sonntag, Gunnar Behrens, Lars Schmidt-Thieme

TL;DR
This paper introduces the novel problem of Positive-Unlabeled Domain Adaptation, proposing a two-step method to leverage source labels and PU risk estimation for effective target domain classification, validated on visual recognition and parking data.
Contribution
It is the first to address Positive-Unlabeled Domain Adaptation, combining PU learning with domain adaptation techniques through a new two-step approach.
Findings
Effective identification of reliable pseudo-labels in the target domain.
Superior performance on benchmark visual recognition datasets.
Validated approach on real-world parking occupancy data.
Abstract
Domain Adaptation methodologies have shown to effectively generalize from a labeled source domain to a label scarce target domain. Previous research has either focused on unlabeled domain adaptation without any target supervision or semi-supervised domain adaptation with few labeled target examples per class. On the other hand Positive-Unlabeled (PU-) Learning has attracted increasing interest in the weakly supervised learning literature since in quite some real world applications positive labels are much easier to obtain than negative ones. In this work we are the first to introduce the challenge of Positive-Unlabeled Domain Adaptation where we aim to generalise from a fully labeled source domain to a target domain where only positive and unlabeled data is available. We present a novel two-step learning approach to this problem by firstly identifying reliable positive and negative…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Machine Learning and Data Classification
