Casting a BAIT for Offline and Online Source-free Domain Adaptation
- URL: http://arxiv.org/abs/2010.12427v5
- Date: Sat, 10 Jun 2023 05:24:15 GMT
- Title: Casting a BAIT for Offline and Online Source-free Domain Adaptation
- Authors: Shiqi Yang, Yaxing Wang, Joost van de Weijer, Luis Herranz and
Shangling Jui
- Abstract summary: We address the source-free domain adaptation (SFDA) problem, where only the source model is available during adaptation to the target domain.
Inspired by diverse classifier based domain adaptation methods, in this paper we introduce a second classifier.
When adapting to the target domain, the additional classifier from source is expected to find misclassified features.
Our method surpasses by a large margin other SFDA methods under online source-free domain adaptation setting.
- Score: 51.161476418834766
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We address the source-free domain adaptation (SFDA) problem, where only the
source model is available during adaptation to the target domain. We consider
two settings: the offline setting where all target data can be visited multiple
times (epochs) to arrive at a prediction for each target sample, and the online
setting where the target data needs to be directly classified upon arrival.
Inspired by diverse classifier based domain adaptation methods, in this paper
we introduce a second classifier, but with another classifier head fixed. When
adapting to the target domain, the additional classifier initialized from
source classifier is expected to find misclassified features. Next, when
updating the feature extractor, those features will be pushed towards the right
side of the source decision boundary, thus achieving source-free domain
adaptation. Experimental results show that the proposed method achieves
competitive results for offline SFDA on several benchmark datasets compared
with existing DA and SFDA methods, and our method surpasses by a large margin
other SFDA methods under online source-free domain adaptation setting.
Related papers
- CNG-SFDA:Clean-and-Noisy Region Guided Online-Offline Source-Free Domain Adaptation [6.222371087167951]
Source-Free Domain Adaptation (SFDA) aims to adopt a trained model on the source domain to the target domain.
handling false labels in the target domain is crucial because they negatively impact the model performance.
We conduct extensive experiments on multiple datasets in online/offline SFDA settings, whose results demonstrate that our method, CNG-SFDA, achieves state-of-the-art for most cases.
arXiv Detail & Related papers (2024-01-26T01:29:37Z) - SIDE: Self-supervised Intermediate Domain Exploration for Source-free
Domain Adaptation [36.470026809824674]
Domain adaptation aims to alleviate the domain shift when transferring the knowledge learned from the source domain to the target domain.
Due to privacy issues, source-free domain adaptation (SFDA) has recently become very demanding yet challenging.
This paper proposes self-supervised intermediate domain exploration (SIDE) that effectively bridges the domain gap with an intermediate domain.
arXiv Detail & Related papers (2023-10-13T07:50:37Z) - Upcycling Models under Domain and Category Shift [95.22147885947732]
We introduce an innovative global and local clustering learning technique (GLC)
We design a novel, adaptive one-vs-all global clustering algorithm to achieve the distinction across different target classes.
Remarkably, in the most challenging open-partial-set DA scenario, GLC outperforms UMAD by 14.8% on the VisDA benchmark.
arXiv Detail & Related papers (2023-03-13T13:44:04Z) - Source-Free Domain Adaptation via Distribution Estimation [106.48277721860036]
Domain Adaptation aims to transfer the knowledge learned from a labeled source domain to an unlabeled target domain whose data distributions are different.
Recently, Source-Free Domain Adaptation (SFDA) has drawn much attention, which tries to tackle domain adaptation problem without using source data.
In this work, we propose a novel framework called SFDA-DE to address SFDA task via source Distribution Estimation.
arXiv Detail & Related papers (2022-04-24T12:22:19Z) - UMAD: Universal Model Adaptation under Domain and Category Shift [138.12678159620248]
Universal Model ADaptation (UMAD) framework handles both UDA scenarios without access to source data.
We develop an informative consistency score to help distinguish unknown samples from known samples.
Experiments on open-set and open-partial-set UDA scenarios demonstrate that UMAD exhibits comparable, if not superior, performance to state-of-the-art data-dependent methods.
arXiv Detail & Related papers (2021-12-16T01:22:59Z) - Generalized Source-free Domain Adaptation [47.907168218249694]
We propose a new domain adaptation paradigm called Generalized Source-free Domain Adaptation (G-SFDA)
For target performance our method is on par with or better than existing DA and SFDA methods, specifically it achieves state-of-the-art performance (85.4%) on VisDA.
arXiv Detail & Related papers (2021-08-03T16:34:12Z) - Instance Level Affinity-Based Transfer for Unsupervised Domain
Adaptation [74.71931918541748]
We propose an instance affinity based criterion for source to target transfer during adaptation, called ILA-DA.
We first propose a reliable and efficient method to extract similar and dissimilar samples across source and target, and utilize a multi-sample contrastive loss to drive the domain alignment process.
We verify the effectiveness of ILA-DA by observing consistent improvements in accuracy over popular domain adaptation approaches on a variety of benchmark datasets.
arXiv Detail & Related papers (2021-04-03T01:33:14Z) - Open-Set Hypothesis Transfer with Semantic Consistency [99.83813484934177]
We introduce a method that focuses on the semantic consistency under transformation of target data.
Our model first discovers confident predictions and performs classification with pseudo-labels.
As a result, unlabeled data can be classified into discriminative classes coincided with either source classes or unknown classes.
arXiv Detail & Related papers (2020-10-01T10:44:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.