Equation 37 · Naive, Graph, and Agentic: A Systems Comparison of RAG Architectures
What does this equation mean?
Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.
This equation states an equality: the expressions on both sides have the same value under the article’s assumptions. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.
Read it piece by piece
Symbol k
k is part of the quantity the equation computes from the expression on the right.
=
The expressions on both sides represent the same quantity under the stated assumptions.
See an illustrated explanation →How to interpret it
Read it with the definitions, units, and assumptions supplied by the article.
What the article says around this equation
For naive and hybrid RAG, k = 1 by construction — the sum has exactly one term, and total latency is boundable in advance for any query. For iterative RAG, k is a small integer set by a heuristic or a step cap chosen by the system builder, so the worst case is known even though the typical case varies with question difficulty. For agentic RAG, k is a random variable generated by the policy itself at run time, and its distribution is exactly what the operator does not control without adding an external cap. The same formula describes all five families; what changes is only where k comes from, and that difference is the whole of the engineering distinction between “a pipeline with a loop in…
Read the full surrounding passage
For naive and hybrid RAG, k = 1 by construction — the sum has exactly one term, and total latency is boundable in advance for any query. For iterative RAG, k is a small integer set by a heuristic or a step cap chosen by the system builder, so the worst case is known even though the typical case varies with question difficulty. For agentic RAG, k is a random variable generated by the policy itself at run time, and its distribution is exactly what the operator does not control without adding an external cap. The same formula describes all five families; what changes is only where k comes from, and that difference is the whole of the engineering distinction between “a pipeline with a loop in it” and “a policy that decides how much to loop.”
Sources cited in the article section
- [7] Interleaving Retrieval with Chain-of-Thought Reasoning for Knowledge-Intensive Multi-Step Questions ↗
- [4] From Local to Global: A Graph RAG Approach to Query-Focused Summarization ↗
- [9] Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflection ↗
These citations give research context. Read each source to check which claims it supports.
Return to Naive, Graph, and Agentic: A Systems Comparison of RAG Architectures