BanditPAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits

1 code implementation • NeurIPS 2020 • Mo Tiwari, Martin J. Zhang, James Mayclin, Sebastian Thrun, Chris Piech, Ilan Shomorony

In these experiments, we observe that BanditPAM returns the same results as state-of-the-art PAM-like algorithms up to 4x faster while performing up to 200x fewer distance computations.

Clustering Multi-Armed Bandits

NeuralFDR: Learning Discovery Thresholds from Hypothesis Features

1 code implementation • NeurIPS 2017 • Fei Xia, Martin J. Zhang, James Zou, David Tse

For example, in genetic association studies, each hypothesis tests the correlation between a variant and the trait.

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

Contrastive Principal Component Analysis

1 code implementation • 20 Sep 2017 • Abubakar Abid, Martin J. Zhang, Vivek K. Bagaria, James Zou

We present a new technique called contrastive principal component analysis (cPCA) that is designed to discover low-dimensional structure that is unique to a dataset, or enriched in one dataset relative to other data.

Denoising feature selection +1