Why Rerank Candidates?

Initial retrieval often prioritizes recall, returning a broad candidate set. Reranking uses a more query-aware scoring method to improve precision. It can be a cross-encoder, semantic ranker, or model-based scorer. It adds latency and cost and cannot recover a relevant document that never entered the candidate set.

A typical experiment retrieves broadly, merges and deduplicates, reranks, then passes a smaller top set to generation. Evaluate end-to-end answer quality and latency, not just ranking scores.

Diagram
Implementation example
Query -> retrieve 30 candidates -> merge/deduplicate
      -> rerank -> keep top 5-8 -> generate
💡 Reranking refines candidates; it does not replace good retrieval.
Key Takeaways
  • Inspect the relevant pipeline stage instead of guessing.
  • Preserve source provenance, versions, and access scope.
  • Measure quality on representative queries.
Knowledge Check

Can a reranker recover a document that was never retrieved?