E-means: Outperforming k-means in one-tenth the epochs
70 comments
- Points370
- Comments32
70 comments
Story details from Hacker News ↗ · linked article on e-means.github.io.
E-means: Outperforming k-means in one-tenth the epochs was first seen on Hacker News · Front page on Nov 9, 2026. Since then it has appeared in 88 checks on 2 different days. Its best position was #5 of 30, reached on Nov 10, 13:24 UTC. It is #6 right now, holding steady at #6 over the last 6 checks.
Position on Hacker News · Front page at every check (lower is better).
Best rank per day (UTC).
points as reported by Hacker News.
A few top-level comments from Hacker News, shortened. Read the full thread on Hacker News.
I wonder if this could be used anywhere as an alternative to Lloyd's algorithm. I have a hobby project which uses Lloyd's to "relax" an icosohedral equal area mesh on the surface of a sphere [1]. I'm going to try to swap it out with an adaptation of this and see if it's much better or if I can afford more iterations…
I adapted the method to my IVF index (the code-daemon project) and achieved a 146x speedup on the GPU. That's impressive!
As far as I can tell this isn't particularly new, people have been doing minibatch k-means for a while, including with an EWA update. I assume the contribution here is that they tried to measure how much better it is and provided code? I'm not sure I agree with their claims though, because they didn't really measure…
Archived daily, weekly and monthly lists that include this entry.
Yes. As of Nov 10, 17:24 UTC it is #6, holding steady at #6 over the last 6 checks.
#5 on Hacker News · Front page, on Nov 10, 13:24 UTC. Trendoday checks this list every 15 minutes.
It was first seen on Nov 9, 2026 and has been on the list on 2 days (88 checks) since.
370 points and 32 comments; submitted by porridgeraisin on Nov 9, 2026.