AI
New Framework Improves RAG Systems by Verifying Whether Retrieved Evidence Actually Answers Questions
A novel aggregation method treats evidence sufficiency as a whole-system property, catching gaps that single-passage scoring misses.
Researchers have developed SURE-RAG, a system designed to tackle a fundamental problem in retrieval-augmented generation (RAG): just because a retrieved passage is topically relevant doesn't mean it actually provides enough evidence to support an answer.
The Core Challenge#
Most RAG systems retrieve passages and generate answers based on them, but they rarely verify whether the evidence is genuinely sufficient to justify the response. A passage might be on-topic yet still fail to justify the claim it's meant to support—missing logical connections, containing contradictory information, or lacking crucial intermediate steps. Traditional approaches that score passages individually cannot catch these gaps, especially in multi-hop reasoning where an answer requires information spread across multiple pieces of evidence.
How SURE-RAG Works#
The framework introduces a three-way decision system: given a question, candidate answer, and retrieved evidence, it determines whether the evidence supports, refutes, or is insufficient for the answer. The key innovation lies in treating evidence sufficiency as a set-level property rather than evaluating passages in isolation.
SURE-RAG employs a shared claim-evidence verifier that generates a relation distribution for each (claim, passage) pair. These local signals are then aggregated into four interpretable feature blocks:
- Coverage: whether all necessary claims are grounded
- Relation strength: confidence in support relationships
- Uncertainty: model confidence levels
- Retrieval: signal from the search process itself
This produces both a selective decision and an auditable confidence score.
Performance Gains#
Testing on HotpotQA-RAG v3, a controlled multi-hop benchmark, SURE-RAG achieved 0.9075 Macro-F1 (calibrated)—significantly outperforming DeBERTa mean-pooling (0.6516) and a GPT-4o judge (0.7284), while matching a strong concat cross-encoder (0.8888). When operating at 30% coverage, the system reduced risk from 0.2588 to 0.1642—a 37% relative reduction—by declining to answer questions it cannot sufficiently support.

