Attracting and Dispersing: A Simple Approach for Source-free Domain Adaptation
Shiqi Yang, Yaxing Wang, Kai Wang, Shangling Jui, Joost van de Weijer

TL;DR
This paper introduces a simple, effective source-free domain adaptation method based on prediction consistency in feature space, leading to improved clustering and adaptability without source data.
Contribution
It proposes a novel prediction consistency objective for SFDA, relating existing methods through discriminability and diversity, and demonstrates strong empirical results.
Findings
Outperforms existing SFDA methods in experiments
Can be adapted to open-set and partial-set domain adaptation
Serves as a strong baseline for future SFDA research
Abstract
We propose a simple but effective source-free domain adaptation (SFDA) method. Treating SFDA as an unsupervised clustering problem and following the intuition that local neighbors in feature space should have more similar predictions than other features, we propose to optimize an objective of prediction consistency. This objective encourages local neighborhood features in feature space to have similar predictions while features farther away in feature space have dissimilar predictions, leading to efficient feature clustering and cluster assignment simultaneously. For efficient training, we seek to optimize an upper-bound of the objective resulting in two simple terms. Furthermore, we relate popular existing methods in domain adaptation, source-free domain adaptation and contrastive learning via the perspective of discriminability and diversity. The experimental results prove 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 · Cancer-related molecular mechanisms research · Multimodal Machine Learning Applications
MethodsContrastive Learning
