Jul 2024· International Journal of Machine Learning and Cybernetics· Vol 17· 9 citations· 56 references
Computer Science
TL;DR
Efficient Unsupervised Domain Adaptation (EUDA) is proposed, a parameter-efficient framework that leverages a frozen DINOv2 backbone as a feature extractor and updates only a lightweight bottleneck and classification head to promote both discriminative learning and cross-domain alignment.
Abstract
Unsupervised domain adaptation (UDA) aims to mitigate domain shift, where the distribution of labeled source data differs from that of unlabeled target data. Despite recent advances, existing methods often rely on fine-tuning large backbone models, which leads to high computational cost and limits scalability in resource-constrained environments. This limitation highlights the need for parameter-efficient approaches that maintain strong performance with reduced training complexity. Self-supervised foundation models such as DINOv2 provide highly transferable representations and raise the question of whether effective domain adaptation can be achieved without full fine-tuning. To address this question, we propose Efficient Unsupervised Domain Adaptation (EUDA), a parameter-efficient framework that leverages a frozen DINOv2 backbone as a feature extractor and updates only a lightweight bottleneck and classification head. We also adopt a synergistic domain alignment loss (SDAL), which combines cross-entropy (CE) and maximum mean discrepancy (MMD) to promote both discriminative learning and cross-domain alignment. Experimental results on Office-Home, Office-31, VisDA-2017, and DomainNet demonstrate that EUDA achieves competitive performance across diverse domain complexities, while reducing the number of trainable parameters by 42 to 99.7%. These results show the suitability of the proposed method for resource-constrained and distributed environments.
Unsupervised domain adaptation (UDA) based on large vision-language models (VLMs) has recently demonstrated strong generalization ability, yet it remains fundamentally challenged by noisy pseudo-labels and inefficient adaptation under large domain shifts. In this paper, we propose Progressive Hybrid Pseudo-Labeling for...
Yang-Tao Wang, Mingxin Huang, Xingwei Deng et al.· IEEE Transactions on Image P...· 0 citations
A combined framework to cover and validate domain adaptation and multitask balancing in the realistic context of an extreme class imbalance is proposed and evaluated in the physics-based context of the Cherenkov Telescope Array Observatory (CTAO).
M. Dell'aiera, Thomas Vuillaume, Alexandre Benoît· Astronomy and Computing· 1 citation
This paper proposes ADA-CS, a plug-and-play module compatible with any ADA or ASFDA framework, and introduces a CSS metric to quantify the Concept Shift Severity across domains, revealing that non-negligible concept shift exists in many transfer tasks.
This work proposes Selective Constraint Learning (SCL), a framework that introduces external semantic guidance as a stable prior for unsupervised cross-domain image retrieval and designs a generic constraint loss to jointly facilitate intra-domain compactness and inter-domain alignment.
Wensi Fang, Xiaodan Zhang, Xiao-Yu Lian et al.· Annual International ACM SIG...· 0 citations
CVKD-UDA is proposed, which revisits voxel size as a core design factor to construct domain-similar representations and leverages cross-view complementary cues to balance transferability and discriminability of the warm-up model.
Zhimin Yuan, Ming Cheng, Shang-Shu Yu et al.· IEEE transactions on multime...· 0 citations
Unified architectures that jointly perform semantic segmentation and monocular height estimation offer improved computational efficiency through shared representations, but face challenges in remote sensing applications: scarce annotations, intertask interference, and cross-regional domain shifts. These issues often le...
Zitong Wu, Yaoyao Yin, Biao Hou et al.· IEEE Transactions on Geoscie...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.