Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private
Jakub T\v{e}tek

TL;DR
This paper introduces a general method to make Monte-Carlo randomized approximation algorithms differentially private, especially useful in large-scale data settings where exact computation is infeasible, by leveraging additive noise mechanisms.
Contribution
It presents a novel approach to ensure differential privacy for randomized approximation algorithms with concentrated error distributions, applicable in streaming and sublinear-time contexts.
Findings
Applicable to algorithms with concentrated error and small sensitivity
Achieves differential privacy with minimal impact on complexity and accuracy
Extends privacy guarantees to large-scale, approximate data analysis scenarios
Abstract
The exponential increase in the amount of available data makes taking advantage of them without violating users' privacy one of the fundamental problems of computer science. This question has been investigated thoroughly under the framework of differential privacy. However, most of the literature has not focused on settings where the amount of data is so large that we are not even able to compute the exact answer in the non-private setting (such as in the streaming setting, sublinear-time setting, etc.). This can often make the use of differential privacy unfeasible in practice. In this paper, we show a general approach for making Monte-Carlo randomized approximation algorithms differentially private. We only need to assume the error of the approximation algorithm is sufficiently concentrated around (e.g.\ is bounded) and that the function being approximated…
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.
