TL;DR
This paper introduces differentially private algorithms for streaming frequency moment estimation that operate continually, providing near-optimal space complexity and extending to sliding window models, ensuring privacy at every timestamp.
Contribution
It presents the first differentially private continual release algorithms for $oldsymbol{ ext{l}_p}$ frequency moments with near-optimal space complexity and extends results to sliding window models.
Findings
Achieves $(1+\eta)$-approximation with polylogarithmic additive error.
Uses space nearly optimal even without privacy constraints.
Extends techniques to sliding window data streams.
Abstract
The streaming model of computation is a popular approach for working with large-scale data. In this setting, there is a stream of items and the goal is to compute the desired quantities (usually data statistics) while making a single pass through the stream and using as little space as possible. Motivated by the importance of data privacy, we develop differentially private streaming algorithms under the continual release setting, where the union of outputs of the algorithm at every timestamp must be differentially private. Specifically, we study the fundamental frequency moment estimation problem under this setting, and give an -DP algorithm that achieves -relative approximation with additive error and uses space, where is the length…
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
Differentially Private Continual Releases of Streaming Frequency Moment Estimations· youtube
