This article explores the technical challenges and unexpected interactions encountered while tuning Approximate Nearest Neighbor (ANN) indexing for a massive 100 million document retrieval system.
The authors detail how instruction-aware query embeddings corrected significant biases toward short documents and analyze the relationship between graph connectivity, search depth, and latency. They also demonstrate how quantization sets an absolute ceiling on recall that cannot be overcome by index tuning alone.
The authors detail how instruction-aware query embeddings corrected significant biases toward short documents and analyze the relationship between graph connectivity, search depth, and latency. They also demonstrate how quantization sets an absolute ceiling on recall that cannot be overcome by index tuning alone.
