Counterexamples show e-means clustering can lose unboundedly to k-means
RexDouglass · x · 2026-11-18
An arXiv paper, "Two Counterexamples for e-means," challenges the e-means clustering algorithm (Bessa et al., 2026), which combines exponential averaging with cluster revival. The author constructs two counterexamples where, starting from identical initial centers, following the published recipe yields a higher final loss than standard k-means (Lloyd, 1982). The paper further shows that mass-based revival can destroy a global optimum, and the ratio of expected losses can be unbounded even with k-means++ seeding.
More from Research
- Voyager 1 Reaches One Light-Day From Earth, Signals Now Take 24 Hours — snowclipsed · 2026-11-18
- TCS Hiring Statement Urges Quality Over Quantity as AI Fuels Paper Arms Race — fortnow · 2026-11-18
- New paper: a sociocultural approach to linguistic creativity — abenitezburraco · 2026-11-18
- 27B Model Rewrites Its Own Weights Without Training or Gradients, Paper Claims — udmrzn · 2026-11-18
- From 'impossible' to a working Bluetooth beacon: open-source EDA chip design is real — IgorCarron · 2026-11-18
- AURA 2.0: a streaming video LLM that speaks first, calls tools, and grounds visually — Shuhan Li · 2026-11-18