Towards Practical Algorithm Selection for Unsupervised Domain Adaptation in Medical Imaging

• URL: http://arxiv.org/abs/2607.28125v1
• Date: Thu, 30 Jul 2026 12:34:07 GMT
• Title: Towards Practical Algorithm Selection for Unsupervised Domain Adaptation in Medical Imaging
• Abstract summary: 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.
• Score: 0.4893345190925178
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Numerous unsupervised domain adaptation (UDA) algori-thms exist, but for clinical practice, selecting the best-suited one along with proper hyperparameters often remains unclear, as the unlabeled deployment (target) domain prevents direct evaluation. We propose a label-free criterion that jointly selects the algorithm and hyperparameters for UDA. Given a pool of candidate models from multiple algorithms trained with different hyperparameters, our approach scores each candidate against an agreement reference, and selects the one with the highest score. The agreement reference is constructed in two levels without using target labels. First, we leverage multiple label-free selection signals, using each to nominate a model within every algorithm. Second, the nominated models are aggregated across algorithms to form a reference prediction for each unlabeled target sample. The candidate whose predictions agree most with this reference is then selected for deployment. Experimental results on four brain MRI and four chest X-ray datasets across seven clinically relevant transfer scenarios show that our method achieves better selection performance than other methods and remains effective across different algorithm pools. Our approach takes a step towards practical, label-free algorithm selection for clinical deployment of UDA.

Related papers

• How Far from Clinical Deployment? Evaluating the Complete Unsupervised Domain Adaptation Pipeline in Medical Imaging [0.4893345190925178]
  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.
  arXiv  Detail & Related papers  (2026-08-12T13:19:14Z)
• Domain Adaptation for Multi-label Image Classification: a Discriminator-free Approach [11.075823608370909]
  This paper introduces a discriminatorfree adversarial-based approach termed DDAMLIC for Unsupervised Image Classification (UDA)<n>We employ a two-component Gaussian Mixture Model (GMM) to model both source and target predictions, distinguishing between two distinct clusters.<n>The proposed framework is therefore not only fully differentiable but is also cost-effective as it avoids the expensive iterative process usually induced by the standard EM method.
  arXiv  Detail & Related papers  (2025-05-20T13:18:20Z)
• Multi-stage Retrieve and Re-rank Model for Automatic Medical Coding Recommendation [22.323705343864336]
  International Classification of Diseases (ICD) serves as a definitive medical classification system. The primary objective of ICD indexing is to allocate a subset of ICD codes to a medical record. Most existing approaches have suffered from selecting the proper label subsets from an extremely large ICD collection.
  arXiv  Detail & Related papers  (2024-05-29T13:54:30Z)
• Refined Pseudo labeling for Source-free Domain Adaptive Object Detection [9.705172026751294]
  Source-freeD is proposed to adapt source-trained detectors to target domains with only unlabeled target data. Existing source-freeD methods typically utilize pseudo labeling, where the performance heavily relies on the selection of confidence threshold. We present a category-aware adaptive threshold estimation module, which adaptively provides the appropriate threshold for each category.
  arXiv  Detail & Related papers  (2023-03-07T08:31:42Z)
• A Reproducible and Realistic Evaluation of Partial Domain Adaptation Methods [11.63848069914184]
  Unsupervised Domain Adaptation (UDA) aims at classifying unlabeled target images leveraging source labeled ones. In this work, we consider the Partial Domain Adaptation (PDA) variant, where we have extra source classes not present in the target domain. We evaluate 7 representative PDA algorithms on 2 different real-world datasets using 7 different model selection strategies.
  arXiv  Detail & Related papers  (2022-10-03T20:01:29Z)
• Contextual Active Model Selection [10.925932167673764]
  We present an approach to actively select pre-trained models while minimizing labeling costs.<n>The objective is to adaptively select the best model to make a prediction while limiting label requests.<n>We propose CAMS, a contextual active model selection algorithm that relies on two novel components.
  arXiv  Detail & Related papers  (2022-07-13T08:22:22Z)
• 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)
• Minimax Active Learning [61.729667575374606]
  Active learning aims to develop label-efficient algorithms by querying the most representative samples to be labeled by a human annotator. Current active learning techniques either rely on model uncertainty to select the most uncertain samples or use clustering or reconstruction to choose the most diverse set of unlabeled examples. We develop a semi-supervised minimax entropy-based active learning algorithm that leverages both uncertainty and diversity in an adversarial manner.
  arXiv  Detail & Related papers  (2020-12-18T19:03:40Z)
• SPL-MLL: Selecting Predictable Landmarks for Multi-Label Learning [87.27700889147144]
  We propose to select a small subset of labels as landmarks which are easy to predict according to input (predictable) and can well recover the other possible labels (representative) We employ the Alternating Direction Method (ADM) to solve our problem. Empirical studies on real-world datasets show that our method achieves superior classification performance over other state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-08-16T11:07:44Z)
• Joint Visual and Temporal Consistency for Unsupervised Domain Adaptive Person Re-Identification [64.37745443119942]
  This paper jointly enforces visual and temporal consistency in the combination of a local one-hot classification and a global multi-class classification. Experimental results on three large-scale ReID datasets demonstrate the superiority of proposed method in both unsupervised and unsupervised domain adaptive ReID tasks.
  arXiv  Detail & Related papers  (2020-07-21T14:31:27Z)
• Towards Model-Agnostic Post-Hoc Adjustment for Balancing Ranking Fairness and Algorithm Utility [54.179859639868646]
  Bipartite ranking aims to learn a scoring function that ranks positive individuals higher than negative ones from labeled data. There have been rising concerns on whether the learned scoring function can cause systematic disparity across different protected groups. We propose a model post-processing framework for balancing them in the bipartite ranking scenario.
  arXiv  Detail & Related papers  (2020-06-15T10:08:39Z)

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.