DP-SIPS: A simpler, more scalable mechanism for differentially private partition selection
Marika Swanberg, Damien Desfontaines, Samuel Haney

TL;DR
DP-SIPS is a simple, scalable differentially private partition selection mechanism that iteratively improves utility by adjusting privacy budgets, outperforming more complex prior methods.
Contribution
Introduces DP-SIPS, a novel, simple iterative mechanism for differentially private partition selection that balances scalability and utility.
Findings
Preserves scalability of naive methods.
Offers utility comparable to complex approaches.
Enhances privacy-utility trade-off in partition selection.
Abstract
Partition selection, or set union, is an important primitive in differentially private mechanism design: in a database where each user contributes a list of items, the goal is to publish as many of these items as possible under differential privacy. In this work, we present a novel mechanism for differentially private partition selection. This mechanism, which we call DP-SIPS, is very simple: it consists of iterating the naive algorithm over the data set multiple times, removing the released partitions from the data set while increasing the privacy budget at each step. This approach preserves the scalability benefits of the naive mechanism, yet its utility compares favorably to more complex approaches developed in prior work.
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.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security · Data Management and Algorithms
