English

Private Identity Testing for High-Dimensional Distributions

Data Structures and Algorithms 2022-03-07 v3 Cryptography and Security Information Theory Machine Learning math.IT Machine Learning

Abstract

In this work we present novel differentially private identity (goodness-of-fit) testers for natural and widely studied classes of multivariate product distributions: Gaussians in Rd\mathbb{R}^d with known covariance and product distributions over {±1}d\{\pm 1\}^{d}. Our testers have improved sample complexity compared to those derived from previous techniques, and are the first testers whose sample complexity matches the order-optimal minimax sample complexity of O(d1/2/α2)O(d^{1/2}/\alpha^2) in many parameter regimes. We construct two types of testers, exhibiting tradeoffs between sample complexity and computational complexity. Finally, we provide a two-way reduction between testing a subclass of multivariate product distributions and testing univariate distributions, and thereby obtain upper and lower bounds for testing this subclass of product distributions.

Keywords

Cite

@article{arxiv.1905.11947,
  title  = {Private Identity Testing for High-Dimensional Distributions},
  author = {Clément L. Canonne and Gautam Kamath and Audra McMillan and Jonathan Ullman and Lydia Zakynthinou},
  journal= {arXiv preprint arXiv:1905.11947},
  year   = {2022}
}

Comments

Discussing a mistake in the proof of one of the algorithms (Theorem 1.2, computationally inefficient tester), and pointing to follow-up work by Narayanan (2022) who improves upon our results and fixes this mistake

R2 v1 2026-06-23T09:29:35.157Z