← 研踪 PaperTrailarXiv:2611.26609 · v1
Variants of Beam Search for DiskANN
DiskANN 中束搜索的变体
首次提交 2026-11-20 02:57
版本更新 2026-11-20 02:57
雷达观测 2026-11-20 12:52
摘要
Graph-based data structures such as DiskANN, HNSW, and NSG constitute the state of the art for large-scale approximate nearest-neighbor (ANN) search. Indyk and Xu introduced the notion of -reachable graphs, which include graphs built by DiskANN's slow-preprocessing construction, and proved that greedy search achieves an approximation factor of . Independently, Al-Jazzazi et al. proposed adaptive beam search (ABS) with a relaxation parameter , showing a approximation on navigable graphs (), where greedy search admits no guarantees. In this work, we unify and generalize these results by proving that ABS with parameter on -reachable graphs achieves an approximation of for any metric. Moreover, on sorted -reachable graphs (introduced by Gollapudi et al.) under the metric, we obtain the tighter bound . Beyond these theoretical results, we design a beam predictor using features inspired by fine-grained analysis of ABS, trained via a constrained objective that minimizes mean distance computations subject to a target recall. On three 100-million-point benchmarks, using graphs built by DiskANN's practical construction, beam predictor lowers mean query latency on SSD-resident indices at matched recall by up to relative to classical beam search (CBS). Relative to ABS, it is faster in of settings, by up to , and at most slower in the other ; at recall, its advantage over ABS grows from -- for neighbors to -- for neighbors. In memory, it needs -- fewer distance computations than CBS and -- fewer than ABS.
作者备注:22 pages, 1 figure, 9 tables
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-20 02:57 · 最新观测版本
Variants of Beam Search for DiskANN
Graph-based data structures such as DiskANN, HNSW, and NSG constitute the state of the art for large-scale approximate nearest-neighbor (ANN) search. Indyk and Xu introduced the notion of -reachable graphs, which include graphs built by DiskANN's slow-preprocessing construction, and proved that greedy search achieves an approximation factor of . Independently, Al-Jazzazi et al. proposed adaptive beam search (ABS) with a relaxation parameter , showing a approximation on navigable graphs (), where greedy search admits no guarantees. In this work, we unify and generalize these results by proving that ABS with parameter on -reachable graphs achieves an approximation of for any metric. Moreover, on sorted -reachable graphs (introduced by Gollapudi et al.) under the metric, we obtain the tighter bound . Beyond these theoretical results, we design a beam predictor using features inspired by fine-grained analysis of ABS, trained via a constrained objective that minimizes mean distance computations subject to a target recall. On three 100-million-point benchmarks, using graphs built by DiskANN's practical construction, beam predictor lowers mean query latency on SSD-resident indices at matched recall by up to relative to classical beam search (CBS). Relative to ABS, it is faster in of settings, by up to , and at most slower in the other ; at recall, its advantage over ABS grows from -- for neighbors to -- for neighbors. In memory, it needs -- fewer distance computations than CBS and -- fewer than ABS.
查看此版本解读 →查看此版本原文 ↗