Order the steps of canonical embed then rerank 2-stage retrieval
Same topic, related formats. Practice these next.
Same topic, related formats. Practice these next.
Index documents once, then per query: embed query, ANN top-100, cross-encoder rerank, return top-10.
Picture a giant bookshop and a clerk helping you find books. Ahead of time, the clerk has tagged every book with a little label that summarizes what it is about. That tagging is the index-time step. It happens once per book, not once per question. When you walk in with a question, the clerk converts your question into the same kind of label, then quickly grabs a hundred books whose labels look similar. That is the fast first pass. Finally, the clerk reads each of those hundred books a little more carefully alongside your question and picks the ten that actually answer it. That careful reading is the rerank.
Everything you need to truly understand this topic: intuition, mechanics, step by step explanation, code, formulas, and worked example. Click to expand.
Everything you need to truly understand this topic: intuition, mechanics, step by step explanation, code, formulas, and worked example.
Everything important, quickly.
60s: identify the two timelines, list the five steps in the correct order, explain why index-time precedes query-time and why ANN precedes rerank; name the top-K cutoffs at each boundary.
Real products, models, and research that use this idea.
What an interviewer would ask next. Try answering before peeking at the approach.
Red flags and common mistakes that signal junior thinking. Click to expand.
Treating corpus embedding as a per-query step. Document embeddings are computed once at index time; only the query embedding is computed per request.
The night-before-the-interview bullets. Scan these on the way to the call.
Primary sources. Skim if you want the original framing.