← Search

Yonatan Naamad

2 accepted papers

2026

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks

ICLR 2026poster

Approximate nearest neighbor search (ANN) is a common way to retrieve relevant search results, especially now in the context of large language models and retrieval augmented generation. One of the most widely used algorithms for ANN is based on constructing a multi-layer graph over the dataset, call…

Cited by 1SourceScholar
2023

Fast Private Kernel Density Estimation via Locality Sensitive Quantization

ICML 2023oral

We study efficient mechanisms for differentially private kernel density estimation (DP-KDE). Prior work for the Gaussian kernel described algorithms that run in time exponential in the number of dimensions $d$. This paper breaks the exponential barrier, and shows how the KDE can privately be approxi…