Locally Private Hypothesis Testing

02/09/2018
by   Or Sheffet, et al.
0

We initiate the study of differentially private hypothesis testing in the local-model, under both the standard (symmetric) randomized-response mechanism (Warner, 1965, Kasiviswanathan et al, 2008) and the newer (non-symmetric) mechanisms (Bassily and Smith, 2015, Bassily et al, 2017). First, we study the general framework of mapping each user's type into a signal and show that the problem of finding the maximum-likelihood distribution over the signals is feasible. Then we discuss the randomized-response mechanism and show that, in essence, it maps the null- and alternative-hypotheses onto new sets, an affine translation of the original sets. We then give sample complexity bounds for identity and independence testing under randomized-response. We then move to the newer non-symmetric mechanisms and show that there too the problem of finding the maximum-likelihood distribution is feasible. Under the mechanism of Bassily et al (2007) we give identity and independence testers with better sample complexity than the testers in the symmetric case, and we also propose a χ^2-based identity tester which we investigate empirically.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/07/2018

Test without Trust: Optimal Locally Private Distribution Testing

We study the problem of distribution testing when the samples can only b...
research
08/14/2022

Differentially Private Hypothesis Testing with the Subsampled and Aggregated Randomized Response Mechanism

Randomized response is one of the oldest and most well-known methods for...
research
07/08/2022

Private independence testing across two parties

We introduce π-test, a privacy-preserving algorithm for testing statisti...
research
04/16/2020

Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity

We present a differentially private learner for halfspaces over a finite...
research
06/19/2023

Minimax optimal testing by classification

This paper considers an ML inspired approach to hypothesis testing known...
research
10/19/2020

On the Sample Complexity of Privately Learning Unbounded High-Dimensional Gaussians

We provide sample complexity upper bounds for agnostically learning mult...
research
02/11/2023

Low Sample Complexity Participatory Budgeting

We study low sample complexity mechanisms in participatory budgeting (PB...

Please sign up or login with your details

Forgot password? Click here to reset