arXiv:2409.10908v3 Announce Type: replace-cross Abstract: Recovering the underlying $k$-clustering of a set $U$ of $n$ points by asking pair-wise same-cluster queries has garnered significant interest in the past few years. Given a query $S \subset U$, $|S|=2$, the oracle returns "yes" if the points are in the same cluster and "no" otherwise. For adaptive algorithms, the query complexity is known to be $\Theta(nk)$, while non-adaptive algorithms are extremely limited: even for $k=3$, such algorithms require $\Omega(n^2)$ queries, matching the trivial upper bound. However, non-adaptivity is hig
Source: arXiv cs.LG — read the full report at the original publisher.