Erik Waingarten

activity

20162026

most citedOptimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors

48 citations · 79 across the 36 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

cs.DS2026

Learning Partition Trees for Nearest Neighbor Search

Sanjeev Khanna, Ashwin Padaki, Erik Waingarten

We study nearest neighbor search from the perspective of data-driven algorithm design: given a dataset $P \subset R^{d}$ of size $n$ and sample access to a query distributio…

cs.DS2026

Locally Approximating the Top Eigenvector of Bounded Entry Matrices

Nicolas Menand, Erik Waingarten

We provide a local computation algorithm to approximate the top eigenvector $x \in R^{n}$ of a symmetric matrix $A \in R^{n \times n}$ with entries between $- 1$ and…

cs.DS2026

Prune, Don't Rebuild: Efficiently Tuning $α$ -Reachable Graphs for Nearest Neighbor Search

Tian Zhang, Ashwin Padaki, Jiaming Liang +2

Vector similarity search is an essential primitive in modern AI and ML applications. Most vector databases adopt graph-based approximate nearest neighbor (ANN) search algorithms, s…

Learning Partition Trees for Nearest Neighbor Search

Locally Approximating the Top Eigenvector of Bounded Entry Matrices

Prune, Don't Rebuild: Efficiently Tuning α-Reachable Graphs for Nearest Neighbor Search

Prune, Don't Rebuild: Efficiently Tuning $α$ -Reachable Graphs for Nearest Neighbor Search