E-means: outperforming k-means (in one-tenth the epochs)
Comments
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Summary
Researchers at Meta's FAIR and École des Ponts present e-means, a mini-batch k-means using exponential-moving-average centroid updates, a cosine-decayed step and dead-cluster revival. Batch size and decay follow scaling laws fitted on one dataset (DEEP), so no sweep is needed. The authors report beating Lloyd's 25-epoch loss in 1.4 to 2.6 epochs, 10-45x GPU speedups, and 10 billion DINO vectors clustered into 16 million centroids in 2.5 epochs. These are the authors' own results, and the laws are less suited to low-dimensional or tiny datasets.