mlsanityData to 14 Oct 2026

Contraction of Locally Differentially Private Mechanisms

arXiv 2210.13386 ↗First posted 24 Oct 2022cs.IT cs.CR math.ITcited by 8

Not on the map. Why?

Abstract (arXiv)

We investigate the contraction properties of locally differentially private mechanisms. More specifically, we derive tight upper bounds on the divergence between PK and QK output distributions of an ε-LDP mechanism K in terms of a divergence between the corresponding input distributions P and Q, respectively. Our first main technical result presents a sharp upper bound on the chi2-divergence chi2(PK|QK) in terms of chi2(P|Q) and varepsilon. We also show that the same result holds for a large family of divergences, including KL-divergence and squared Hellinger distance. The second main technical result gives an upper bound on chi2(PK|QK) in terms of total variation distance mathsfTV(P, Q) and ε. We then utilize these bounds to establish locally private versions of the van Trees inequality, Le Cam's, Assouad's, and the mutual information methods, which are powerful tools for bounding minimax estimation risks. These results are shown to lead to better privacy analyses than the state-of-the-arts in several statistical problems such as entropy and discrete distribution estimation, non-parametric density estimation, and hypothesis testing.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 27 of its 82 references that are in the map. First posted on arXiv 24 Oct 2022.

Builds on

27 of 82 references.

References · 27

  1. 2018Amplification by Shuffling: From Local to Central Differential Privacy via Anonymitycited by 164
  2. 2018cpSGD: Communication-efficient and differentially-private distributed SGDcited by 158
  3. 2018Protection Against Reconstruction and Its Applications in Private Federated Learningcited by 130
  4. 2016Minimax Optimal Procedures for Locally Private Estimationcited by 107
  5. 2020Breaking the Communication-Privacy-Accuracy Trilemmacited by 68
  6. 2016Discrete Distribution Estimation under Local Privacycited by 59
  7. 2020Differentially Private Assouad, Fano, and Le Camcited by 55
  8. 2015Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequalitycited by 50
  9. 2022Optimal Algorithms for Mean Estimation under Local Differential Privacycited by 36
  10. 2018Inference under Information Constraints I: Lower Bounds from Chi-Square Contractioncited by 31
  11. 2017Optimal Schemes for Discrete Distribution Estimation under Locally Differential Privacycited by 29
  12. 2021Lossless Compression of Efficient Private Local Randomizerscited by 27
15 more
  1. 2013Local Privacy, Data Processing Inequalities, and Statistical Minimax Ratescited by 26
  2. 2018Hadamard Response: Estimating Distributions Privately, Efficiently, and with Little Communicationcited by 26
  3. 2018The Structure of Optimal Private Tests for Simple Hypothesescited by 26
  4. 2020Fisher information under local differential privacycited by 22
  5. 2020Unified lower bounds for interactive high-dimensional estimation under information constraintscited by 22
  6. 2021Optimal Compression of Locally Differentially Private Mechanismscited by 22
  7. 2021Local Differential Privacy Is Equivalent to Contraction of Eγ-Divergencecited by 17
  8. 2018Locally Private Mean Estimation: Z-test and Tight Confidence Intervalscited by 15
  9. 2019The Role of Interactivity in Local Differential Privacycited by 15
  10. 2019Local differential privacy: Elbow effect in optimal density estimation and adaptation over Besov ellipsoidscited by 13
  11. 2021Inference under Information Constraints III: Local Privacy Constraintscited by 13
  12. 2022Private Frequency Estimation via Projective Geometrycited by 9
  13. 2022The Role of Interactivity in Structured Estimationcited by 7
  14. 2018Linear Queries Estimation with Local Differential Privacycited by 5
  15. 2018INSPECTRE: Privately Estimating the Unseencited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 3; 2025: 2; 2026: 1.

8 papers.