Equation 11 · Part 9 · Retrieval Is an Evidence System, Not a Memory
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
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…
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
- [7] Reciprocal Rank Fusion Outperforms Condorcet and Individual Rank Learning Methods ↗
- [8] An Analysis of Fusion Functions for Hybrid Retrieval ↗
These citations provide research context; check each source for the exact claim it supports.