5 citations · 5 across the 6 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021★ 5 cited
Differentially Private Multi-Armed Bandits in the Shuffle Model
Jay Tenenbaum, Haim Kaplan, Yishay Mansour +1
We give an -differentially private algorithm for the multi-armed bandit (MAB) problem in the shuffle model with a distribution-dependent regret of $O\left(\left(\s…
cs.DS2021
Locality Sensitive Hashing for Efficient Similar Polygon Retrieval
Haim Kaplan, Jay Tenenbaum
Locality Sensitive Hashing (LSH) is an effective method of indexing a set of items to support efficient nearest neighbors queries in high-dimensional spaces. The basic idea of LSH…