Center-based Clustering under Perturbation Stability
Pranjal Awasthi, Avrim Blum, Or Sheffet

TL;DR
This paper proves that for center-based clustering objectives like k-median, k-means, and k-center, instances stable to small perturbations can be efficiently clustered to find the optimal solution, extending previous conjectures.
Contribution
It confirms the conjecture that stable instances under small perturbations are efficiently solvable for center-based clustering objectives, providing algorithms and hardness results.
Findings
Efficiently finds optimal clustering for stable instances with factor-3 perturbations in metric spaces without Steiner points.
Uses Single-Linkage plus dynamic programming to achieve optimal clustering.
Shows NP-hardness under weaker stability conditions.
Abstract
Clustering under most popular objective functions is NP-hard, even to approximate well, and so unlikely to be efficiently solvable in the worst case. Recently, Bilu and Linial \cite{Bilu09} suggested an approach aimed at bypassing this computational barrier by using properties of instances one might hope to hold in practice. In particular, they argue that instances in practice should be stable to small perturbations in the metric space and give an efficient algorithm for clustering instances of the Max-Cut problem that are stable to perturbations of size . In addition, they conjecture that instances stable to as little as O(1) perturbations should be solvable in polynomial time. In this paper we prove that this conjecture is true for any center-based clustering objective (such as -median, -means, and -center). Specifically, we show we can efficiently find the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
