DeepAI AI Chat
Log In Sign Up

Locally Private k-Means in One Round

by   Alisa Chang, et al.

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.


page 1

page 2

page 3

page 4


A simple 7/3-approximation algorithm for feedback vertex set in tournaments

We show that performing just one round of the Sherali-Adams hierarchy gi...

Locally Private k-Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error

Given a data set of size n in d'-dimensional Euclidean space, the k-mean...

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O( n/ ^2) Rounds

We present a deterministic distributed 2-approximation algorithm for the...

An improved approximation algorithm for ATSP

We revisit the constant-factor approximation algorithm for the asymmetri...

A constant FPT approximation algorithm for hard-capacitated k-means

Hard-capacitated k-means (HCKM) is one of the fundamental problems remai...

Differential Private Hogwild! over Distributed Local Data Sets

We consider the Hogwild! setting where clients use local SGD iterations ...

Facility Location Problem in Differential Privacy Model Revisited

In this paper we study the uncapacitated facility location problem in th...