pith. sign in

arxiv: 2310.11005 · v1 · pith:5HVZD6A2new · submitted 2023-10-17 · 💻 cs.IT · cs.CR· math.IT

Optimal Private Discrete Distribution Estimation with One-bit Communication

classification 💻 cs.IT cs.CRmath.IT
keywords communicationconstraintone-bitprivacydiscretedistributionestimationconstraints
0
0 comments X
read the original abstract

We consider a private discrete distribution estimation problem with one-bit communication constraint. The privacy constraints are imposed with respect to the local differential privacy and the maximal leakage. The estimation error is quantified by the worst-case mean squared error. We completely characterize the first-order asymptotics of this privacy-utility trade-off under the one-bit communication constraint for both types of privacy constraints by using ideas from local asymptotic normality and the resolution of a block design mechanism. These results demonstrate the optimal dependence of the privacy-utility trade-off under the one-bit communication constraint in terms of the parameters of the privacy constraint and the size of the alphabet of the discrete distribution.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Lossy Compression for Sparse Aggregation

    cs.IT 2026-06 unverdicted novelty 6.0

    A covering-plus-sketching scheme plus f-divergence lower bound characterizes the communication-accuracy tradeoff for sparse aggregation, tight on binary alphabets but with a gap on general alphabets.