We propose a Neighbourhood-Aware Differential Privacy (NADP) mechanism considering the neighbourhood of a word in a pretrained static word embedding space to determine the minimal amount of noise required to guarantee a specified privacy level. We first construct a nearest neighbour graph over the words using their embeddings, and factorise it into a set of connected components (i.e. neighbourhoods). We then separately apply different levels of Gaussian noise to the words in each neighbourhood, determined by the set of words in that neighbourhood. Experiments show that our proposed NADP mechanism consistently outperforms multiple previously proposed DP mechanisms such as Laplacian, Gaussian, and Mahalanobis in multiple downstream tasks, while guaranteeing higher levels of privacy.
@article{arxiv.2309.10551,
title = {A Neighbourhood-Aware Differential Privacy Mechanism for Static Word Embeddings},
author = {Danushka Bollegala and Shuichi Otake and Tomoya Machide and Ken-ichi Kawarabayashi},
journal= {arXiv preprint arXiv:2309.10551},
year = {2023}
}