Ultra Fast Medoid Identification via Correlated Sequential Halving

The medoid of a set of $n$ points is the point in the set that minimizes the sum of distances to other points. Computing the medoid can be solved exactly in $O(n^2)$ time by computing the distances between all pairs of points. Previous work shows that one can significantly reduce the number of distance computations needed by adaptively querying distances. The resulting randomized algorithm is obtained by a direct conversion of the computation problem to a multi-armed bandit statistical inference problem. In this work, we show that we can better exploit the structure of the underlying computation problem by modifying the traditional bandit sampling strategy and using it in conjunction with a suitably chosen multi-armed bandit algorithm. Four to five orders of magnitude gains over exact computation are obtained on real data, in terms of both number of distance computations needed and wall clock time. Theoretical results are obtained to quantify such gains in terms of data parameters. Our code is publicly available online at https://github.com/NEURIPS-anonymous-2019/Correlated-Sequential-Halving.