Differentially Private $L_2$-Heavy Hitters in the Sliding Window Model
Jeremiah Blocki, Seunghoon Lee, Tamalika Mukherjee, Samson Zhou

TL;DR
This paper introduces the first differentially private algorithm for identifying $L_2$-heavy hitters in the sliding window model, addressing challenges posed by sub-additivity and high sensitivity in streaming data.
Contribution
It presents novel techniques for privately releasing $L_2$-heavy hitters in the sliding window model using smooth sensitivity and frequency tracking, overcoming limitations of existing methods.
Findings
First differentially private algorithm for $L_2$-heavy hitters in sliding window
Uses smooth sensitivity to add noise proportional to $L_2$ norm
Achieves high accuracy with low space complexity
Abstract
The data management of large companies often prioritize more recent data, as a source of higher accuracy prediction than outdated data. For example, the Facebook data policy retains user search histories for months while the Google data retention policy states that browser information may be stored for up to months. These policies are captured by the sliding window model, in which only the most recent statistics form the underlying dataset. In this paper, we consider the problem of privately releasing the -heavy hitters in the sliding window model, which include -heavy hitters for and in some sense are the strongest possible guarantees that can be achieved using polylogarithmic space, but cannot be handled by existing techniques due to the sub-additivity of the norm. Moreover, existing non-private sliding window algorithms use the smooth histogram…
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
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security · Complexity and Algorithms in Graphs
