A distance-based stopping rule for beam search in graph-based ANN is proven to give exact or approximate nearest neighbors on navigable graphs and beats fixed-width beam search in experiments.
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions.Commun
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IR 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
A distance-based stopping rule for beam search in graph-based ANN is proven to give exact or approximate nearest neighbors on navigable graphs and beats fixed-width beam search in experiments.