STAMP: Provenance-Guided Credit Assignment for Deep Search Agents
Not on the map. Why?
Abstract (arXiv)
Reinforcement learning for deep-search agents has largely focused on trajectory-level scoring -- outcome correctness, citation-aware rewards, and evidence coverage. Yet the actions that expose supporting documents receive no targeted credit, a gap we call the reward-credit mismatch. We propose STAMP, in which a reference-based verifier judges whether each cited document supports an entity or relation in a training-time evidence graph, and first-exposure attribution traces each supported citation back to the action that first surfaced it. This step credit is injected through sign-preserving advantage modulation, which redistributes advantage across steps without changing the trajectory-level reward or the relative ranking of trajectories within each group. On BrowseComp, BrowseComp-ZH, and xbench-DS, STAMP improves the GRPO baseline by +2.0/+5.5/+3.0 points under matched SFT initialization, training data, and search tools, and composes with both outcome-only and citation-rubric base rewards. Component ablations confirm that the provenance-based credit signal and the sign-preserving advantage modulation each contribute to the gains.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 18 of its 31 references that are in the map. First posted on arXiv 13 Jul 2026.
Builds on
18 of 31 references.
References · 18
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,355
- 2024HybridFlow: A Flexible and Efficient RLHF Frameworkcited by 1,980
- 2021WebGPT: Browser-assisted question-answering with human feedbackcited by 1,722
- 2017Hindsight Experience Replaycited by 1,096
- 2025BrowseComp: A Simple Yet Challenging Benchmark for Browsing Agentscited by 616
- 2025The Lessons of Developing Process Reward Models in Mathematical Reasoningcited by 402
- 2025WebSailor: Navigating Super-human Reasoning for Web Agentcited by 218
- 2025Beyond Ten Turns: Unlocking Long-Horizon Agentic Search with Large-Scale Asynchronous RLcited by 144
- 2025BrowseComp-ZH: Benchmarking Web Browsing Ability of Large Language Models in Chinesecited by 139
- 2025WebShaper: Agentically Data Synthesizing via Information-Seeking Formalizationcited by 118
- 2025WebExplorer: Explore and Evolve for Training Long-Horizon Web Agentscited by 86
6 more
- 2025DeepSeekMath-V2: Towards Self-Verifiable Mathematical Reasoningcited by 84
- 2025Process Reward Models for LLM Agents: Practical Framework and Directionscited by 81
- 2025Process vs. Outcome Reward: Which is Better for Agentic RAG Reinforcement Learningcited by 68
- 2025DeepDive: Advancing Deep Search Agents with Knowledge Graphs and Multi-Turn RLcited by 53
- 2025Dynamic and Generalizable Process Reward Modelingcited by 16
- 2025Repurposing Synthetic Data for Fine-grained Search Agent Supervisioncited by 10
Built on by
Citing papers per year: 2026: 3.
3 papers.
Similar, not cited
Close in wording, no citation either way
- 2026Chaining the Evidence: Robust Reinforcement Learning for Deep Search Agents with Citation-Aware Rubric Rewards
- 2025Proof-of-Use: Mitigating Tool-Call Hacking in Deep Research Agents
- 2026RICE-PO: Turning Retrieval Interactions into Credit Signals for Reasoning Agents
- 2026ICA: Information-Aware Credit Assignment for Visually Grounded Long-Horizon Information-Seeking Agents
- 2026TAPO: Tool-Aware Policy Optimization via Credit Transfer for Multimodal Search Agents
- 2026Search-G1: Grounded Search Agents via Representation-Based Intrinsic Rewards
- 2026Beyond Trajectory Rewards: Step-level Credit Assignment for Agentic Search via Graph Modeling
- 2026Beyond Outcome Rewards: Step-Level Self-Distilled Policy Optimization for Deep Search Agents