论文标题
主动无源源域的适应
Active Source Free Domain Adaptation
论文作者
论文摘要
源免费域适应(SFDA)旨在将经过训练的源模型转移到未标记的目标域而无需访问源数据的情况下。但是,由于缺乏源数据和目标监督信息,SFDA设置面临效果瓶颈,这是最新的SFDA方法的有限增长所证明的。在本文中,我们首次引入了一个更实用的场景,称为主动源域适应性(ASFDA),该场景允许积极选择一些由专家标记的目标数据。为了实现这一目标,我们首先发现那些满足邻居差异,个体不同和类似目标的特性的人是最佳选择的点,我们将它们定义为最小快乐(MH)点。然后,我们建议最低的快乐积分学习(MHPL)积极探索和利用MH点。我们设计了三种独特的策略:邻居环境不确定性,邻居多样性放松和一声查询,以探索MH点。此外,为了在学习过程中充分利用MH点,我们设计了一个邻居焦点损失,将加权邻居纯度分配给MH点的跨透明镜损失,以使模型更多地关注它们。广泛的实验证明,MHPL非常超过各种类型的基线,并以较小的标签成本实现了显着的性能增长。
Source free domain adaptation (SFDA) aims to transfer a trained source model to the unlabeled target domain without accessing the source data. However, the SFDA setting faces an effect bottleneck due to the absence of source data and target supervised information, as evidenced by the limited performance gains of newest SFDA methods. In this paper, for the first time, we introduce a more practical scenario called active source free domain adaptation (ASFDA) that permits actively selecting a few target data to be labeled by experts. To achieve that, we first find that those satisfying the properties of neighbor-chaotic, individual-different, and target-like are the best points to select, and we define them as the minimum happy (MH) points. We then propose minimum happy points learning (MHPL) to actively explore and exploit MH points. We design three unique strategies: neighbor ambient uncertainty, neighbor diversity relaxation, and one-shot querying, to explore the MH points. Further, to fully exploit MH points in the learning process, we design a neighbor focal loss that assigns the weighted neighbor purity to the cross-entropy loss of MH points to make the model focus more on them. Extensive experiments verify that MHPL remarkably exceeds the various types of baselines and achieves significant performance gains at a small cost of labeling.