Tian Zhang

collaborators

Showing cs.DSShow all

4 papers · 1 filter

cs.DS2026

Approximate Nearest Neighbor in Ultra-High Dimensional $ℓ_{\infty}$

Nathan White, Tian Zhang

We study the approximate nearest neighbor problem under $ℓ_{\infty}$ in the ultra-high dimensional setting where the dimension $d$ is significantly larger than the number of point…

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…

cs.DS2024

Average-Distortion Sketching

Yiqiao Bao, Anubhav Baweja, Nicolas Menand +3

We introduce average-distortion sketching for metric spaces. As in (worst-case) sketching, these algorithms compress points in a metric space while approximately recovering pairwis…

cs.DS2024

Data-Dependent LSH for the Earth Mover's Distance

Rajesh Jayaram, Erik Waingarten, Tian Zhang

We give new data-dependent locality sensitive hashing schemes (LSH) for the Earth Mover's Distance ( $EMD$ ), and as a result, improve the best approximation for nearest nei…

Approximate Nearest Neighbor in Ultra-High Dimensional ℓ∞​

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

Average-Distortion Sketching

Data-Dependent LSH for the Earth Mover's Distance

Approximate Nearest Neighbor in Ultra-High Dimensional $ℓ_{\infty}$

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