Autonomous Source Knowledge Selection in Multi-Domain Adaptation
Keqiuyin Li, Jie Lu, Hua Zuo, Guangquan Zhang

TL;DR
This paper introduces AutoS, a novel method for autonomous selection of the most relevant source data and models in multi-domain adaptation, improving transfer learning performance on unlabeled target domains.
Contribution
AutoS employs a density-driven selection strategy and a pseudo-label enhancement module to effectively identify and utilize the most transferable source information in multi-domain adaptation.
Findings
AutoS outperforms existing methods on real-world datasets.
The density-driven selection improves source sample relevance.
Pseudo-label enhancement reduces target label noise.
Abstract
Unsupervised multi-domain adaptation plays a key role in transfer learning by leveraging acquired rich source information from multiple source domains to solve target task from an unlabeled target domain. However, multiple source domains often contain much redundant or unrelated information which can harm transfer performance, especially when in massive-source domain settings. It is urgent to develop effective strategies for identifying and selecting the most transferable knowledge from massive source domains to address the target task. In this paper, we propose a multi-domain adaptation method named \underline{\textit{Auto}}nomous Source Knowledge \underline{\textit{S}}election (AutoS) to autonomosly select source training samples and models, enabling the prediction of target task using more relevant and transferable source information. The proposed method employs a density-driven…
Peer Reviews
Decision·ICLR 2026 Conference Withdrawn Submission
- The paper tackles an important problem of selecting relevant source domains for a target domain. - The idea of using pre-trained models to sub-select the source domains instead of re-training the source domains separately is very interesting.
- The paper lacks any sound intuition of technical depth as to why the proposed framework should work. The sequence of steps are just presented without adequate explanation as to what each of those are supposed to achieve, and why no other good alternatives exist. For example, L216-240 in Sec 3.3 has many successive equations but none of the notations are explained. $\Gamma, \pi, \sigma, \lambda$ are all used but none of them are grounded in previous notation or explained what they mean, without
The paper targets a practical scalability issue in MS‑UDA, i.e., addresses a valid and important research gap that is significantly important. Design of selection signal and two‑stage training with prompt‑only fine-tuning can conceptually reduce the overall complexity. Ablations indicate that each component of the proposal contributes to the performance.
The paper’s novelty might be the specific density-aware keep/drop rule coupled with federated aggregation. Other core components, such as source/domain selection or weighting, are better explored. The absolute performance gains compared with other baselines appear to be marginal. Potential dependence on a foundation model for pseudo-label production. Gains may partially stem from CLIP priors rather than the selection scheme, especially when referring to Tables 1 and 2; performance may degrade
- Recognizing that not all source information is equally useful in unsupervised multi-domain adaptation, the authors propose a selection strategy. - Each source domain is assigned a weight according to its relevance, enabling the model to selectively utilize information that is more beneficial for target domain adaptation. - In parallel with employing a multi-modal model, the authors propose a loss function designed to enhance the alignment of the target adaptation model.
- Lack of analysis - While the assumption that not all source information is useful is understandable, the paper would be more convincing if experimental evidence supporting this claim were provided. - The proposed loss function $\mathcal{L}_{\mathrm{ex}}$ appears to designed for the prompt tuning objective of a foundation model, but its precise mathematical definition and formulation should be explicitly stated. - Additional experiments are needed to justify the validity of the hyper
1. The method is modular and integrates several known techniques (e.g., density estimation, prompt tuning, CLIP supervision). 2. This paper shows some promising empirical results on standard benchmarks.
1. The method assumes the availability of domain labels for all source domains. In practice, especially with large-scale web or industrial data, domain boundaries are often unknown or ambiguous. The entire framework depends on identifying and discarding full source domains, which is risky. 2. The problem of transferring from multiple labeled domains to an unlabeled target is a classic transfer learning setting. However, the method relies on CLIP, itself already mitigates many of the traditional
1. The research motivation of this paper is clearly articulated, and the framework diagram is well-designed. 2. The paper includes comprehensive ablation studies and visualizations, which strengthen the presented work.
1. The performance advantage of the proposed method over the state-of-the-art ones is marginal. On the four benchmark datasets, the highest improvement over the state-of-the-art is only 0.4%, and the method even underperforms some baselines in certain cases. This raises serious doubts about the method's practical effectiveness and its overall contribution. 2. The ablation study presented in Table 3 fails to provide compelling evidence for the effectiveness of the individual components. The perf
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Face recognition and analysis · Speech Recognition and Synthesis
