mlsanityData to 7 Oct 2026

Differentially Private Approximate Quantiles

arXiv 2110.05429 ↗First posted 11 Oct 2021cs.LG cs.CR cs.DScited by 11

Not on the map. Why?

Abstract (arXiv)

In this work we study the problem of differentially private (DP) quantiles, in which given dataset X and quantiles q1, ..., qm ∈ [0,1], we want to output m quantile estimations which are as close as possible to the true quantiles and preserve DP. We describe a simple recursive DP algorithm, which we call ApproximateQuantiles (AQ), for this task. We give a worst case upper bound on its error, and show that its error is much lower than of previous implementations on several different datasets. Furthermore, it gets this low error while running time two orders of magnitude faster that the best previous implementation.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 5 of its 19 references that are in the map. First posted on arXiv 11 Oct 2021.

Builds on

5 of 19 references.

References · 5

  1. 2016Concentrated Differential Privacy: Simplifications, Extensions, and Lower Boundscited by 339
  2. 2014Private Learning and Sanitization: Pure vs. Approximate Differential Privacycited by 62
  3. 2015Differentially Private Release and Learning of Threshold Functionscited by 58
  4. 2019Privately Learning Thresholds: Closing the Exponential Gapcited by 30
  5. 2021Differentially Private Quantilescited by 22

Built on by

Cited by year (2026 to 7 Oct)

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

11 papers.