Locally Differentially Private Two-Sample Testing
Alexander Kent, Thomas B. Berrett, Yi Yu

TL;DR
This paper develops optimal two-sample testing procedures under local differential privacy constraints, demonstrating that permutation-based methods remain practical and effective, especially when interactivity is allowed, without requiring equal sample sizes.
Contribution
It introduces privacy-preserving permutation tests for two-sample problems, showing their optimality, practicality, and the benefits of interactivity without needing equal sample sizes.
Findings
Interactivity improves minimax separation rates.
Permutation tests are feasible under local privacy constraints.
Numerical experiments confirm theoretical advantages.
Abstract
We consider the problem of two-sample testing under a local differential privacy constraint where a permutation procedure is used to calibrate the tests. We develop testing procedures which are optimal up to logarithmic factors, for general discrete distributions and continuous distributions subject to a smoothness constraint. Both non-interactive and interactive tests are considered, and we show allowing interactivity results in an improvement in the minimax separation rates. Our results show that permutation procedures remain feasible in practice under local privacy constraints, despite the inability to permute the non-private data directly and only the private views. Further, through a refined theoretical analysis of the permutation procedure, we are able to avoid an equal sample size assumption which has been made in the permutation testing literature regardless of the presence of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSARS-CoV-2 detection and testing · Survey Sampling and Estimation Techniques · Machine Learning and Algorithms
