mlsanityData to 7 Oct 2026

SD-Search: On-Policy Hindsight Self-Distillation for Search-Augmented Reasoning

arXiv 2605.18299 ↗First posted 18 May 2026cs.AI cs.CL cs.IRcited by 5

Not on the map. Why?

Abstract (arXiv)

Search-augmented reasoning agents interleave internal reasoning with calls to an external retriever, and their performance relies on the quality of each issued query. However, under outcome-reward reinforcement learning, every search decision in a rollout shares the same trajectory-level reward, leaving individual queries without step-specific credit. Recent process-supervision approaches address this gap by drawing step-level signals from outside the policy, relying either on a much larger teacher model, or on sub-question annotations produced by a stronger external system. In contrast, we propose SD-Search, which derives step-level supervision from the policy itself through on-policy hindsight self-distillation, requiring neither an external teacher nor additional annotations. In SD-Search, a single model plays two roles that differ only in conditioning: a student that sees only the context available at inference time, and a teacher that additionally conditions on a compact hindsight block summarizing the search queries and final outcomes of a group of rollouts sampled from the same question. Since the teacher knows how each rollout unfolded and which ones succeeded, its query distribution implicitly marks which decisions were worth making, and the student is trained to recover this behavior by minimizing the token-level Jensen--Shannon divergence to the teacher at search-query positions. This layers a dense, step-level signal on top of GRPO's coarse trajectory reward. Crucially, this signal is produced by the policy itself within the standard RL training loop, without external model inference, auxiliary annotation pipeline, or additional training stage.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 34 of its 35 references that are in the map. First posted on arXiv 18 May 2026.

Builds on

34 of 35 references.

References · 34

  1. 2023GPT-4 Technical Reportcited by 18,132
  2. 2017Proximal Policy Optimization Algorithmscited by 14,441
  3. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
  4. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  5. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
  6. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  7. 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,355
  8. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,146
  9. 2024Qwen2.5 Technical Reportcited by 4,713
  10. 2023Toolformer: Language Models Can Teach Themselves to Use Toolscited by 4,072
  11. 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,686
  12. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
22 more
  1. 2024HybridFlow: A Flexible and Efficient RLHF Frameworkcited by 1,980
  2. 2025Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learningcited by 1,371
  3. 2021Improving language models by retrieving from trillions of tokenscited by 1,278
  4. 2020Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Stepscited by 1,259
  5. 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,216
  6. 2022When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric Memoriescited by 1,103
  7. 2017Hindsight Experience Replaycited by 1,096
  8. 2022Measuring and Narrowing the Compositionality Gap in Language Modelscited by 1,054
  9. 2022Interleaving Retrieval with Chain-of-Thought Reasoning for Knowledge-Intensive Multi-Step Questionscited by 911
  10. 2021MuSiQue: Multihop Questions via Single-hop Question Compositioncited by 893
  11. 2023On-Policy Distillation of Language Models: Learning from Self-Generated Mistakescited by 840
  12. 2025Group-in-Group Policy Optimization for LLM Agent Trainingcited by 442
  13. 2025Search-o1: Agentic Search-Enhanced Large Reasoning Modelscited by 423
  14. 2026Self-Distilled Reasoner: On-Policy Self-Distillation for Large Language Modelscited by 386
  15. 2015Unifying distillation and privileged informationcited by 218
  16. 2026Self-Distillation Enables Continual Learningcited by 212
  17. 2025ReSearch: Learning to Reason with Search for LLMs via Reinforcement Learningcited by 152
  18. 2025StepSearch: Igniting LLMs Search Ability via Step-Wise Proximal Policy Optimizationcited by 82
  19. 2019Hindsight Credit Assignmentcited by 74
  20. 2025Search and Refine During Think: Facilitating Knowledge Refinement for Improved Retrieval-Augmented Reasoningcited by 34
  21. 2026Meta-Reinforcement Learning with Self-Reflection for Agentic Searchcited by 8
  22. 2025Thinker: Training LLMs in Hierarchical Thinking for Deep Search via Multi-Turn Interactioncited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 5.

5 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Search-E1: Self-Distillation Drives Self-Evolution in Search-Augmented Reasoning
  2. 2026Beyond Outcome Rewards: Step-Level Self-Distilled Policy Optimization for Deep Search Agents
  3. 2026IG-Search: Step-Level Information Gain Rewards for Search-Augmented Reasoning
  4. 2026ForkPilot: Self-Evolving Policy for Retrospective Search in Long-Horizon Agents
  5. 2025RECON: Reasoning with Condensation for Efficient Retrieval-Augmented Generation
  6. 2026PROGRESS: Coverage-guided RL to Train Search-augmented LLM Agent
  7. 2025ReSeek: A Self-Correcting Framework for Search Agents with Instructive Rewards
  8. 2025REX-RAG: Reasoning Exploration with Policy Correction in Retrieval-Augmented Generation