Meta FAIR releases e-means, a faster k-means clustering variant in FAISS
Overview
Meta FAIR researchers release e-means, a drop-in replacement for Lloyd's k-means clustering algorithm.
According to MarkTechPost, e-means reaches the loss that Lloyd's k-means reaches in 25 epochs in 1.4 to 2.6 epochs. It uses exponential moving average updates and ships in FAISS 1.16.0 under faiss.contrib.e_means.
The authors report speedups of 10-45x on GPU and 8-15x on CPU. These figures are self-reported and come from the authors, not from independent testing.
Written by AI from the articles below · updated Nov 10, 7:06 PM ET
Check the sources:
Article timeline
The articles in this story. Times are ET.
- MarkTechPostNewsMeta FAIR releases e-means, a k-means variant that reaches Lloyd's loss in fewer epochs
AIMeta FAIR researchers released e-means, a drop-in replacement for Lloyd's k-means that reaches the loss Lloyd's k-means gets in 25 epochs in 1.4 to 2.6 epochs. It ships in FAISS 1.16.0 under faiss.contrib.e_means and uses exponential moving average updates. The authors' speedup figures of 10-45x on GPU and 8-15x on CPU are self-reported.
Heat Trend
- Current comparable heat
- 7
- Peak comparable heat
- 10Nov 10, 8:00 PM ET
- Change in past 24 hours
- –
The trend compares only continuously observed participants, so its scope may be smaller than the current heat total. Hover or tap for hourly heat; use arrow keys with a keyboard.