Jiaming Liang

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

Oracle-based Uniform Sampling from Convex Bodies

Thanh Dang, Jiaming Liang

We propose new Markov chain Monte Carlo algorithms to sample a uniform distribution on a convex body $K$ . Our algorithms are based on the proximal sampler, which uses Gibbs samplin…

cs.DS2026

Prune, Don't Rebuild: Efficiently Tuning $I^\pm$ -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…

Oracle-based Uniform Sampling from Convex Bodies

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

Prune, Don't Rebuild: Efficiently Tuning $I^\pm$ -Reachable Graphs for Nearest Neighbor Search