Flash-KMeans: Fast and Memory-Efficient Exact K-Means research paper by UC Berkeley, 2026
UC Berkeley · Mar 10, 2026 · Inference and efficiency · 6 citations · 64 upvotes · unverified
What it shows
Flash-kmeans enables efficient online k-means clustering on GPUs through novel kernel-level optimizations that eliminate I/O bottlenecks and reduce atomic write contention.
UnverifiedHugging Face's summary; not yet checked by hand.
More from UC Berkeley
All 12Other inference and efficiency papers
TopicAbout this paper
- Authors
- Shuo Yang, Haocheng Xi, Yilong Zhao and 10 more
- arXiv
- 2603.09229 · PDF
- Venue
- arXiv.org
- Citations
- 6, 0 influential · Semantic Scholar
- Upvotes
- 64 · Hugging Face
- Code
- github.com/svg-project/flash-kmeans
- Lab
- UC Berkeley
Changes
| What changed | |
|---|---|
| Sep 25, 2026 | Influential citationsfirst count: 0Sep 25, 2026 |
| Sep 25, 2026 | Citationsfirst count: 6Sep 25, 2026 |
| Sep 25, 2026 | New paperFound by the weekly scan, unverifiedSep 25, 2026 |
Sources: each lab's own papers and arXiv, with citation and upvote counts from Semantic Scholar and Hugging Face. One-line summaries are for orientation, not a substitute for the paper. Logos via logo.dev; trademarks belong to their owners.