Ashwin Padaki

activity

20232026

collaborators

Showing 2026 · cs.DSShow all

3 papers · 2 filters

cs.DS2026

Attention via Black-Box Vector Search

Stepan Zharkov, Krish Singal, Ashwin Padaki +1

Sparse attention mechanisms estimate attention over $n$ tokens using a small subset of keys. Many existing approaches use maximum inner product search (MIPS) to retrieve the heavie…

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

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…

Attention via Black-Box Vector Search

Learning Partition Trees for Nearest Neighbor Search

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

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