Flash-KMeans: Fast and Memory-Efficient Exact K-Means
51 points
3 days ago
| 2 comments
| arxiv.org
| HN
wood_spirit
59 minutes ago
[-]
Does this have corresponding speed ups or memory gains for normal CPUs too? Just thinking about all the cups of coffee that have been made and drunk while scikit-learn kmeans chugs through a notebook :)
reply
snovv_crash
30 minutes ago
[-]
For CPU with bigger K you would put the centroids in a search tree, so take advantage of the sparsity, while a GPU would calculate the full NxK distance matrix. So from my understanding the bottleneck they are fixing doesn't show up on CPU.
reply
xavxav
8 minutes ago
[-]
search trees tend not to scale well to higher dimensions though, right?

from what I've seen I had the impression that Yinyang k-means was the best way to take advantage of the sparsity.

reply
matrix2596
1 hour ago
[-]
looks like flash attention concepts applied to kmeans, nice speedup results
reply