Saved in:
Bibliographic Details
Main Authors: Wang, Zikai, Zhang, Qianxi, Lu, Baotong, Chen, Qi, Tan, Cheng
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2507.00379
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914438257311744
author Wang, Zikai
Zhang, Qianxi
Lu, Baotong
Chen, Qi
Tan, Cheng
author_facet Wang, Zikai
Zhang, Qianxi
Lu, Baotong
Chen, Qi
Tan, Cheng
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2507_00379
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Towards Robustness: A Critique of Current Vector Database Assessments
Wang, Zikai
Zhang, Qianxi
Lu, Baotong
Chen, Qi
Tan, Cheng
Databases
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.
title Towards Robustness: A Critique of Current Vector Database Assessments
topic Databases
url https://arxiv.org/abs/2507.00379