Locally Private k-Means in One Round

Abstract

We provide an approximation algorithm for k-means clustering in the one-round (aka non-interactive) local model of differential privacy (DP). This algorithm achieves an approximation ratio arbitrarily close to the best non private approximation algorithm, improving upon previously known algorithms that only guarantee large (constant) approximation ratios. Furthermore, this is the first constant-factor approximation algorithm for k-means that requires only one round of communication in the local DP model, positively resolving an open question of Stemmer (SODA 2020). Our algorithmic framework is quite flexible; we demonstrate this by showing that it also yields a similar near-optimal approximation algorithm in the (one-round) shuffle DP model.

35 pages. To appear in ICML'21

References in corpus (5)

• Fast Construction of Nets in Low Dimensional Metrics, and Their Applications
• A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm
• Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead
• Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message
• Differentially private $k$-means clustering via exponential mechanism and max cover