Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise
Not on the map. Why?
Abstract (arXiv)
The Sparse Vector Technique (SVT) is one of the most fundamental tools in differential privacy (DP). It works as a backbone for adaptive data analysis by answering a sequence of queries on a given dataset, and gleaning useful information in a privacy-preserving manner. Unlike the typical private query releases that directly publicize the noisy query results, SVT is less informative -- it keeps the noisy query results to itself and only reveals a binary bit for each query, indicating whether the query result surpasses a predefined threshold. To provide a rigorous DP guarantee for SVT, prior works in the literature adopt a conservative privacy analysis by assuming the direct disclosure of noisy query results as in typical private query releases. This approach, however, hinders SVT from achieving higher query accuracy due to an overestimation of the privacy risks, which further leads to an excessive noise injection using the Laplacian or Gaussian noise for perturbation. Motivated by this, we provide a new privacy analysis for SVT by considering its less informative nature. Our analysis results not only broaden the range of applicable noise types for perturbation in SVT, but also identify the exponential noise as optimal among all evaluated noises (which, however, is usually deemed non-applicable in prior works). The main challenge in applying exponential noise to SVT is mitigating the sub-optimal performance due to the bias introduced by noise distributions. To address this, we develop a utility-oriented optimal threshold correction method and an appending strategy, which enhances the performance of SVT by increasing the precision and recall, respectively. The effectiveness of our proposed methods is substantiated both theoretically and empirically, demonstrating significant improvements up to 50% across evaluated metrics.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 51 references that are in the map. First posted on arXiv 29 Jul 2024.
Builds on
21 of 51 references.
References · 21
- 2017Renyi Differential Privacycited by 643
- 2013The Composition Theorem for Differential Privacycited by 290
- 2014RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Responsecited by 262
- 2021Numerical Composition of Differential Privacycited by 174
- 2017Privacy Loss in Apple's Implementation of Differential Privacy on MacOS 10.12cited by 42
- 2019Practical Differentially Private Top-k Selection with Pay-what-you-get Compositioncited by 38
- 2016Understanding the Sparse Vector Technique for Differential Privacycited by 27
- 2016Make Up Your Mind: The Price of Online Queries in Differential Privacycited by 26
- 2020Permute-and-Flip: A new mechanism for differentially private selectioncited by 22
- 2020Adversarially Robust Streaming Algorithms via Differential Privacycited by 21
- 2021Wide Network Learning with Differential Privacycited by 17
- 2015Building a RAPPOR with the Unknown: Privacy-Preserving Learning of Associations and Data Dictionariescited by 16
9 more
- 2021Oneshot Differentially Private Top-k Selectioncited by 16
- 2021The Permute-and-Flip Mechanism is Identical to Report-Noisy-Max with Exponential Noisecited by 14
- 2014Differentially Private Algorithms for Empirical Machine Learningcited by 8
- 2020The Sparse Vector Technique, Revisitedcited by 8
- 2018Optimal Noise-Adding Mechanism in Additive Differential Privacycited by 7
- 2020Free Gap Estimates from the Exponential Mechanism, Sparse Vector, Noisy Max and Related Algorithmscited by 4
- 2023Echo of Neighbors: Privacy Amplification for Personalized Private Federated Learning with Shuffle Modelcited by 4
- 2023On Differentially Private Online Predictionscited by 3
- 2022Differentially Private Top-k Selection via Canonical Lipschitz Mechanismcited by 2
Built on by
Not cited yet.