CAS: Conformalized Agentic Search via Adaptive Retrieval and Policy Weighting
Organizations: ZJU-UIUC Institute, Zhejiang University. · Tencent Inc. · State Key Laboratory of CAD&CG, Zhejiang University.
Abstract
Search Agents face a severe reliability crisis during reinforcement learning (RL) fine-tuning. Heuristic Top-K retrieval often causes critical evidence loss or noise inclusion, while over-confidence induced by progressive RL leads to hallucinated answers and redundant searches. To build highly reliable agents, we introduce Conformal Prediction (CP) and propose Conformalized Agentic Search (CAS). This framework establishes reliability guarantees on both the retrieval and training sides: on the retrieval side, an Adaptive Prediction Set (APS), a specific CP realization, translates statistical coverage into dynamic document truncation to construct prediction sets that are adaptive in size; on the training side, Adaptive Conformal Inference (ACI), a dynamic CP algorithm, dynamically constructs prediction sets with controllable coverage to quantify answer confidence, which is then used to penalize low-confidence trajectories within the Group Relative Policy Optimization (GRPO) objective, ensuring the model learns only from reliable ones. Experiments across single-hop and multi-hop QA datasets demonstrate that our framework significantly improves reasoning accuracy while drastically reducing redundant tool invocations, establishing a highly reliable and efficient agent paradigm. Our code is available at https://github.com/S1llyBird/CAS.
Figures & tables
| Methods | General QA | Multi-Hop QA | Average | |||||
|---|---|---|---|---|---|---|---|---|
| NQ † | TriviaQA ⋆ | PopQA ⋆ | HotpotQA † | 2WikiMultiHopQA ⋆ | Musique ⋆ | Bamboogle ⋆ | ||
| Direct Inference | 0.106 | 0.288 | 0.108 | 0.149 | 0.244 | 0.020 | 0.024 | 0.134 |
| CoT | 0.023 | 0.032 | 0.005 | 0.021 | 0.021 | 0.002 | 0.000 | 0.015 |
| RAG | 0.348 | 0.544 | 0.387 | 0.255 | 0.226 | 0.047 | 0.080 | 0.270 |
| IRCoT | 0.111 | 0.312 | 0.200 | 0.164 | 0.171 | 0.067 | 0.240 | 0.181 |
| Search-o1 | 0.238 | 0.472 | 0.262 | 0.221 | 0.218 | 0.054 | 0.320 | 0.255 |
| Methods | General QA | Multi-Hop QA | Overall |
|---|---|---|---|
| Qwen2.5-3B-Instruct | |||
| Search-R1 | 0.451 | 0.249 | 0.336 |
| Ours | 0.498 | 0.328 | 0.401 |
| Improvement ( ) | +0.047 | +0.079 | +0.065 |
| Qwen3-8B | |||
| Search-R1 | 0.496 | 0.329 | 0.400 |
| Methods | General QA | Multi-Hop QA | Overall |
|---|---|---|---|
| Ours (Default) | 0.498 | 0.328 | 0.401 |
| -ACI | 0.481 | 0.311 | 0.384 |
| -APS | 0.490 | 0.313 | 0.389 |
| 0.497 | 0.302 | 0.386 | |
| 0.495 | 0.273 | 0.368 | |
| 0.476 | 0.294 | 0.372 |
| Avg. Retrieved Documents | |
|---|---|
| (Default) | 3.4 |
| 2.4 | |
| 4.8 |
Appendix figures & tables8 assets
Supplementary material from the paper’s appendix.
Appendix
| Prompt 1: Template for CAS |
|---|
| You are Qwen, created by Alibaba Cloud. You are a helpful assistant. Answer the given question. You must conduct reasoning inside <think> and </think> first every time you get new information. After reasoning, if you find you lack some knowledge, you can call a search engine by <search>query</search> and it will return the top searched results between <information> and </information> . You can search as many times as you want. If you find no further external knowledge needed, you can directly provide the answer inside <answer> and </answer> , without detailed illustrations. For example, <answer> Beijing </answer> . |
| Question: [Question] |
| Prompt 2: Query Decomposition |
|---|
| You decompose QA tasks into hop-level search query-answer pairs. Return strict JSON. Given a QA sample, split it into single-hop query-answer pairs. |
| Rules: |
| 1) If single-hop, return one pair. |
| 2) If multi-hop, return one pair per hop. |
| 3) answer should be concise and factual. |
| Prompt 3: Retrieval Relevance Judge |
|---|
| You are a precise retrieval relevance judge for QA reasoning. You are given a retrieval query, its target answer, and retrieved documents. Decide which document(s) can support reasoning to the target answer. |
| Return strict JSON with schema: |
| {"golden_doc_indices":[0,1], "best_golden_doc_index":0, "reason":"..."} |
| Rules: |
| Methods | General QA | Multi-Hop QA | Average | |||||
|---|---|---|---|---|---|---|---|---|
| NQ † | TriviaQA ⋆ | PopQA ⋆ | HotpotQA † | 2WikiMultiHopQA ⋆ | Musique ⋆ | Bamboogle ⋆ | ||
| - ACI | 0.417 | 0.598 | 0.430 | 0.378 | 0.372 | 0.143 | 0.352 | 0.384 |
| - APS | 0.435 | 0.603 | 0.433 | 0.393 | 0.374 | 0.143 | 0.344 | 0.389 |
| 0.441 | 0.601 | 0.449 | 0.382 | 0.375 | 0.132 | 0.320 | 0.386 | |
| 0.438 | 0.596 | 0.452 | 0.356 | 0.351 | 0.113 | 0.272 | 0.368 | |
| 0.420 | 0.584 | 0.432 | 0.372 | 0.370 | 0.146 | 0.288 | 0.372 | |
| Question: What BBC television drama serial starring Jim McManus was based on Sarah Waters’ debut novel of the same name? |
| Golden Answer: [’Tipping the Velvet’] |
| <think> |
| The question asks for a BBC television drama serial based on Sarah Waters’ debut novel of the same name. I recall that Sarah Waters’ debut novel is probably "Tipping the Velvet", but I need to confirm it, especially because Jim McManus may create ambiguity in search results. |
| </think> |
| <search> Jim McManus Tipping the Velvet </search> |
| Question: Who won the Men’s Singles French Open Tennis Tournament in 2018? |
| Golden Answer: [’Rafael Nadal’] |
| <think> |
| I need to find out who won the Men’s Singles French Open Tennis Tournament in 2018. I remember Rafael Nadal was dominant at the French Open around that time, but I should verify the exact 2018 result. |
| </think> |
| <search> 2018 French Open Men’s Singles winner </search> |
| Question: Which hockey team does the younger brother of Sean James Pronger currently work for? |
| Golden Answer: [’the Florida Panthers’] |
| <think> |
| I need to identify Sean James Pronger’s younger brother first, then determine which hockey team that person currently works for. This requires at least two steps: family relation lookup, then current team lookup. |
| </think> |
| <search> Sean James Pronger younger brother </search> |