Universal Domain Adaptation through Self Supervision
Kuniaki Saito, Donghyun Kim, Stan Sclaroff, Kate Saenko

TL;DR
This paper introduces DANCE, a universal domain adaptation framework that employs self-supervised neighborhood clustering and entropy-based feature alignment to handle arbitrary category shifts across domains.
Contribution
DANCE is a novel framework that combines neighborhood clustering and entropy optimization to adapt to various domain shifts without prior setting knowledge.
Findings
DANCE outperforms existing methods in open-set, open-partial, and partial domain adaptation.
The neighborhood clustering technique effectively learns target domain structure.
Entropy-based alignment improves feature transferability.
Abstract
Unsupervised domain adaptation methods traditionally assume that all source categories are present in the target domain. In practice, little may be known about the category overlap between the two domains. While some methods address target settings with either partial or open-set categories, they assume that the particular setting is known a priori. We propose a more universally applicable domain adaptation framework that can handle arbitrary category shift, called Domain Adaptative Neighborhood Clustering via Entropy optimization (DANCE). DANCE combines two novel ideas: First, as we cannot fully rely on source categories to learn features discriminative for the target, we propose a novel neighborhood clustering technique to learn the structure of the target domain in a self-supervised way. Second, we use entropy-based feature alignment and rejection to align target features with the…
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.
Code & Models
Videos
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Multimodal Machine Learning Applications · Cancer-related molecular mechanisms research
MethodsDomain Adaptative Neighborhood Clustering via Entropy Optimization
