Data-Efficient CLIP-Powered Dual-Branch Networks for Source-Free Unsupervised Domain Adaptation
Yongguang Li, Yueqi Cao, Jindong Li, Qi Wang, Shengsheng Wang

TL;DR
This paper introduces a data-efficient, CLIP-powered dual-branch network for source-free unsupervised domain adaptation, effectively transferring knowledge with limited source data while preserving privacy.
Contribution
The proposed CDBN architecture leverages high-confidence target samples and soft prompts to transfer semantic information, reducing data requirements and domain gap issues.
Findings
Achieves near state-of-the-art performance with fewer source samples
Effective transfer of semantic information via soft prompts
Reduces noise and domain gap impacts during training
Abstract
Source-free Unsupervised Domain Adaptation (SF-UDA) aims to transfer a model's performance from a labeled source domain to an unlabeled target domain without direct access to source samples, addressing critical data privacy concerns. However, most existing SF-UDA approaches assume the availability of abundant source domain samples, which is often impractical due to the high cost of data annotation. To address the dual challenges of limited source data and privacy concerns, we introduce a data-efficient, CLIP-powered dual-branch network (CDBN). This architecture consists of a cross-domain feature transfer branch and a target-specific feature learning branch, leveraging high-confidence target domain samples to transfer text features of source domain categories while learning target-specific soft prompts. By fusing the outputs of both branches, our approach not only effectively transfers…
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 ELM
