Unsupervised domain adaptation methods traditionally assume that all source categories are present in the target domain. In practice, little may be known about the category overlap between the two domains. While some methods address target settings with either partial or open-set categories, they assume that the particular setting is known a priori. We propose a more universally applicable domain adaptation framework that can handle arbitrary category shift, called Domain Adaptative Neighborhood Clustering via Entropy optimization (DANCE). DANCE combines two novel ideas: First, as we cannot fully rely on source categories to learn features discriminative for the target, we propose a novel neighborhood clustering technique to learn the structure of the target domain in a self-supervised way. Second, we use entropy-based feature alignment and rejection to align target features with the source, or reject them as unknown categories based on their entropy. We show through extensive experiments that DANCE outperforms baselines across open-set, open-partial and partial domain adaptation settings. Implementation is available at https://github.com/VisionLearningGroup/DANCE.
翻译:传统上,不受监督的域适应方法假定所有源类别都存在于目标域域中。 实际上,对这两个域之间的类别重叠可能知之甚少。 虽然有些方法针对部分或开放的类别的目标设置, 但有些方法假定特定设置是先入为主的。 我们提议了一个更普遍适用的域适应框架, 能够处理任意类别转移, 称为“ 环境适应性邻居群集 ” ( Dance) 。 舞蹈结合了两个新颖的想法: 首先, 由于我们不能完全依靠源类别来了解目标对象的区别性特征, 我们提议了一种新的街区群集技术, 以自我监督的方式学习目标域的结构。 其次, 我们使用基于 entropy 的特性对齐和拒绝将目标特性与源相匹配, 或者根据源的宽度拒绝它们作为未知的类别。 我们通过广泛的实验显示, Dance 超越了开放、 开放部分和部分域适应设置的基线。 执行可在 https://github.com/ VisionLeargroup/Dance。