E-means: 10x faster k-means at equal loss

Re:E-means: 10x faster k-means at equal loss by benjiro29 on Monday November 09, 2026 @07:35PM (#50434522)

Faster vector calculations. What help for example, helps with ivfflat or prism index building. It cut CPU (or GPU) usage, and time needed to build. Seen index build times drop by 50 to 80%, and at the same time CPU usage drop by 50%.

Impressive results ...

[ Parent | on HN ]

Re:E-means: 10x faster k-means at equal loss by akoboldfrying on Monday November 09, 2026 @11:14PM (#50435984)

I found this unhelpful, sorry. "Faster vector calculations" sounds like a faster way to add or multiply vectors, which TTBOMK k-means doesn't help with at all. There are hundreds of types of things called an "index"; I'm familiar with ordinary RDBMS indices but haven't heard of ivfflat or prism indices. Gemini tells me PostgreSQL uses them to support approximate nearest neighbour queries on geometric data -- e.g., finding the nearest train station to your current position.

[ Parent | on HN ]

Re:E-means: 10x faster k-means at equal loss by benjiro29 on Tuesday November 10, 2026 @08:05AM (#50439756)

Well, thanks for the downvote.

[ Parent | on HN ]

Re:E-means: 10x faster k-means at equal loss by akoboldfrying on Tuesday November 10, 2026 @07:24PM (#50448246)

FWIW I didn't actually downvote, I just complained.

[ Parent | on HN ]