Pith. sign in

REVIEW

Optimal Private Discrete Distribution Estimation with One-bit Communication

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.11005 v1 pith:5HVZD6A2 submitted 2023-10-17 cs.IT cs.CRmath.IT

classification cs.ITcs.CRmath.IT
keywords communicationconstraintone-bitprivacydiscretedistributionestimationconstraints
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools