$$P(\text{correct}) = P\left(\mathcal{Z}_k(x) \cap S(x) \neq \emptyset\right) \cdot P\left(\text{grounded} \mid \mathcal{Z}_k(x) \cap S(x) \neq \emptyset\right)$$

Equation 20 · AI Agents & Systems

Retrieval Is an Evidence System, Not a Memory

This equation states an equality: the expressions on both sides have the same value under the article’s assumptions.

Because retrieval and generation are separable, an end-to-end score is nearly uninformative about which one broke. Decompose it. Let $\mathcal{Z}_k(x)$ be the retrieved set and S(x) the set of spans that would suffice to answer x : $P(\text{correct}) = P\left(\mathcal{Z}_k(x) \cap S(x) \neq \emptyset\right) \cdot P\left(\text{grounded} \mid \mathcal{Z}_k(x) \cap S(x) \neq \emptyset\right)$. The first factor is a pure retrieval quantity: recall at k , measurable against relevance judgements with no generator involved, using the established information-retrieval apparatus that BEIR standardised [ 6 ] . The second is a pure generation quantity: given that sufficient evidence was present, did the model use it faithfully? Es and colleagues built RAGAS to score exactly this separation — retrieval effectiveness, the faithfulness with…

Equation guide → · Article →