This paper initiates the study of active learning for exact recovery of partitions exclusively through access to a same-cluster oracle in the presence of bounded adversarial error. We first highlight a novel connection between learning partitions and correlation clustering. Then we use this connection to build a R\'enyi-Ulam style analytical framework for this problem, and prove upper and lower bounds on its worst-case query complexity. Further, we bound the expected performance of a relevant randomized algorithm. Finally, we study the relationship between adaptivity and query complexity for this problem and related variants.
翻译:本文首次研究了在存在有界对抗误差的情况下,仅通过同类簇Oracle进行划分精确恢复的主动学习问题。我们首先揭示了划分学习与相关聚类之间的一种新颖联系,继而利用该联系为该问题构建了Rényi-Ulam风格的分析框架,并证明了其最坏情况下查询复杂度的上下界。此外,我们界定了相关随机算法的期望性能。最后,我们研究了该问题及其相关变体中适应性查询与查询复杂度之间的关系。