Search Results for author: Ilan Shomorony

Found 4 papers, 3 papers with code

Private DNA Sequencing: Hiding Information in Discrete Noise

no code implementations28 Jan 2021 Kayvon Mazooji, Roy Dong, Ilan Shomorony

When an individual's DNA is sequenced, sensitive medical information becomes available to the sequencing laboratory.

Information Theory Cryptography and Security Information Theory

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.

Multi-Armed Bandits

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.

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

2 code implementations11 Jun 2020 Mo Tiwari, Martin Jinye Zhang, James Mayclin, Sebastian Thrun, Chris Piech, Ilan Shomorony

Current state-of-the-art $k$-medoids clustering algorithms, such as Partitioning Around Medoids (PAM), are iterative and are quadratic in the dataset size $n$ for each iteration, being prohibitively expensive for large datasets.

Multi-Armed Bandits

Cannot find the paper you are looking for? You can Submit a new open access paper.