How Far from Clinical Deployment? Evaluating the Complete Unsupervised Domain Adaptation Pipeline in Medical Imaging

• URL: http://arxiv.org/abs/2608.12035v1
• Date: Wed, 12 Aug 2026 13:19:14 GMT
• Title: How Far from Clinical Deployment? Evaluating the Complete Unsupervised Domain Adaptation Pipeline in Medical Imaging
• Abstract summary: unsupervised domain adaptation (UDA) in clinical practice requires choosing which algorithm to use and which of its trained models to ship.<n>We address this by evaluating the complete UDA pipeline, considering both adaptation and label-free selection.<n>Our study covers eleven clinically relevant cross-domain scenarios from nine medical imaging datasets, with ten UDA algorithms and 13 label-free selection methods (validators) evaluating over 80,000 trained models in total.
• Score: 0.4893345190925178
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Deploying unsupervised domain adaptation (UDA) in clinical practice requires choosing which algorithm to use and which of its trained models to ship. However, the deployment (target) domain is unlabeled, so models cannot be evaluated directly on it, leaving it unclear which to select. We address this by evaluating the complete UDA pipeline, considering both adaptation and label-free selection together. Our study covers eleven clinically relevant cross-domain scenarios from nine medical imaging datasets, with ten UDA algorithms and 13 label-free selection methods (validators), evaluating over 80,000 trained models in total. By this, we find that a capable adapted model usually exists, but identifying it without target labels is difficult: the validator-selected models leave a large and structural target performance gap to the best available one, with no evaluated validator consistently reliable. Towards closing it, we explore two strategies, ensembling and a small target-labeling budget; both narrow this gap but do not close it entirely. Overall, deployable UDA depends on the complete pipeline; addressing the less explored selection step could bring much of current UDA closer to clinical use.

Related papers

• Label-Free Foundational Model Selection for Medical Image Classification under Distribution Shift via Pseudo Label Discrepancy [3.0016442487726884]
  We propose a label-free selection criterion built on SUDO, a framework for evaluating clinical AI systems without ground-truth annotations.<n>We show that AURCC can be used to rank a variety of vision-language models on chest X-ray classification.
  arXiv  Detail & Related papers  (2026-08-26T13:56:29Z)
• Towards Practical Algorithm Selection for Unsupervised Domain Adaptation in Medical Imaging [0.4893345190925178]
  unsupervised domain adaptation (UDA) algori-thms exist, but for clinical practice, selecting the best-suited one remains unclear.<n>We propose a label-free criterion that jointly selects the algorithm and hyper parameters for UDA.<n>Our approach takes a step towards practical, label-free algorithm selection for clinical deployment of UDA.
  arXiv  Detail & Related papers  (2026-07-30T12:34:07Z)
• Towards Accurate Model Selection in Deep Unsupervised Domain Adaptation [86.19492706156304]
  Deep unsupervised domain adaptation (Deep UDA) methods successfully leverage rich labeled data in a source domain to boost the performance on related but unlabeled data in a target domain.<n>Existing model selection methods for Deep UDA are either highly biased, restricted, unstable, or even controversial (requiring labeled target data)<n>We propose textitDeep Embedded Validation (textbfDEV), which embeds adapted feature representation into the validation procedure to obtain unbiased estimation of the target risk with bounded variance.
  arXiv  Detail & Related papers  (2026-06-03T09:45:01Z)
• SKADA-Bench: Benchmarking Unsupervised Domain Adaptation Methods with Realistic Validation On Diverse Modalities [50.6382396309597]
  Unsupervised Domain Adaptation (DA) consists of adapting a model trained on a labeled source domain to perform well on an unlabeled target domain with some data distribution shift.<n>We present a complete and fair evaluation of existing shallow algorithms, including reweighting, mapping, and subspace alignment.<n>Our benchmark highlights the importance of realistic validation and provides practical guidance for real-life applications.
  arXiv  Detail & Related papers  (2024-07-16T12:52:29Z)
• An Uncertainty-guided Tiered Self-training Framework for Active Source-free Domain Adaptation in Prostate Segmentation [10.061310311839856]
  Source-free Domain Adaptation (SFDA) is a promising technique to adapt deep segmentation models to address privacy and security concerns. We propose a novel Uncertainty-guided Tiered Self-training (UGTST) framework to achieve stable domain adaptation.
  arXiv  Detail & Related papers  (2024-07-03T08:13:16Z)
• Dual-Reference Source-Free Active Domain Adaptation for Nasopharyngeal Carcinoma Tumor Segmentation across Multiple Hospitals [9.845637899896365]
  Nasopharyngeal carcinoma (NPC) is a prevalent and clinically significant malignancy that predominantly impacts the head and neck area. We propose a novel Sourece-Free Active Domain Adaptation (SFADA) framework to facilitate domain adaptation for the Gross Tumor Volume (GTV) segmentation task. We collect a large-scale clinical dataset comprising 1057 NPC patients from five hospitals to validate our approach.
  arXiv  Detail & Related papers  (2023-09-23T15:26:27Z)
• Source-Free Domain Adaptation for Medical Image Segmentation via Prototype-Anchored Feature Alignment and Contrastive Learning [57.43322536718131]
  We present a two-stage source-free domain adaptation (SFDA) framework for medical image segmentation. In the prototype-anchored feature alignment stage, we first utilize the weights of the pre-trained pixel-wise classifier as source prototypes. Then, we introduce the bi-directional transport to align the target features with class prototypes by minimizing its expected cost.
  arXiv  Detail & Related papers  (2023-07-19T06:07:12Z)
• Can We Evaluate Domain Adaptation Models Without Target-Domain Labels? [36.05871459064825]
  Unsupervised domain adaptation (UDA) involves adapting a model trained on a label-rich source domain to an unlabeled target domain. In real-world scenarios, the absence of target-domain labels makes it challenging to evaluate the performance of UDA models. We propose a novel metric called the textitTransfer Score to address these issues.
  arXiv  Detail & Related papers  (2023-05-30T03:36:40Z)
• Target and Task specific Source-Free Domain Adaptive Image Segmentation [73.78898054277538]
  We propose a two-stage approach for source-free domain adaptive image segmentation. We focus on generating target-specific pseudo labels while suppressing high entropy regions. In the second stage, we focus on adapting the network for task-specific representation.
  arXiv  Detail & Related papers  (2022-03-29T17:50:22Z)
• Tune it the Right Way: Unsupervised Validation of Domain Adaptation via Soft Neighborhood Density [125.64297244986552]
  We propose an unsupervised validation criterion that measures the density of soft neighborhoods by computing the entropy of the similarity distribution between points. Our criterion is simpler than competing validation methods, yet more effective.
  arXiv  Detail & Related papers  (2021-08-24T17:41:45Z)
• Self-Trained One-class Classification for Unsupervised Anomaly Detection [56.35424872736276]
  Anomaly detection (AD) has various applications across domains, from manufacturing to healthcare. In this work, we focus on unsupervised AD problems whose entire training data are unlabeled and may contain both normal and anomalous samples. To tackle this problem, we build a robust one-class classification framework via data refinement. We show that our method outperforms state-of-the-art one-class classification method by 6.3 AUC and 12.5 average precision.
  arXiv  Detail & Related papers  (2021-06-11T01:36:08Z)

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.