Vāmana
PulseAugur coverage of Vāmana — every cluster mentioning Vāmana across labs, papers, and developer communities, ranked by signal.
1 day(s) with sentiment data
-
New PiPNN methods drastically speed up ANNS index and k-NN graph construction
Researchers have developed PiPNN II and GPiPNN, significantly accelerating the construction of Approximate Nearest Neighbor Search (ANNS) indexes. PiPNN II achieves up to an 8x speedup on CPUs, while the GPU-implemented…
-
New research analyzes low-bit quantization impact on vector search decisions
A new research paper explores the effectiveness of low-bit quantization in vector search, focusing on how it impacts the decisions made by ranking and graph-pruning algorithms. The study introduces a distribution-free d…
-
New research reveals Sublinear Power Law in vector search scalability
A new paper published on arXiv introduces the "Sublinear Power Law" to describe the scalability of graph-based vector search. Researchers found that search cost grows as N^c (where c is less than 1) when dataset size (N…
-
New method improves graph ANN index repair under churn
Researchers have developed a new method for repairing graph approximate-nearest-neighbor (ANN) indexes, which are prone to losing recall accuracy due to deletions. The proposed approach triggers local edge repairs based…