cs.DS, cs.LG

A Faster Generalized Two-Stage Approximate Top-K

arXiv:2506.04165v3 Announce Type: replace
Abstract: We consider the Top-$K$ selection problem, which aims to identify the largest $K$ elements in an array. Top-$K$ selection arises in many machine learning algorithms and often becomes a bottleneck on …