Reranking
Reranking reorders a candidate set produced by an earlier retrieval, search, or generation stage. It is useful when a fast first stage has high recall but weak precision, and a slower model can evaluate fewer candidates more carefully.
For a query , first-stage retrieval gives:
A reranker assigns a second score:
and returns:
where is the cheap retrieval score, is the reranking model, and is optional evidence such as metadata, retrieved context, pose features, or cross-modal features.
Common Patterns
- Text RAG: retrieve chunks, then rerank by cross-encoder relevance or evidence quality.
- Paper triage: retrieve candidate papers, then rerank by topic fit, artifact availability, and novelty.
- Virtual screening: retrieve or dock candidates, then rerank by pose plausibility, affinity proxy, novelty, or liability filters.
- Multimodal search: retrieve by one modality, then rerank using aligned text-image, text-structure, or text-table evidence.
Objective
A pairwise reranking loss can be written as:
where should rank above for query .
Listwise reranking can normalize scores inside the candidate set:
Checks
- Does the first stage have enough recall for the reranker to help?
- Is the reranker evaluated only on retrieved candidates or on the full corpus?
- Does the metric emphasize early precision, enrichment, calibrated score, or downstream answer quality?
- Are first-stage retrieval errors counted separately from reranker errors?
- Does reranking use evidence available at deployment time?
- Are duplicates, homologs, scaffolds, or near-identical chunks removed before evaluation?