What is adaptive retrieval in RAG?

Adaptive retrieval in RAG changes the *retrieval strategy at runtime* according to a question's complexity, available evidence, and system constraints. Rather than always searching the same way, the system can choose whether to retrieve, which sources to search, and whether another retrieval round is needed.

Beginner-friendly example

Consider three questions to a company support assistant:

• Simple: “Where is the password-reset guide?” → Search the help-center index once and return the cited guide.
• Complex: “Which services are affected when the payments database fails?” → Retrieve dependency information, identify connected services, then retrieve their operational runbooks.
• Incomplete evidence: “Does this refund exception apply to my order?” → Retrieve the policy; if eligibility still depends on missing order data, query the authorized order system or ask for clarification instead of guessing.

Unlike a fixed pipeline, the assistant makes a bounded decision after inspecting the question or intermediate evidence.

Typical workflow

1. Assess the query: Estimate complexity, freshness needs, domain, and whether trusted external evidence is mandatory.
2. Choose a retrieval path: Select a fast single retrieval, targeted sources, or multi-step retrieval.
3. Inspect results: Check whether the evidence is relevant, current, authorized, and sufficient to answer.
4. Adapt if necessary: Rewrite an ambiguous search, change retrievers, or gather missing evidence in another round.
5. Stop safely: Answer when evidence is sufficient; otherwise abstain or request missing information. Limit retrieval rounds, latency, and cost.
6. Generate with citations: Keep the final response grounded in the retrieved material.

Numerical example

Suppose 100 requests are routed as follows:

• 60 straightforward questions: one retrieval each → 60 calls.
• 30 moderately difficult questions: two retrieval rounds each → 60 calls.
• 10 complex questions: three retrieval rounds each → 30 calls.

Total: 150 retrieval calls. A fixed three-round system would make 300 calls for the same 100 requests. This is an *illustrative routing example*, not a measured benchmark; misclassification may hurt answer quality.

How is adaptive retrieval different from Dynamic Top-K?

• Dynamic Top-K adjusts how many passages are returned or retained.
• Adaptive retrieval decides what retrieval actions are necessary: one search, multiple steps, alternate sources, another query, or stopping.

Dynamic Top-K can be part of an adaptive pipeline, but changing K alone is not its full definition.

Research perspective

The Adaptive-RAG research line uses question complexity to choose among simpler and multi-step retrieval strategies. Other dynamic-RAG approaches decide when to retrieve additional evidence during generation or reasoning. These are examples, not one universal implementation.

Benefits and limitations

Benefits: Reduced unnecessary searches on easy queries, more evidence gathering on hard queries, and flexible source selection.

Limitations: Routers can underestimate complexity; confidence scores can be poorly calibrated; extra retrieval rounds increase tail latency. In regulated or source-grounded applications, do not skip mandatory retrieval solely because the model appears confident.

Interview takeaway: Adaptive retrieval turns search into a decision process: assess the question → choose a retrieval strategy → inspect evidence → search again or stop. Evaluate it using answer quality, evidence sufficiency, retrieval calls, and p95 latency.

References: https://arxiv.org/abs/2403.14403 ; https://arxiv.org/abs/2506.06704