Accuracy-enhanced Sparse Vector Technique with Exponential Noise and Optimal Threshold Correction
Yuhan Liu, Sheng Wang, Yixuan Liu, Feifei Li, Hong Chen
Abstract
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 nonapplicable 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. 𝒖 𝟏 𝒖 𝟑 𝒙 𝟏 𝒙 𝟑 4.5 𝒔 𝟏𝟑 𝒔 𝟑𝟑 𝒖 𝟐 𝒙 𝟐 3.5 2 𝒔 𝟐𝟑 𝒔 𝟏𝟐 𝒔 𝟑𝟐 𝒔 𝟐𝟐 Query 𝒒(𝑫) E.g., Mean Typical private query release Perturb Lap noise Gau noise Output 𝒒 " 𝟏 (𝑫) 𝒒 𝟏 (𝑫)=3.3
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on10
- Locally Differentially Private Protocols for Frequency EstimationTianhao Wang, Jeremiah Blocki, Ninghui Li, Somesh JhaUSENIX Security 2017 · 629 citations
- Numerical Composition of Differential PrivacySivakanth Gopi, Yin Tat Lee, Lukas WutschitzNeurIPS 2021 · 259 citations
- PrivKV: Key-Value Data Collection with Local Differential PrivacyQingqing Ye, Haibo Hu, Xiaofeng Meng, Huadi ZhengS&P 2019 · 178 citations
- Adversarially Robust Streaming Algorithms via Differential PrivacyAvinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias et al.NeurIPS 2020 · 85 citations
- Permute-and-Flip: A new mechanism for differentially private selectionRyan McKenna, Daniel SheldonNeurIPS 2020 · 66 citations
Related papers
- Improving Sparse Vector Technique with Renyi Differential PrivacyYuqing Zhu, Yu-Xiang WangNeurIPS 2020 · 25 citations
- Free Gap Information from the Differentially Private Sparse Vector and Noisy Max MechanismsZeyu Ding, Yuxin Wang, Danfeng Zhang, Dan KiferVLDB 2020 · 14 citations
- Unbounded Differentially Private Quantile and Maximum EstimationDavid DurfeeNeurIPS 2023 · 14 citations
- Confidence Intervals for Private Query ProcessingDajun Sun, Wei Dong, Ke YiVLDB 2024 · 5 citations
- MVG Mechanism: Differential Privacy under Matrix-Valued QueryThee Chanyaswad, Alex Dytso, H. Vincent Poor, Prateek MittalCCS 2018 · 55 citations
