e-means
AI overview
Sign in and the AI will write an overview from our coverage.
Headlines · 1
- e-means speeds up large-scale k-means clustering
The authors introduced e-means, a mini-batch k-means algorithm based on exponential moving averages, with scaling laws that set decay rate and batch size across problem sizes and embedding datasets. They report that e-means reaches lower loss than Lloyd k-means in 1.2–3 epochs, with 10–45× GPU wall-clock reduction against Flash-KMeans and 8–15× CPU reduction against Faiss; the code is available in Faiss's contrib directory.
Hacker News 首页(100+ 分) · 🔥 0
Experience and discussion from the community
Share my e-means experienceAsk about e-means
Nobody has shared their experience with e-means yet.