Equation 14 · Part 9 · Naive, Graph, and Agentic: A Systems Comparison of RAG Architectures
Starting index or lower bound: r in R
What this part means
This label says where the repeated addition, multiplication, or accumulation starts. Read its value or condition together with the article’s description of the index.
Its job in the formula
r in R appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.
Full expression→Starting index or lower bound: r in R→Article meaning
The passage around this formula
The two retrievers fail in different directions, which is the entire justification for running both. Lexical retrieval, the BM25 family, scores documents by term overlap and fails on vocabulary mismatch: a query about “cannot log in” scores nothing against a document that says “authentication failure”. Dense retrieval, the family Karpukhin and colleagues established with a dual-encoder trained on question-passage pairs, embeds query and passage into a shared vector space and fails on precision, losing rare identifiers — part numbers, version strings, error codes — that carry little weight in a learned embedding but enormous discriminative value lexically; their dense retriever nonetheless…
Learn the underlying idea
Σ adds a collection of terms. Π multiplies them. The lower and upper labels tell you which terms belong to the collection.
Open the illustrated sums and products: repeat an operation over an index guide →
Sources cited in the surrounding passage
- [2] Dense Passage Retrieval for Open-Domain Question Answering ↗
- [3] Reciprocal Rank Fusion Outperforms Condorcet and Individual Rank Learning Methods ↗
These citations provide research context; check each source for the exact claim it supports.