Equation 1 · Part 10 · How Do We Know a Compressed Model Still Works?
Ending index or upper bound: n
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
n appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.
Full expression→Ending index or upper bound: n→Article meaning
The passage around this formula
An aggregate benchmark score is a weighted average over items or tasks: . where is accuracy, or another per-task quality measure, on task i , and is that task’s share of the total, with the weights summing to one. The arithmetic makes the trap explicit: S can be almost unchanged by compression even when some single collapses, provided for that task is small relative to the rest, or provided a rise elsewhere offsets the fall. A single published number, ninety-eight point six percent of baseline, or a small perplexity increase, cannot by construction distinguish “compression cost nothing” from “compression cost a great deal on one task nobody weighted…
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 →
The article lists its research sources here.