Harsh Wardhan

Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs

Graph-based data structures have become powerful and ubiquitous tools for scalable approximate nearest-neighbor (ANN) search over the past decade. In spite of their apparent practical performance, there has only recently been progress on the **worst-case** performance of these data structures. Indee…