Preprint
Jul 2026
Efficient Clustering with Provable Guardrails for LLM Inference at Scale
This work proposes a two-stage algorithm that generates initial clusters with Mini-batch K-Means, then greedily selects representatives within each initial cluster -- a step equivalent to the Johnson-Chvatal heuristic for Set Cover over alpha-balls in embedding space.
Longshaokan Wang, Wai Tsang Keung, Punit Ghodasara et al.
· 0 citations