e-means reaches the same clustering loss in one-tenth the epochs
Meta FAIR’s e-means gives teams a faster replacement for k-means: the Faiss implementation can reach the same loss in about one-tenth the epochs, with roughly 10× lower epoch and wall-clock time and no extra hyperparameters. It swaps Lloyd’s updates for a mini-batch rule built on exponential moving averages, then returns centroids and labels through a train call. CPU users need faiss-cpu; GPU users can run Triton or CuTe backends through PyTorch.