GALA: A GlobAl-LocAl Approach for Multi-Source Active Domain Adaptation
Juepeng Zheng, Peifeng Zhang, Yibin Wen, Qingmei Li, Yang Zhang, Haohuan Fu
TL;DR
The paper tackles Multi-Source Active Domain Adaptation (MS-ADA), where a model must adapt to a target domain with only a handful of labeled examples while leveraging multiple labeled source domains. It introduces GALA, a simple plug-and-play strategy comprising a global step using gradient embeddings and $k$-means clustering, followed by a cluster-wise local step that accounts for domain gaps across sources. The method can be integrated with existing DA frameworks without extra trainable parameters and achieves state-of-the-art results, closely matching fully supervised upper bounds with only 1% target annotations across Digit-Five, Office-Home, and DomainNet. The work provides both empirical evidence and theoretical insight (via $\mathcal{H} \Delta \mathcal{H}$ bounds) into why GALA improves both diversity and transferability in MS-ADA settings, delivering practical gains for real-world cross-domain tasks.
Abstract
Domain Adaptation (DA) provides an effective way to tackle target-domain tasks by leveraging knowledge learned from source domains. Recent studies have extended this paradigm to Multi-Source Domain Adaptation (MSDA), which exploits multiple source domains carrying richer and more diverse transferable information. However, a substantial performance gap still remains between adaptation-based methods and fully supervised learning. In this paper, we explore a more practical and challenging setting, named Multi-Source Active Domain Adaptation (MS-ADA), to further enhance target-domain performance by selectively acquiring annotations from the target domain. The key difficulty of MS-ADA lies in designing selection criteria that can jointly handle inter-class diversity and multi-source domain variation. To address these challenges, we propose a simple yet effective GALA strategy (GALA), which combines a global k-means clustering step for target-domain samples with a cluster-wise local selection criterion, effectively tackling the above two issues in a complementary manner. Our proposed GALA is plug-and-play and can be seamlessly integrated into existing DA frameworks without introducing any additional trainable parameters. Extensive experiments on three standard DA benchmarks demonstrate that GALA consistently outperforms prior active learning and active DA methods, achieving performance comparable to the fully-supervised upperbound while using only 1% of the target annotations.
