Differentially Private Quantiles with Smaller Error
Jacob Imola, Fabrizio Boninsegna, Hannah Keller, Anders Aamand, Amrita Roy Chowdhury, Rasmus Pagh

TL;DR
This paper introduces a new differentially private algorithm for approximate quantiles that achieves smaller error bounds by using continual counting techniques, especially effective when the number of quantiles is large.
Contribution
It presents a novel differentially private quantile mechanism with improved error bounds and a correlated randomization approach, also extending to $( ext{ε}, ext{δ})$-DP without the gap assumption.
Findings
Achieves lower maximum rank error compared to prior algorithms.
Performs favorably in experiments, especially with many quantiles.
Extends to $( ext{ε}, ext{δ})$-DP, relaxing previous assumptions.
Abstract
In the approximate quantiles problem, the goal is to output quantile estimates, the ranks of which are as close as possible to given quantiles . We present a mechanism for approximate quantiles that satisfies -differential privacy for a dataset of real numbers where the ratio between the distance between the closest pair of points and the size of the domain is bounded by . As long as the minimum gap between quantiles is sufficiently large, for all , the maximum rank error of our mechanism is with high probability. Previously, the best known algorithm under pure DP was due to Kaplan, Schnapp, and Stemmer~(ICML '22), who achieved a bound of $O\left(\frac{\log(\psi)\log^2(m) +…
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.
Code & Models
Videos
Taxonomy
TopicsStatistical Methods and Inference
