1.  [](/)
2.  [Diagrams](/diagrams)
3.  Wide net first, careful read second

[Back to Diagrams](/diagrams)IR Foundations

# Wide net first, careful read second

Reranking re-scores first-stage candidates with a cross-encoder so the best results rise to the top.

![Reranking is the precision second stage of retrieval: a fast first-stage retriever recalls a broad candidate set optimized for recall, then a cross-encoder reranker reads each query-document pair together and re-scores them so the most relevant results rise to the top before they reach the model. Fast recall first, precise scoring second.](/diagrams/foundations/reranking.webp)Full screen

Reranking re-scores first-stage candidates with a cross-encoder so the best results rise to the top.

Your vector search returns the top 10 by similarity. The uncomfortable part: those usually aren't the true top 10.

Fast retrieval is approximate by design. It embeds the query and each document separately, never reading them together, so it misses subtle relevance. The fix is a second stage: take the top 1,000 candidates, run a cross-encoder that reads each query and document as one input, and re-score. Results move 40 places. The document sitting at #47 was the actual answer, and now it's #2.

Why not run the careful model on everything? Cost. At roughly 100ms per pair you can afford a shortlist, not a corpus. So the architecture is a funnel: cheap and wide, then expensive and narrow.

Reranking is a stage in every Mixpeek retriever because it's the single biggest precision lever we see, and most teams skip it until they're desperate.

Stage one finds the neighborhood. Stage two finds the answer.

## Where this diagram appears

*   [Glossary: Reranking →](/glossary/reranking)

Run this on your own data

Mixpeek turns video, images, audio, and documents in your object storage into searchable, timestamped results through one API.

[Search your own data](https://studio.mixpeek.com/namespaces/create?mode=managed&utm_source=homepage&utm_medium=diagram_detail&utm_campaign=mvs_onramp)

## Related diagrams

[

![The unstructured-data problem: the large majority of enterprise data is unstructured (video, images, audio, and documents) that keyword systems and relational databases cannot search by meaning until it is turned into embeddings and indexed. The raw files are stored but not answerable.](/diagrams/foundations/unstructured-data.webp)

99% of your data has no rows



](/diagrams/unstructured-data)[

![An embedding turns meaning into coordinates: a model reads 'dog', 'puppy', and 'invoice' and outputs vectors, so 'dog' and 'puppy' land near each other while 'invoice' lands far away. Text, images, audio clips, video frames, and faces all map into one shared coordinate space where distance measures difference in meaning.](/diagrams/foundations/embeddings.webp)

An embedding is meaning turned into coordinates



](/diagrams/embeddings)[

![Semantic search as nearest-neighbor lookup: embed the query into the same vector space as your content, measure distance to every indexed point, and return the closest top-K results with no keyword matching. Exact brute-force compares against everything and is accurate but slow, while approximate nearest-neighbor (ANN) indexes like HNSW and IVF check a smart fraction of the space and return 95-99% of true answers in milliseconds.](/diagrams/foundations/similarity-search.webp)

Search by meaning = nearest neighbors



](/diagrams/similarity-search)