Privacy by Postprocessing the Discrete Laplace Mechanism
Quentin Hillebrand, Jacob Imola, Rasmus Pagh, Sia Sejer

TL;DR
This paper demonstrates that the classical discrete Laplace mechanism can be post-processed to produce unbiased estimators for functions of data and replicate other mechanisms, enhancing privacy-preserving data analysis for discrete data.
Contribution
It introduces a method to post-process the discrete Laplace mechanism for unbiased estimation and distribution matching, improving privacy and utility in discrete data scenarios.
Findings
Unbiased estimators can be derived from the discrete Laplace mechanism.
The method can replicate the Laplace and Staircase mechanisms with the same privacy parameters.
Empirical results show improved accuracy in profile, entropy estimation, and federated data analysis.
Abstract
We show that an "old dog", the classical discrete Laplace (aka.~geometric) mechanism, can "perform new tricks": 1. It can be post-processed to yield a simple, unbiased estimator of any subexponential function of the original data, giving a simple, discrete, multivariate version of the recent unbiasing result for the Laplace mechanism by Calmon et al. (FORC '25). 2. It can be post-processed to output the same distribution as the Laplace mechanism or the Staircase mechanism with identical privacy parameters. Thus, the discrete Laplace mechanism is a versatile mechanism that should be preferred over the Laplace and Staircase mechanisms whenever the data is discrete (or can be made discrete while controlling -sensitivity). We show bounds on the variance of our estimator, compared to the mean square error of the biased estimator that simply evaluates the on the output…
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.
