arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.01845cs.LGcs.CV
收藏

无需访问源数据的无监督多源领域自适应

Unsupervised Multi-source Domain Adaptation Without Access to Source Data

University of California Riverside(加州大学河滨分校);Google Research(谷歌研究院)

Sk Miraj Ahmed, Dripta S. Raychaudhuri, Sujoy Paul, Samet Oymak, Amit K. Roy-Chowdhury

摘要:

无监督领域自适应(UDA)旨在通过从单独的标记源域转移知识来学习未标记域的预测模型。然而,这些常规UDA方法中的大多数做出在训练期间能够访问源数据的强假设,这可能由于隐私、安全和存储问题而不是非常实际。最近的一系列工作解决了这个问题,并提出了一种算法,将知识从一个单一的源模型转移到未标记的目标域,而不需要访问源数据。然而,为了适应的目的,如果有多个训练的源模型可供选择,这种方法必须单独适应每个模型,以检查最佳源。因此,我们提出这样一个问题:我们能否找到没有源数据且没有目标标签的源模型的最佳组合,其性能不劣于单个最佳源?为了回答这个问题,我们提出了一种新的和有效的算法,自动结合源模型与合适的权重,以这样一种方式,它执行至少一样好的最佳源模型。我们提供直观的理论见解来证明我们的主张。此外,在几个基准数据集上进行了大量的实验,以显示我们的算法的有效性,在大多数情况下,我们的方法不仅达到最佳的源精度,而且优于它。

英文摘要:

Unsupervised Domain Adaptation (UDA) aims to learn a predictor model for an unlabeled domain by transferring knowledge from a separate labeled source domain. However, most of these conventional UDA approaches make the strong assumption of having access to the source data during training, which may not be very practical due to privacy, security and storage concerns. A recent line of work addressed this problem and proposed an algorithm that transfers knowledge to the unlabeled target domain from a single source model without requiring access to the source data. However, for adaptation purposes, if there are multiple trained source models available to choose from, this method has to go through adapting each and every model individually, to check for the best source. Thus, we ask the question: can we find the optimal combination of source models, with no source data and without target labels, whose performance is no worse than the single best source? To answer this, we propose a novel and efficient algorithm which automatically combines the source models with suitable weights in such a way that it performs at least as good as the best source model. We provide intuitive theoretical insights to justify our claim. Furthermore, extensive experiments are conducted on several benchmark datasets to show the effectiveness of our algorithm, where in most cases, our method not only reaches best source accuracy but also outperforms it.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑