DeepAI AI Chat
Log In Sign Up

Ultra Fast Medoid Identification via Correlated Sequential Halving

by   Tavor Z. Baharav, et al.
Stanford University

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


page 1

page 2

page 3

page 4


Medoids in almost linear time via multi-armed bandits

Computing the medoid of a large number of points in high-dimensional spa...

Fast computation of all pairs of geodesic distances

Computing an array of all pairs of geodesic distances between the pixels...

Multi-Armed Bandit Problem and Batch UCB Rule

We obtain the upper bound of the loss function for a strategy in the mul...

ProtoBandit: Efficient Prototype Selection via Multi-Armed Bandits

In this work, we propose a multi-armed bandit based framework for identi...

Adaptive Data Depth via Multi-Armed Bandits

Data depth, introduced by Tukey (1975), is an important tool in data sci...

Nonparametric Bayesian multi-armed bandits for single cell experiment design

The problem of maximizing cell type discovery under budget constraints i...

Adaptive Learning of Rank-One Models for Efficient Pairwise Sequence Alignment

Pairwise alignment of DNA sequencing data is a ubiquitous task in bioinf...