The Router Nobody Built Sits Between Your Weights and Your Index
Two independent lines of evidence point at the same missing component, and the fix starts with one new eval column plus a hard-negative set — before anyone re-embeds a corpus.
The metric that separates "doesn't know" from "wasn't asked right"
Single-shot direct-query accuracy, the number in nearly every internal accuracy report, fuses two failures with opposite fixes. Encoded-but-unrecalled means the parameters hold the fact and elicitation missed it: decoding, prompt design, thinking budget. A genuine knowledge gap needs external grounding. Google research scientist Nitay Calderon, per the study's coverage, puts it bluntly: much of what teams solve with retrieval are facts the model already answers from memory, and the retrieval call buys latency and per-call cost for nothing.
Making that visible costs one harness column: direct-query accuracy scored against a multi-probe elicitation ceiling, built from paraphrases, multiple choice, few-shot examples and extended reasoning. The gap between single-shot and ceiling is the unrecalled budget. It decides whether the next spend is prompt and decode work or real grounding. Without it, that decision is a guess dressed as architecture.
Now the bounds, because they are tight. Benchmark facts are public, static and near-certainly in the pretraining corpus. Best possible case for parametric memory, and silent on private corpora, freshness, citation and auditability. The 40–65% recovery figure ships with no stated compute cost, so accuracy-per-dollar against retrieval is uncomputable from the published numbers. A story that moves value from retrieval tooling toward long context and inference-time reasoning also fits Gemini's own positioning.
Where retrieval is not over-provisioned
ByteByteGo's taxonomy covers exactly the queries the study's distribution excludes, which is why a leaderboard average predicts production recall poorly. The defect is an objective mismatch: bi-encoders train for semantic similarity, while retrieval-augmented answering needs answer-bearing relevance. The canonical case is "how long will an approved refund take?" retrieving "purchases can be refunded within 30 days," which answers nothing.
| Failure mode | Fixed by a better embedding model? | What actually fixes it |
|---|---|---|
| Negation ("can" vs "cannot delete") | No | Hybrid lexical union plus cross-encoder joint scoring |
| Numeric identifiers (30 vs 60 days) | No | BM25 union plus reranker; structured extraction |
| Superseded versions and dates | No | Metadata filter plus authoritative-version flag |
| Domain vocabulary ("capture" in payments) | Yes | Domain model or fine-tune with hard negatives |
The practical read: the bi-encoder sets your recall ceiling, the reranker sets your precision. Hybrid retrieval plus a cross-encoder buys more recall per engineering-week than a model swap, and it needs no corpus re-embedding. Cheap enough to measure first.
The dispatch layer, and the storage decision under it
Bucket traffic into static public knowledge, volatile facts, proprietary corpus, and audit-required. Only the first is a candidate for parametric-only answering, and its traffic share is the hard ceiling on any savings. A lightweight external classifier over query features plus uncertainty signals (logprob margin, output entropy, k-sample self-consistency spread) need not be good to beat uniform provisioning when only 10–20% of queries need the expensive path. Success criterion: blended cost per query down 25% at equal accuracy against an always-retrieve baseline, with p99 latency reported beside p50, because extended reasoning has a fat tail.
On storage, note the lever the Matryoshka discussion omits. A 10M-chunk corpus at 1024-dim fp32 is roughly 41GB raw. Truncating to 256 dims gets near 10GB, while int8 scalar quantization at full 1024 dims lands at a similar footprint and keeps every dimension. Two-stage retrieval, coarse prefix scan then full-vector rescore, already ships in several vector stores. Check yours before building it.
Matryoshka gives you sizes inside one vector space; switching embedding models is still a full re-embed, and same dimensionality is not the same space.
What to do
Add an encoded-but-unrecalled column to the eval harness this sprint: direct-query accuracy scored against a multi-probe ceiling of paraphrase, multiple choice, few-shot and extended reasoning.
Build a 150–300 example hard-negative eval set stratified across the seven failure modes within two weeks, reporting recall@5, recall@20 and MRR per stratum rather than in aggregate.
Prototype a confidence router over query features plus logprob margin and k-sample spread this quarter, with a pass bar of 25% lower blended cost per query at equal accuracy versus always-retrieve.