← Search

Ravishankar Krishnaswamy

2 accepted papers

2025

Graph-Based Algorithms for Diverse Similarity Search

ICML 2025poster

Nearest neighbor search is a fundamental data structure problem with many applications. Although the main objective of the data structure is to quickly report data points that are closest to a given query, it has long been noted that without additional constraints the reported answers can be redunda…

Cited by 0SourcePDFScholar
2025

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

ICML 2025poster

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…

Cited by 0SourcePDFScholar