Towards Robustness: A Critique of Current Vector Database Assessments
Not on the map. Why?
Abstract (arXiv)
Vector databases are critical infrastructure in AI systems, and average recall is the dominant metric for their evaluation. Both users and researchers rely on it to choose and optimize their systems. We show that relying on average recall is problematic. It hides variability across queries, allowing systems with strong mean performance to underperform significantly on hard queries. These tail cases confuse users and can lead to failure in downstream applications such as RAG. We argue that robustness consistently achieving acceptable recall across queries is crucial to vector database evaluation. We propose Robustness-δ@K, a new metric that captures the fraction of queries with recall above a threshold δ. This metric offers a deeper view of recall distribution, helps vector index selection regarding application needs, and guides the optimization of tail performance. We integrate Robustness-δ@K into existing benchmarks and evaluate mainstream vector indexes, revealing significant robustness differences. More robust vector indexes yield better application performance, even with the same average recall. We also identify design factors that influence robustness, providing guidance for improving real-world performance.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 1 Jul 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 2.
2 papers.
- 2026Semantic Recall for Vector Searchcited by 0
- 2026ANN Search: Recall What Matterscited by 0
- 2026ANN Search: Recall What Matters3 Jun 2026
- 2026Semantic Recall for Vector Search22 Apr 2026