Communication Efficient, Sample Optimal, Linear Time Locally Private Discrete Distribution Estimation
share
We consider discrete distribution estimation over k elements under ε-local differential privacy from n samples. The samples are distributed across users who send privatized versions of their sample to the server. All previously known sample optimal algorithms require linear (in k) communication complexity in the high privacy regime (ε<1), and have a running time that grows as n· k, which can be prohibitive for large domain size k. We study the task simultaneously under four resource constraints, privacy, sample complexity, computational complexity, and communication complexity. We propose Hadamard Response (HR), a local non-interactive privatization mechanism with order optimal sample complexity (for all privacy regimes), a communication complexity of k+2 bits, and runs in nearly linear time. Our encoding and decoding mechanisms are based on Hadamard matrices, and are simple to implement. The gain in sample complexity comes from the large Hamming distance between rows of Hadamard matrices, and the gain in time complexity is achieved by using the Fast Walsh-Hadamard transform. We compare our approach with Randomized Response (RR), RAPPOR, and subset-selection mechanisms (SS), theoretically, and experimentally. For k=10000, our algorithm runs about 100x faster than SS, and RAPPOR.
READ FULL TEXT