LESSON 3.2

Reranking retrieved candidates

05:15·5,828 learners
Priya RamanPriya Raman
Next lesson

In this lesson you will

  • Retrieve a wide candidate set, then narrow it
  • Score query and passage jointly with a reranker
  • Balance the latency cost against the accuracy gain

Retrieve broadly, then rerank precisely. A reranker reads query and passage together, which is why it beats vector distance on ordering.

What this lesson covers

  • Retrieve a wide candidate set, then narrow it
  • Score query and passage jointly with a reranker
  • Balance the latency cost against the accuracy gain

This lesson sits in Retrieval Quality, part of Retrieval-Augmented Generation from Scratch. It assumes what came before it and leads directly into the next lesson in the module.

UP NEXT

3.3 · Evaluating retrieval

12:19

Retrieval-Augmented Generation from Scratch

58%

Every lesson, searchable to the second.

© 2026 BIBLION

PRIVACY · TERMS · CONTACT