Preprint
Aug 2026
Learning Nearest-Neighbor Maps from Adaptive Queries
This work generalizes previous work and proves the tight worst-case query complexity bound of $\Theta(n\kappa)$, where $\kappa$ is the kissing number of the underlying norm.
Hadley Black, Geelon So
· 0 citations