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

1 code implementation • NeurIPS 2020 • Govinda M. Kamath, Tavor Z. Baharav, Ilan Shomorony

The second ingredient is to utilise a multi-armed bandit algorithm to adaptively refine this spectral estimator only for read pairs that are likely to have large alignments.

Bandit-Based Monte Carlo Optimization for Nearest Neighbors

1 code implementation • 21 May 2018 • Vivek Bagaria, Tavor Z. Baharav, Govinda M. Kamath, David N. Tse

The celebrated Monte Carlo method estimates an expensive-to-compute quantity by random sampling.

Clustering Multi-Armed Bandits

Medoids in almost linear time via multi-armed bandits

1 code implementation • 2 Nov 2017 • Vivek Bagaria, Govinda M. Kamath, Vasilis Ntranos, Martin J. Zhang, David Tse

Computing the medoid of a large number of points in high-dimensional space is an increasingly common operation in many data science problems.

Multi-Armed Bandits