Practical Locally Private Heavy Hitters

    Journal of Machine Learning Research, pp. 1-42, 2020.

    Cited by: 89|Bibtex|Views5|Links
    EI

    Abstract:

    We present new practical local differentially private heavy hitters algorithms achieving optimal or near-optimal worst-case error and running time -- 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 an...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments