Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means

07/14/2018
by   Zachary Friggstad, et al.
0

We investigate the complexity of solving stable or perturbation-resilient instances of k-Means and k-Median clustering in fixed dimension Euclidean metrics (or more generally doubling metrics). The notion of stable or perturbation resilient instances was introduced by Bilu and Linial [2010] and Awasthi et al. [2012]. In our context we say a k-Means instance is α-stable if there is a unique OPT solution which remains unchanged if distances are (non-uniformly) stretched by a factor of at most α. Stable clustering instances have been studied to explain why heuristics such as Lloyd's algorithm perform well in practice. In this work we show that for any fixed ϵ>0, (1+ϵ)-stable instances of k-Means in doubling metrics can be solved in polynomial time. More precisely we show a natural multiswap local search algorithm in fact finds the OPT solution for (1+ϵ)-stable instances of k-Means and k-Median in a polynomial number of iterations. We complement this result by showing that under a plausible PCP hypothesis this is essentially tight: that when the dimension d is part of the input, there is a fixed ϵ_0>0 s.t. there is not even a PTAS for (1+ϵ_0)-stable k-Means in R^d unless NP=RP. To do this, we consider a robust property of CSPs; call an instance stable if there is a unique optimum solution x^* and for any other solution x', the number of unsatisfied clauses is proportional to the Hamming distance between x^* and x'. Dinur et al. have already shown stable QSAT is hard to approximate for some constant Q, our hypothesis is simply that stable QSAT with bounded variable occurrence is also hard. Given this hypothesis, we consider "stability-preserving" reductions to prove our hardness for stable k-Means. Such reductions seem to be more fragile than standard L-reductions and may be of further use to demonstrate other stable optimization problems are hard.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2017

Clustering Stable Instances of Euclidean k-means

The Euclidean k-means problem is arguably the most widely-studied cluste...
research
09/30/2020

Clustering under Perturbation Stability in Near-Linear Time

We consider the problem of center-based clustering in low-dimensional Eu...
research
06/29/2018

Definable Inapproximability: New Challenges for Duplicator

We consider the hardness of approximation of optimization problems from ...
research
03/29/2016

Local Search Yields a PTAS for k-Means in Doubling Metrics

The most well known and ubiquitous clustering problem encountered in nea...
research
06/11/2018

Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations

We consider clustering in the perturbation resilience model that has bee...
research
11/21/2021

Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics

K-median and k-means are the two most popular objectives for clustering ...
research
10/21/2020

A Note on the Approximability of Deepest-Descent Circuit Steps

Linear programs (LPs) can be solved through a polynomial number of so-ca...

Please sign up or login with your details

Forgot password? Click here to reset