Meta FAIR Releases e-means: Clustering Algorithm That Beats k-means in 10x Fewer Epochs

Meta FAIR has open-sourced e-means, a new clustering algorithm that achieves better results than the widely used k-means algorithm while converging in roughly one-tenth the number of epochs. The algorithm is integrated with FAISS, Meta's widely adopted library for efficient similarity search and clustering of dense vectors — meaning developers can drop it into existing pipelines with minimal friction. For teams doing large-scale embedding clustering, vector quantization, or unsupervised representation learning, this offers a potentially significant speedup and quality improvement with no major infrastructure changes required. The open-source release lowers the barrier to adoption, making this accessible to any team already using FAISS. This is a practical, immediately usable improvement for ML engineers working in retrieval, recommendations, or data organization at scale.