Relevance judgments and pooling bias
Separate unjudged documents from nonrelevant ones and report how incomplete pools affect apparent ranking quality.
On this page
The question for today
What you’ll understand
- Explain what pooling samples and why novel retrieval results can lack labels.
- Bound top-k precision under explicit unknown binary judgments.
- Design supplementary judgments without assuming pooling is always biased or complete.
A relevance label records an assessor’s decision under a task definition; it is not an intrinsic property of a document independent of the query. Large collections cannot usually judge every pair, so evaluation pools combine selected systems’ top results. This makes useful test collections possible while leaving unjudged documents. NIST’s TREC overview explains both why pooling can support reliable comparison and when incomplete or shallow pools can disadvantage new result types.
Keep label state separate from its scoring treatment
A document can be judged relevant, judged nonrelevant, or unjudged. Traditional evaluation implementations often treat unjudged documents as nonrelevant for a metric calculation, but that convention does not turn missing evidence into a human verdict. A newer retriever can return useful material absent from an older pool, making the measured result sensitive to coverage. Inspect the fraction of judged documents at the actual cutoff and the distribution of new candidates, rather than assuming a metric value alone establishes the quality of every novel result.
Define relevance before collecting more judgments: the required answer, supporting evidence, acceptable date, granularity, and partial-relevance levels should be clear. Different assessors can disagree, particularly for ambiguous or multi-intent queries. Record disagreement and adjudication rather than silently collapsing every uncertainty into zero. A positive passage judgment does not necessarily mean the entire source document supports every claim, and an exact answer string does not prove contextual support. The evaluation unit must match what the deployed retriever returns.
Quantify what remains unknown
If all judged binary labels are accepted as correct, unknown labels create simple bounds on precision at a fixed cutoff. Those bounds are a sensitivity interval, not a statistical confidence interval: they allow every possible assignment of the unjudged items. Recall is more difficult because the number of relevant documents outside the returned list can also be unknown. Calling the fraction of known relevant items retrieved true collection recall hides that missing denominator. State whether a reported recall is conditional on the available judgments.
Pooling is not automatically invalid. Broad, diverse pools have supported stable comparisons in many studied collections, and the magnitude of bias depends on the task, depth, and new system’s behavior. The concern is empirical rather than a reason to dismiss every pooled benchmark. Compare the original evaluation with supplementary blinded judgments for inspected differences, include outputs from competing methods, and sample beyond one model’s favorite results. A selective labeling exercise designed only to vindicate one system can create another bias instead of correcting the first.
Preserve a reproducible judgment protocol
Log corpus and query versions, pool contributors and cutoffs, assessor instructions, blinding, and adjudication policy. Keep training labels and evaluation judgments separate, and avoid tuning repeatedly against a small newly labeled disagreement set without a fresh holdout. Report both the ranking metric and coverage evidence, especially for underrepresented query classes. When a gain disappears after broader judging, inspect whether the earlier result came from missing labels or whether the new protocol itself changed the relevance definition.
The probability lab is a sensitivity assumption, not a labeling machine. Reset, set probability to 0.5 and trials to 2, predict the expected number of relevant items among two hypothetical unknowns, then Step: one. Compare a fresh Reset with both probability at 0.8 and trials at 2 before Step: 1.6. This assumes independent common-probability labels that are not known in reality. It does not judge documents, estimate assessor reliability, or narrow the deterministic precision bounds without additional evidence.
Work it through
Precision with two unknown labels
A top-five list has labels relevant, unjudged, nonrelevant, unjudged, relevant. Accept the judged binary labels as correct. Compute precision under the zero convention, judged coverage, and deterministic precision bounds.
There are r = 2 judged relevant documents and u = 2 unjudged documents. The unjudged-as-zero precision is 2/5 = 0.4.
Three of five documents are judged, so J@5 = 3/5 = 0.6. The coverage number describes evidence availability, not the relevance of the two missing labels.
If both unknowns are nonrelevant, true precision is 0.4; if both are relevant, it is 4/5 = 0.8. Thus the sensitivity interval is [0.4,0.8], not a 95% confidence interval.
The apparent score is conditional on a label convention, and the missing judgments leave a material unresolved range.
The living notebook
Explore the model
Interactive lab · probability
Sensitivity to an assumed unknown-label rate
Reset, set p = 0.5 and n = 2, predict the mean count, then Step: one. Compare a fresh Reset with both p = 0.8 and n = 2 before Step: 1.6. These exact binomial masses assume independent hypothetical labels; they do not judge real documents or establish a relevance rate.
- Mean · np
- 5
- Variance · np(1−p)
- 2.5
- Total probability
- 1
These are exact binomial probabilities for independent trials with one fixed success probability. Playback tours the distribution; it does not resample outcomes. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forAn assumed label model illustrates sensitivity but cannot replace additional relevance evidence.
Pause & reason
Check your understanding
Your turn
Try it yourself
A top-four list has one judged relevant, one judged nonrelevant, and two unjudged documents. Compute P^(0)@4, J@4, and the deterministic precision interval. Explain why you cannot derive true collection recall from these facts.
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
The lower bound gives both unknowns zero relevance; the upper bound gives both one.
Compare with the solution
P^(0)@4 is 1/4 = 0.25, and J@4 is 2/4 = 0.5. Precision can range from 0.25 to 3/4 = 0.75 if judged labels are correct. True recall also needs the total number of relevant documents in the collection, including outside the top four, which these observations do not supply. The interval describes missing-label sensitivity rather than sampling confidence.
Keep the idea
Take it with you
- Unjudged and nonrelevant are different evidence states even when a metric treats both as zero.
- Coverage and sensitivity bounds help interpret incomplete judgments.
- Supplementary judging needs balanced sampling and a stable relevance definition.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.