approximate nearest neighbor search 1graph navigability 1randomized algorithms 1space-efficient graphs 1vector databases 1
From the 1 of 2 linked papers with an AI index.
2 papers
cs.DS2026
Almost Navigable Graphs
Pratyush Avi, Christopher Musco
The paper introduces γ‑almost navigability, a relaxed graph property for approximate nearest neighbor search that enables construction of sparse, space‑efficient search graphs in n…
cs.DS2025
Query Efficient Structured Matrix Learning
Noah Amsel, Pratyush Avi, Tyler Chen +5
We study the problem of learning a structured approximation (low-rank, sparse, banded, etc.) to an unknown matrix given access to matrix-vector product (matvec) queries of the…