RARE: Retrieval-Aware Robustness Evaluation for Retrieval-Augmented Generation Systems

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Zeng, Yixiao, Cao, Tianyu, Wang, Danqing, Zhao, Xinran, Qiu, Zimeng, Ziyadi, Morteza, Wu, Tongshuang, Li, Lei
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866912673236516864
author Zeng, Yixiao
Cao, Tianyu
Wang, Danqing
Zhao, Xinran
Qiu, Zimeng
Ziyadi, Morteza
Wu, Tongshuang
Li, Lei
author_facet Zeng, Yixiao
Cao, Tianyu
Wang, Danqing
Zhao, Xinran
Qiu, Zimeng
Ziyadi, Morteza
Wu, Tongshuang
Li, Lei
contents Retrieval-Augmented Generation (RAG) enhances recency and factuality in answers. However, existing evaluations rarely test how well these systems cope with real-world noise, conflicting between internal and external retrieved contexts, or fast-changing facts. We introduce Retrieval-Aware Robustness Evaluation (RARE), a unified framework and large-scale benchmark that jointly stress-tests query and document perturbations over dynamic, time-sensitive corpora. One of the central features of RARE is a knowledge-graph-driven synthesis pipeline (RARE-Get) that automatically extracts single and multi-hop relations from the customized corpus and generates multi-level question sets without manual intervention. Leveraging this pipeline, we construct a dataset (RARE-Set) spanning 527 expert-level time-sensitive finance, economics, and policy documents and 48295 questions whose distribution evolves as the underlying sources change. To quantify resilience, we formalize retrieval-conditioned robustness metrics (RARE-Met) that capture a model's ability to remain correct or recover when queries, documents, or real-world retrieval results are systematically altered. Our findings reveal that RAG systems are unexpectedly sensitive to perturbations. Moreover, they consistently demonstrate lower robustness on multi-hop queries compared to single-hop queries across all domains.
format Preprint
id arxiv_https___arxiv_org_abs_2506_00789
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle RARE: Retrieval-Aware Robustness Evaluation for Retrieval-Augmented Generation Systems
Zeng, Yixiao
Cao, Tianyu
Wang, Danqing
Zhao, Xinran
Qiu, Zimeng
Ziyadi, Morteza
Wu, Tongshuang
Li, Lei
Computation and Language
Retrieval-Augmented Generation (RAG) enhances recency and factuality in answers. However, existing evaluations rarely test how well these systems cope with real-world noise, conflicting between internal and external retrieved contexts, or fast-changing facts. We introduce Retrieval-Aware Robustness Evaluation (RARE), a unified framework and large-scale benchmark that jointly stress-tests query and document perturbations over dynamic, time-sensitive corpora. One of the central features of RARE is a knowledge-graph-driven synthesis pipeline (RARE-Get) that automatically extracts single and multi-hop relations from the customized corpus and generates multi-level question sets without manual intervention. Leveraging this pipeline, we construct a dataset (RARE-Set) spanning 527 expert-level time-sensitive finance, economics, and policy documents and 48295 questions whose distribution evolves as the underlying sources change. To quantify resilience, we formalize retrieval-conditioned robustness metrics (RARE-Met) that capture a model's ability to remain correct or recover when queries, documents, or real-world retrieval results are systematically altered. Our findings reveal that RAG systems are unexpectedly sensitive to perturbations. Moreover, they consistently demonstrate lower robustness on multi-hop queries compared to single-hop queries across all domains.
title RARE: Retrieval-Aware Robustness Evaluation for Retrieval-Augmented Generation Systems
topic Computation and Language
url https://arxiv.org/abs/2506.00789