[edit]

# Simple and sharp analysis of k-means||

*Proceedings of the 37th International Conference on Machine Learning*, PMLR 119:8266-8275, 2020.

#### Abstract

We present a simple analysis of k-means|| (Bahmani et al., PVLDB 2012) - a distributed variant of the k-means++ algorithm (Arthur and Vassilvitskii, SODA 2007). Moreover, the bound on the number of rounds is improved from $O(\log n)$ to $O(\log n / \log\log n)$, which we show to be tight.