Why mini-batch k-means converges fast but clusters worse: the MacQueen update
thomasahle · x · 2026-11-11
In a clustering-algorithms discussion, swannbessa explains that older mini-batch k-means methods converge fast but usually yield worse clusterings than full k-means, because they rely on the MacQueen update — which their team found highly suboptimal for mini-batch updates. A useful caveat for engineers clustering at scale where speed/quality tradeoffs matter.
More from Research
- SuperMimic open-sourced at CoRL: mimics 129K motions with 1000x fewer GPU-hours than SOTA — kevin_zakka · 2026-11-11
- PolicyIK replaces numerical inverse kinematics with an RL policy, beating 4 classic IK controllers on a real robot — rsasaki0109 · 2026-11-11
- CallCleaner: a lightweight biodenoising model that runs over 90x realtime on a laptop CPU — begusgasper · 2026-11-11
- SoCalNLP 2026 symposium set for Nov 20 at USC, registration closes Nov 15 — BrihiJ · 2026-11-11
- MIT's FLEX pipeline lets robots refine task representations from natural language corrections — andreea7b · 2026-11-11
- Glen Berseth ranked all 687 CoRL 2026 papers into a prioritized 101-paper reading list — GlenBerseth · 2026-11-11