Reranking

Retrieving generously, then reordering the candidates with a slower, more accurate model.

First-pass vector search is fast and approximate. A reranker scores each candidate against the query properly, which is too expensive to run across a whole corpus but cheap across fifty candidates.

This two-stage shape — cheap recall, expensive precision — is the standard structure of a mature retrieval system.