e-means: outperforming k-means in one-tenth the epochs
Read the original at www.reddit.com→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...
Original headline: "[Paper] e-means: outperforming k-means (in one-tenth the epochs)"
Coverage timeline
- Nov 12, 10:11 UTC r/LocalLLaMA lead source [Paper] e-means: outperforming k-means (in one-tenth the epochs)