LFM: Leveraging Foundation Models for Source-Free Universal Domain Adaptation

• URL: http://arxiv.org/abs/2607.17653v1
• Date: Mon, 20 Jul 2026 08:06:44 GMT
• Title: LFM: Leveraging Foundation Models for Source-Free Universal Domain Adaptation
• Abstract summary: Source-free universal domain adaptation (SF-UniDA) adapts a pre-trained source model to an unlabeled target domain.<n>We propose a framework that leverages foundation models (LFM) for SF-UniDA.
• Score: 73.21089889761498
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Source-free universal domain adaptation (SF-UniDA) adapts a pre-trained source model to an unlabeled target domain under both covariate and label shifts, without access to source data. However, existing SF-UniDA methods rely on inefficient techniques such as threshold tuning and clustering. Foundation models (FMs), known for their generalization and zero-shot capabilities, remain underexplored in SF-UniDA. In this paper, we propose a framework that leverages foundation models (LFM) for SF-UniDA. We use a vision-language model (VLM) to compute similarities between target samples and text labels, including those for unknown classes generated by prompting a large language model. The label shift type is determined by analyzing the coefficient of variation of a similarity-based sample-level score. Unknown samples are identified using a binary Gaussian mixture model fitted to another similarity-based metric. Under a consensus strategy, the pseudo-labels generated by the VLM are refined by the target model initialized with the pre-trained source model, integrating knowledge from both the source domain and foundation models. Finally, these refined pseudo-labels are used to train the target model. Extensive experiments across all possible label shifts and multiple benchmarks demonstrate the effectiveness and superiority of our proposed LFM framework. Our code is available at https://github.com/iamjingli/LFM.

Related papers

• GMM-COMET: Continual Source-Free Universal Domain Adaptation via a Mean Teacher and Gaussian Mixture Model-Based Pseudo-Labeling [3.1744658275045103]
  Unsupervised domain adaptation tackles the problem that domain shifts between training and test data impair the performance of neural networks in real-world applications.<n>This setting, known as source-free universal domain adaptation (SF-UniDA), has recently gained attention.<n>We present the first study on continual SF-UniDA, where the model must adapt sequentially to a stream of multiple different unlabeled target domains.
  arXiv  Detail & Related papers  (2026-01-16T10:23:19Z)
• Similarity-Based Domain Adaptation with LLMs [13.692329347889212]
  Unsupervised domain adaptation leverages abundant labeled data from various source domains to generalize onto unlabeled target data.<n>This paper introduces a simple framework that utilizes the impressive generalization capabilities of Large Language Models (LLMs) for target data annotation.<n>Our framework achieves impressive performance, specifically, 2.44% accuracy improvement when compared to the SOTA method.
  arXiv  Detail & Related papers  (2025-03-07T09:51:07Z)
• ProtoGMM: Multi-prototype Gaussian-Mixture-based Domain Adaptation Model for Semantic Segmentation [0.8213829427624407]
  Domain adaptive semantic segmentation aims to generate accurate and dense predictions for an unlabeled target domain. We propose the ProtoGMM model, which incorporates the GMM into contrastive losses to perform guided contrastive learning. To achieve increased intra-class semantic similarity, decreased inter-class similarity, and domain alignment between the source and target domains, we employ multi-prototype contrastive learning.
  arXiv  Detail & Related papers  (2024-06-27T14:50:50Z)
• Exploiting Label Skews in Federated Learning with Model Concatenation [39.38427550571378]
  Federated Learning (FL) has emerged as a promising solution to perform deep learning on different data owners without exchanging raw data. Among different non-IID types, label skews have been challenging and common in image classification and other tasks. We propose FedConcat, a simple and effective approach that degrades these local models as the base of the global model.
  arXiv  Detail & Related papers  (2023-12-11T10:44:52Z)
• COCA: Classifier-Oriented Calibration via Textual Prototype for Source-Free Universal Domain Adaptation [58.53682309436275]
  Universal domain adaptation (UniDA) aims to address domain and category shifts across data sources. SF-UniDA methods eliminate the need for direct access to source samples when performing adaptation to the target domain. Existing SF-UniDA methods still require an extensive quantity of labeled source samples to train a source model. We present a novel plug-and-play calibration (COCA) method to tackle this issue.
  arXiv  Detail & Related papers  (2023-08-21T03:50:19Z)
• Consistency Regularization for Generalizable Source-free Domain Adaptation [62.654883736925456]
  Source-free domain adaptation (SFDA) aims to adapt a well-trained source model to an unlabelled target domain without accessing the source dataset. Existing SFDA methods ONLY assess their adapted models on the target training set, neglecting the data from unseen but identically distributed testing sets. We propose a consistency regularization framework to develop a more generalizable SFDA method.
  arXiv  Detail & Related papers  (2023-08-03T07:45:53Z)
• Divide and Contrast: Source-free Domain Adaptation via Adaptive Contrastive Learning [122.62311703151215]
  Divide and Contrast (DaC) aims to connect the good ends of both worlds while bypassing their limitations. DaC divides the target data into source-like and target-specific samples, where either group of samples is treated with tailored goals. We further align the source-like domain with the target-specific samples using a memory bank-based Maximum Mean Discrepancy (MMD) loss to reduce the distribution mismatch.
  arXiv  Detail & Related papers  (2022-11-12T09:21:49Z)
• 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)
• BMD: A General Class-balanced Multicentric Dynamic Prototype Strategy for Source-free Domain Adaptation [74.93176783541332]
  Source-free Domain Adaptation (SFDA) aims to adapt a pre-trained source model to the unlabeled target domain without accessing the well-labeled source data. To make up for the absence of source data, most existing methods introduced feature prototype based pseudo-labeling strategies. We propose a general class-Balanced Multicentric Dynamic prototype strategy for the SFDA task.
  arXiv  Detail & Related papers  (2022-04-06T13:23:02Z)
• Domain Adaptation without Source Data [20.64875162351594]
  We introduce Source data-Free Domain Adaptation (SFDA) to avoid accessing source data that may contain sensitive information. Our key idea is to leverage a pre-trained model from the source domain and progressively update the target model in a self-learning manner. Our PrDA outperforms conventional domain adaptation methods on benchmark datasets.
  arXiv  Detail & Related papers  (2020-07-03T07:21:30Z)
• Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptation [102.67010690592011]
  Unsupervised adaptationUDA (UDA) aims to leverage the knowledge learned from a labeled source dataset to solve similar tasks in a new unlabeled domain. Prior UDA methods typically require to access the source data when learning to adapt the model. This work tackles a practical setting where only a trained source model is available and how we can effectively utilize such a model without source data to solve UDA problems.
  arXiv  Detail & Related papers  (2020-02-20T03:13:58Z)

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.