Abstract
We study the problem of differentially private (DP) computation of coreset for the k-means objective. For a given input set of points, a coreset is another set of points such that the k-means objective for any candidate solution is preserved up to a multiplicative (1 ± α) factor (and some additive factor). We prove the first computational lower bounds for this problem. Specifically, assuming the existence of one-way functions, we show that no polynomial-time (ε, 1/n^ω(1))-DP algorithm can compute a coreset for k-means in the ℓ_∞-metric for some constant α > 0 (and some constant additive factor), even for k=3. For k-means in the Euclidean metric, we show a similar result but only for α = Θ(1/d²), where d is the dimension.