no code implementations • 27 Feb 2024 • Adela Frances DePavia, Erasmo Tani, Ali Vakilian
Finally, we provide alternative simpler performance bounds on the algorithms of Banerjee et al. (2022) for the case of searching on a known graph, and establish new lower bounds for this setting.
no code implementations • 22 May 2023 • Adela Frances DePavia, Olga Medrano Martín del Campo, Erasmo Tani
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.