Differentially Private Set Union

by   Sivakanth Gopi, et al.

We study the basic operation of set union in the global model of differential privacy. In this problem, we are given a universe U of items, possibly of infinite size, and a database D of users. Each user i contributes a subset W_i ⊆ U of items. We want an (ϵ,δ)-differentially private algorithm which outputs a subset S ⊂∪_i W_i such that the size of S is as large as possible. The problem arises in countless real world applications; it is particularly ubiquitous in natural language processing (NLP) applications as vocabulary extraction. For example, discovering words, sentences, n-grams etc., from private text data belonging to users is an instance of the set union problem. Known algorithms for this problem proceed by collecting a subset of items from each user, taking the union of such subsets, and disclosing the items whose noisy counts fall above a certain threshold. Crucially, in the above process, the contribution of each individual user is always independent of the items held by other users, resulting in a wasteful aggregation process, where some item counts happen to be way above the threshold. We deviate from the above paradigm by allowing users to contribute their items in a dependent fashion, guided by a policy. In this new setting ensuring privacy is significantly delicate. We prove that any policy which has certain contractive properties would result in a differentially private algorithm. We design two new algorithms, one using Laplace noise and other Gaussian noise, as specific instances of policies satisfying the contractive properties. Our experiments show that the new algorithms significantly outperform previously known mechanisms for the problem.


page 1

page 2

page 3

page 4


Differentially Private n-gram Extraction

We revisit the problem of n-gram extraction in the differential privacy ...

DP-SIPS: A simpler, more scalable mechanism for differentially private partition selection

Partition selection, or set union, is an important primitive in differen...

Differentially private partition selection

Many data analysis operations can be expressed as a GROUP BY query on an...

Oneshot Differentially Private Top-k Selection

Being able to efficiently and accurately select the top-k elements witho...

Differentially Private Matrix Completion, Revisited

We study the problem of privacy-preserving collaborative filtering where...

A Latent Class Modeling Approach for Generating Synthetic Data and Making Posterior Inferences from Differentially Private Counts

Several algorithms exist for creating differentially private counts from...

Learning discrete distributions: user vs item-level privacy

Much of the literature on differential privacy focuses on item-level pri...

Please sign up or login with your details

Forgot password? Click here to reset