Equation 11 · Retrieval Is an Evidence System, Not a Memory
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 d
d occurs below the fraction bar. The quantity above the bar is divided by this expression; zero is excluded as a denominator.
Symbol r
r occurs below the fraction bar. The quantity above the bar is divided by this expression; zero is excluded as a denominator.
Symbol R
R appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.
=
The expressions on both sides represent the same quantity under the stated assumptions.
See an illustrated explanation →subscript
The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.
Starting index or lower bound: r in R
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.
Denominator: k + r(d)
The complete quantity below the fraction bar; it must be nonzero for this division.
How to interpret it
With a fixed numerator, increasing a nonzero denominator reduces the fraction. Read it with the definitions, units, and assumptions supplied by the article.
What the article says around this equation
Hybrid wins because the failures are close to independent. The simplest fusion, reciprocal rank fusion, ignores scores entirely and combines rank positions across retrievers R with a smoothing constant k : . Cormack and colleagues introduced it and showed it consistently beat both the individual systems and Condorcet fusion [ 7 ] . Its virtue is that it needs no score normalisation, which matters because a BM25 score and a cosine similarity are not commensurable quantities. Its cost is that it discards score magnitude. Bruch and colleagues analysed fusion functions directly and found convex combination of normalised scores outperformed reciprocal rank fusion both in-domain…
Read the full surrounding passage
Hybrid wins because the failures are close to independent. The simplest fusion, reciprocal rank fusion, ignores scores entirely and combines rank positions across retrievers R with a smoothing constant k : . Cormack and colleagues introduced it and showed it consistently beat both the individual systems and Condorcet fusion [ 7 ] . Its virtue is that it needs no score normalisation, which matters because a BM25 score and a cosine similarity are not commensurable quantities. Its cost is that it discards score magnitude. Bruch and colleagues analysed fusion functions directly and found convex combination of normalised scores outperformed reciprocal rank fusion both in-domain and out-of-domain, and — contrary to the folklore — that reciprocal rank fusion is in fact sensitive to its parameter [ 8 ] . The practical reading: hybrid is not optional, and the fusion function is a tuned component rather than a default to be copied from a tutorial.
Sources cited in the surrounding passage
- [7] Reciprocal Rank Fusion Outperforms Condorcet and Individual Rank Learning Methods ↗
- [8] An Analysis of Fusion Functions for Hybrid Retrieval ↗
These citations give research context. Read each source to check which claims it supports.
Return to Retrieval Is an Evidence System, Not a Memory