Statistics and Data Science Seminar Series Piotr Indyk
Graph-Based Algorithms for Similarity Search: Challenges and Opportunities
This is a joint talk with CSAIL’s Theory of Computation Colloquium. Abstract: Over the last few years, graph-based approaches to nearest neighbor search have attracted renewed interest. Algorithms such as HNSW, NSG, and DiskANN have become popular tools in practice. These algorithms are highly versatile and come with efficient implementations. At the same time, their correctness,…
