theNotebook

Entry 29 · Friday

the shortlist decided the score before the reranker did

30 October 2026

Shelf three · Language models & generative AI

Kitchen table

Sorting the five books someone handed you cannot help if the book you actually wanted stayed on the shelf.

Whiteboard

I spent a week tuning a reranker that could not have helped. The first stage returned a shortlist of candidate documents. The reranker only reordered that shortlist. If the right document never entered it, no ordering can win. That is a ceiling, not a tuning problem. A recent paper, The Recall Ceiling of LLM Recommendation Reranking, makes this formal. It shows that oracle evaluation quietly hides the ceiling from you. The correct item gets injected into the candidate set before any scoring. Scores then measure the reranker against a set it cannot possibly miss. Under honest retrieval the clever strategies collapse toward the simple baseline. The authors propose classifying the recall regime before comparing rerankers at all. So measure recall at the candidate window before anything else. That one number bounds every downstream metric you report. If recall is low, widen or hybridise the first stage instead. Tuning the second stage is theatre until the first stage improves.

Boardroom

We pay twice for the quality of search. Once for the fast system that picks the candidates. Again for the smarter model that reorders those candidates. The second spend is capped by the quality of the first. If the right record never reaches the shortlist, no reordering can recover it. Vendor demos hide this by testing with the correct answer already included. So the pilot looks strong and the production system looks ordinary. The cost arrives as inference spend with no measurable lift in outcomes. Ask one question before approving more budget for a better model. What share of the correct answers reaches the shortlist today?

Tags

  • reranking
  • retrieval
  • rag
  • evals
  • benchmarks

All entries · 32 in all

Search the notebook