{"slug": "e-means-outperforming-k-means-in-one-tenth-the-epochs", "title": "e-means: outperforming k-means (in one-tenth the epochs)", "summary": "A paper introducing e-means, an exponential moving average optimization procedure for k-means with mini-batch updates built on modern deep learning machinery, reports that it outperforms Lloyd's k-means algorithm in one-tenth the epochs. Lloyd's k-means has long been a standard for clustering used in data analysis, retrieval, quantization and data curation. The paper positions e-means as a faster-converging alternative for those clustering workloads.", "body_md": "Lloyd's k-means algorithm is a long-running standard for clustering, with applications in data analysis, retrieval, quantization and data curation. In this paper, we introduce an exponential moving average optimization procedure for k-means with mini-batch updates, powered by modern deep learning ma", "url": "https://wpnews.pro/news/e-means-outperforming-k-means-in-one-tenth-the-epochs", "canonical_source": "https://aiflash.com/news/149487/", "published_at": "2026-11-10 21:30:08+00:00", "updated_at": "2026-11-10 21:52:08.312332+00:00", "lang": "en", "topics": ["machine-learning", "ai-research"], "entities": ["e-means", "k-means", "Lloyd's k-means algorithm"], "also_reported_by": [], "alternates": {"html": "https://wpnews.pro/news/e-means-outperforming-k-means-in-one-tenth-the-epochs", "markdown": "https://wpnews.pro/news/e-means-outperforming-k-means-in-one-tenth-the-epochs.md", "text": "https://wpnews.pro/news/e-means-outperforming-k-means-in-one-tenth-the-epochs.txt", "jsonld": "https://wpnews.pro/news/e-means-outperforming-k-means-in-one-tenth-the-epochs.jsonld"}}