ModelRefs / Reranker (Cross-Encoder) — AI Glossary
Reranker (Cross-Encoder) — AI Glossary
A second-stage model that scores each candidate retrieved passage against the query for higher-precision re-ordering.
Overview
Rerankers (Cohere Rerank, BGE-Reranker, Voyage Rerank, Jina Reranker) are cross-encoders that jointly encode the query and passage — much more expensive than bi-encoder retrieval but substantially more accurate. Typically applied to the top-50–100 initial candidates.
Reference details
| Topic | rag |
|---|---|
| Also known as | cross-encoder, reranking model |
| Last reviewed | 2026-06-24 |
Related terms
How it works
- The query and one candidate are concatenated into a single sequence with a separator, so attention runs across the pair and every query token can address every passage token.
- The model emits one relevance value per pair, read from a classification head or from the logit of a designated token, rather than producing an embedding.
- Because the pair is the unit, each candidate is its own forward pass and the cost is linear in candidate count — which is the whole reason the stage operates on a shortlist.
- Those passes are independent, so they are batched into one or two GPU calls, and that batching is what makes a hundred candidates a single-digit-millisecond addition rather than a hundred sequential inferences.
- The resulting scores are comparable only within one query's candidate set, since nothing in training related the score for one query to the score for another.
- Passage length matters more here than in retrieval: the pair must fit the model's sequence limit, so a long candidate is truncated and is scored on its opening rather than on the part that mattered.
Example: Why a second model earns its latency
A bi-encoder embeds query and document separately, so the two never interact until a dot product at the end — fast enough to scan millions. A cross-encoder feeds the pair through together, letting every query token attend to every document token, which is far more accurate and far too slow for the whole corpus. So you retrieve 100 cheaply, then rerank those 100 properly.
Commonly confused with
A reranker is the model; reranking is the pipeline stage it occupies. A reranker cannot improve recall — it only reorders what retrieval already returned. If the right document was not in the top 100, no reranker will surface it.
When to use it
Reach for it when:
- Retrieval recall is acceptable but the top few results are poorly ordered
- You feed a small number of passages into a context-limited prompt
- Precision at position 1–3 is what actually drives answer quality
Reach for something else when:
- Recall is the problem — fix retrieval first; reranking cannot recover a miss
- Latency budget is tight and the ordering is already good enough
- The candidate set is already small enough to pass through whole
Referenced by
This term is used by the following ModelRefs references:
Continue your research
Use these connected ModelRefs sections to compare alternatives, inspect implementation paths, and review the evidence and governance boundaries relevant to Reranker (Cross-Encoder) — AI Glossary.
Frequently asked questions
What is Reranker (Cross-Encoder)?
A second-stage model that scores each candidate retrieved passage against the query for higher-precision re-ordering.
Is Reranker (Cross-Encoder) the same as cross-encoder?
Yes — cross-encoder, reranking model are common aliases for Reranker (Cross-Encoder).
What concepts are related to Reranker (Cross-Encoder)?
Closely related concepts include rag, hybrid search, embedding.