← All parts of this equation

Equation 11 · Part 10 · Measuring What a RAG System Retrieves, Not Just What It Answers

Ending index or upper bound: k

DCG@k=∑i=1k2 reli−1log⁡2(i+1),nDCG@k=DCG@kIDCG@k\mathrm{DCG@}k = \sum_{i=1}^{k} \frac{2^{\,\mathrm{rel}_i}-1}{\log_2(i+1)}, \qquad \mathrm{nDCG@}k = \frac{\mathrm{DCG@}k}{\mathrm{IDCG@}k}
kk

What this part means

This label says where the repeated addition, multiplication, or accumulation stops. It sets the last term or end of the range.

Its job in the formula

k appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.

The passage around this formula

Normalised discounted cumulative gain generalises this to graded relevance and to the whole list rather than only the first hit: DCG@k=∑i=1k2 reli−1log⁡2(i+1),nDCG@k=DCG@kIDCG@k\mathrm{DCG@}k = \sum_{i=1}^{k} \frac{2^{\,\mathrm{rel}_i}-1}{\log_2(i+1)}, \qquad \mathrm{nDCG@}k = \frac{\mathrm{DCG@}k}{\mathrm{IDCG@}k}. where reli\mathrm{rel}_i is the graded relevance of the result at position i and IDCG@\mathrm{IDCG@}k is the DCG of the ideal ordering, so the ratio is bounded near one regardless of how many relevant documents exist for a given query. The logarithmic discount encodes a specific judgement about attention: a relevant document at position one is worth far more than the same document at position ten, and nDCG is the standard way the information-retrieval literature makes that judgement quantitative. Heterogeneous retrieval benchmarks built to compare…

Read this part in the article →

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 →

See this notation across published equations →

Sources cited in the surrounding passage

These citations provide research context; check each source for the exact claim it supports.