This is the public, feature-limited version of the conference webpage. After Registration and login please visit the full version.

Locally private non-asymptotic testing of discrete distributions is faster using interactive mechanisms

Tom Berrett, Cristina Butucea

Oral presentation: Orals & Spotlights Track 10: Social/Privacy
on 2020-12-08T06:30:00-08:00 - 2020-12-08T06:45:00-08:00
Poster Session 2 (more posters)
on 2020-12-08T09:00:00-08:00 - 2020-12-08T11:00:00-08:00
Abstract: We find separation rates for testing multinomial or more general discrete distributions under the constraint of alpha-local differential privacy. We construct efficient randomized algorithms and test procedures, in both the case where only non-interactive privacy mechanisms are allowed and also in the case where all sequentially interactive privacy mechanisms are allowed. The separation rates are faster in the latter case. We prove general information theoretical bounds that allow us to establish the optimality of our algorithms among all pairs of privacy mechanisms and test procedures, in most usual cases. Considered examples include testing uniform, polynomially and exponentially decreasing distributions.

Preview Video and Chat

To see video, interact with the author and ask questions please use registration and login.