Practical Locally Private Heavy Hitters
NIPS, pp. 2288-2296, 2017.
We present new practical local differentially private heavy hitters algorithms achieving optimal or near-optimal worst-case error -- TreeHist and Bitstogram. In both algorithms, server running time is $tilde O(n)$ and user running time is $tilde O(1)$, hence improving on the prior state-of-the-art result of Bassily and Smith [STOC 2015] r...More
Full Text (Upload PDF)
PPT (Upload PPT)