Skip to content
nonconvexcard

Retrieval error propagates into generation

ProofGraduate⏱ 1 hourRAGerror propagationtotal variationtightnessrag

Problem

Prove that the total variation distance between the RAG output distribution and the oracle distribution is at most 1−γ1-\gamma, where γ\gamma is the probability that a sufficient document is retrieved, and show the bound is attained. Then compute the end-to-end γ\gamma for a realistic pipeline and interpret.

Write a complete argument. Every inequality you use should be one you could state precisely.

Solution

Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.

Related problems

All problems
SolvedProblemFieldTypeDifficultyTime
Markov and Chebyshev are attainedHigh-Dim ProbabilityProofFoundation15 min
When is the union bound tight?ProbabilityProofFoundation15 min
End-to-end recall arithmetic for a RAG systemRAGNumericalBeginner15 min
Tightness of the descent lemmaFoundationsProofBeginner15 min
RAG-sequence and RAG-token are different modelsRAGProofIntermediate30 min