Flash-KMeans Dropped and It Makes sklearn Look Slow

If you've ever sat there watching sklearn.cluster.KMeans churn through a large dataset while your laptop fan spins up like a jet engine, you're not alone. K-Means is one of those algorithms that feels like it should be fast — the concept is dead simple — but at scale, it eats memory and CPU time like nobody's business. A new paper just hit arXiv called Flash-KMeans, and it's getting attention on Hacker News for good reason. It proposes an exact K-Means implementation that's dramatically faster and more memory-efficient than what most of us are using today. Not an approximation. Not a different algorithm. The same K-Means, just implemented smarter. Let me break down why this matters and what you can actually do with it. Why Standard K-Means Is Wasteful The classic Lloyd's algorithm for K-Means does three things every iteration: Compute distances from every point to every centroid Assign each point to its nearest centroid Recompute centroids as the mean of assigned points Step 1 is where