Chapter DRe-ranking labPage 1 of 8

Re-ranking lab

Frame the hybrid retrieve-and-rerank experiment

Page 1 advances one concrete hybrid retrieve-and-rerank pipeline: explain the decision, run the code, inspect failure, measure evidence, and keep only what is ready to ship.

~14 minExperiment brief

1Try it yourself

Playground

Re-rank retrieval lab

Pick keyword, vector, or hybrid+re-rank for each query — then merge top hits.

Find ticket SKU-8842 in support docs

Before you start

Why this matters

Without running code, predict the output of this page's example and name the intermediate value that would prove your prediction. Then write one sentence answering: “What could look successful while actually being wrong?” For this stage, focus on exact SKU miss or silent duplicate candidates. Keep the prediction nearby; comparing it with the real output is the first debugging exercise, not a quiz about syntax.

2Learn the idea

Read

Build focus

A lab needs a falsifiable claim before code. The claim here is that you can put the most query-relevant evidence first for mixed exact-ID and paraphrase questions. Record the tiny dataset, expected behavior, and one reason the result could be misleading. The first artifact is an experiment brief, not a screenshot. It names the user decision, the baseline you must beat, and the non-goals you will not pretend to solve on this page.

Vector search alone drops exact tokens like ERR-502; keyword search alone drops paraphrases like “upstream timed out.” Re-ranking exists to spend a slower model on a shortlist, not on the whole corpus. Your claim must name the query classes that should improve and the latency you will not spend.

The artifact's user-facing goal is specific: put the most query-relevant evidence first for mixed exact-ID and paraphrase questions. Its accepted input is a query string plus lexical and vector candidate lists with stable chunk IDs. Those statements are intentionally narrower than “build an AI system.” Narrow scope lets us inspect every input and expected result, and it prevents a toy result from being presented as a production claim. System shape for this chapter: a lexical retriever preserves exact identifiers such as ERR-502, a vector retriever catches paraphrases, reciprocal-rank fusion creates twenty unique candidates, and a cross-encoder jointly reads each query-chunk pair before the prompt receives the best five. Keep model calls behind adapters, keep authorization and validation in deterministic code, and carry stable IDs and versions through every response. That separation lets you decide whether a bad result came from input handling, retrieval, inference, validation, or deployment. This page's job is the experiment brief step: a lab needs a falsifiable claim before code. Setup baseline for the chapter (run once per machine, not secrets in git):

python -m venv .venv && source .venv/bin/activate
pip install sentence-transformers rank-bm25 numpy

If hardware or a hosted provider differs, preserve the interface and expected behavior. Do not present provider syntax as universal—when a vendor adapter is unavoidable, keep it behind a thin boundary and test with a fake first. The deliverable is not “it ran once”; it is a reproducible artifact another developer can inspect, including expected output and one deliberate failure related to exact SKU miss or silent duplicate candidates. Operationally, write down the owner of this stage, the command you ran, the observed output, and the next page's dependency on that output. If you cannot point to a file, fixture, metric, or config key, the stage is not done. Prefer small, reviewable increments: one contract, one path, one metric, one failure, one gate. When tradeoffs appear—latency versus quality, hit rate versus false hits, local privacy versus cloud quality—record both numbers instead of moving the threshold until the report looks green. The chapter ships only when evidence for nDCG@5 improves by at least 0.05 versus vector-only while added p95 latency stays under 120 ms and a rehearsed recovery path exist beside cross-encoder re-ranker with canary traffic and RERANK_ENABLED kill switch.

Read

Run the example

Save this as lesson.py and run python3 lesson.py. Prefer the standard library or the pinned packages from the setup block so the example stays reproducible.

plan={"retrieve_k":20,"rerank_k":5,"metric":"ndcg@5","kill_switch":"RERANK_ENABLED"}
print(plan)

Expected output: plan with retrieve_k 20 and rerank_k 5. Exact floating-point formatting may vary slightly, but the asserted behavior must not. Read the output as evidence about this stage, not merely proof that the interpreter started.

Read

Debug the stage

Print the planned interfaces and the one fixture that would falsify the brief. If tenant, version, timeout, or refusal behavior is missing from the brief, stop before installing packages. At the experiment brief stage, save the smallest failing fixture beside the expected result. Change one cause at a time and rerun the exact command printed above; that makes the repair reviewable and keeps this chapter's progressive artifact reproducible.

Read

Evaluate before continuing

Preserve the acceptance brief beside the fixture. Connecting tools is not the same as meeting nDCG@5 improves by at least 0.05 versus vector-only while added p95 latency stays under 120 ms. For this experiment brief page, preserve the fixture and result as evidence for the next page. Label observations separately from conclusions: a passing assertion establishes the behavior it names, while broader usefulness requires the chapter's full evaluation set and stated operating limits. Primary metrics for the chapter remain nDCG@5 improves by at least 0.05 versus vector-only while added p95 latency stays under 120 ms.

Checking tutor…

Continue learning · glossary & guides
  • [ ] What exact claim can this tiny fixture disprove?
  • [ ] Which baseline prevents a decorative success claim?
  • [ ] What result would make me stop before implementation?
  • [ ] Can I explain how put the most query-relevant evidence first for mixed exact-ID and paraphrase questions?

Glossary: re-ranking · Glossary: cross-encoder · Cheatsheet: rerank patterns

Next