PiCA: Pivot-Based Credit Assignment for Search Agentic Reinforcement Learning
On the map: LLM agents and tool use → Reinforcement learning for LLM agents
Abstract (arXiv)
Large Language Model (LLM)-based search agents trained with reinforcement learning (RL) have significantly improved the performance of knowledge-intensive tasks. However, existing methods encounter critical challenges in long-horizon credit assignment: (i) Reward Sparsity, where models receive only outcome feedback without step-level guidance to differentiate action quality; (ii) Isolated Credit, where credit is assigned to steps independently, failing to capture sequential dependencies; and (iii) Distributional Shift, where rewards are estimated on templates that deviate from the model's natural generative distribution. To address these issues, we propose Pivot-Based Credit Assignment (PiCA), a novel step reward mechanism that reformulates the search trajectory as a sequential process of cumulative search progress. Unlike prior isolated step rewards, PiCA defines process rewards as success probabilities dependent on the historical context based on Potential-Based Reward Shaping (PBRS). This approach identifies pivot steps, which comprise target golden sub-queries and sub-answers derived from historical trajectories, as information peaks that significantly boost the likelihood of a correct final answer. By anchoring these step rewards to the final task objective, PiCA provides dense, pivot-aware and trajectory-dependent guidance while maintaining distributional consistency. Extensive experiments show that PiCA outperforms existing strong baselines across seven knowledge-intensive QA benchmarks, achieving 15.2% and 4.4% improvements for 3B and 7B models. The consistent performance gains across various models show PiCA's robust generalization. The code is available at https://github.com/novdream/PiCA.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in Reinforcement learning for LLM agents, one of 16 directions in LLM agents and tool use. Builds on 38 of its 48 references that are in the map. First posted on arXiv 10 May 2026.
Builds on
38 of 48 references.
Closest ancestors · 4
Same direction, newest first
- 2026From Reasoning to Agentic: Credit Assignment in Reinforcement Learning for Large Language Models10 Apr
- 2026Hindsight Credit Assignment for Long-Horizon LLM Agents7 Mar
- 2026BranPO: Scalable Contrastive Branch Sampling for Long-Horizon Agentic Reinforcement Learning3 Feb
- 2025Information Gain-based Policy Optimization: A Simple and Effective Approach for Multi-Turn Search Agents16 Oct
Other references · 34
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,686
- 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,383
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
- 2023Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflectioncited by 1,800
- 2025Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learningcited by 1,371
- 2020Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Stepscited by 1,259
- 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,216
- 2022When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric Memoriescited by 1,103
22 more
- 2022Measuring and Narrowing the Compositionality Gap in Language Modelscited by 1,054
- 2021MuSiQue: Multihop Questions via Single-hop Question Compositioncited by 893
- 2023REPLUG: Retrieval-Augmented Black-Box Language Modelscited by 786
- 2023Active Retrieval Augmented Generationcited by 506
- 2025Humanity's Last Examcited by 467
- 2025Search-o1: Agentic Search-Enhanced Large Reasoning Modelscited by 423
- 2025DeepResearcher: Scaling Deep Research via Reinforcement Learning in Real-world Environmentscited by 268
- 2025ZeroSearch: Incentivize the Search Capability of LLMs without Searchingcited by 203
- 2024Corrective Retrieval Augmented Generationcited by 187
- 2025WebDancer: Towards Autonomous Information Seeking Agencycited by 180
- 2018RUDDER: Return Decomposition for Delayed Rewardscited by 162
- 2025ReSearch: Learning to Reason with Search for LLMs via Reinforcement Learningcited by 152
- 2025StepSearch: Igniting LLMs Search Ability via Step-Wise Proximal Policy Optimizationcited by 82
- 2025MiroThinker: Pushing the Performance Boundaries of Open-Source Research Agents via Model, Context, and Interactive Scalingcited by 72
- 2024A Theoretical Understanding of Self-Correction through In-context Alignmentcited by 43
- 2025An Empirical Study on Reinforcement Learning for Reasoning-Search Interleaved LLM Agentscited by 43
- 2024RAG-Star: Enhancing Deliberative Reasoning with Retrieval Augmented Verification and Refinementcited by 38
- 2025Search and Refine During Think: Facilitating Knowledge Refinement for Improved Retrieval-Augmented Reasoningcited by 34
- 2026Reward Hacking in the Era of Large Models: Mechanisms, Emergent Misalignment, Challengescited by 30
- 2026TIPS: Turn-Level Information-Potential Reward Shaping for Search-Augmented LLMscited by 24
- 2024RetroLLM: Empowering Large Language Models to Retrieve Fine-grained Evidence within Generationcited by 20
- 2025WebLeaper: Empowering Efficiency and Efficacy in WebAgent via Enabling Info-Rich Seekingcited by 17
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2026Beyond Outcome Rewards: Constructing and Assigning Retrieval Credit for Search Agents
- 2026TRCA: Transition-wise Rubric Credit Assignment for Long-horizon LLM Agents
- 2026TRACE: Turn-level Reward Assignment via Credit Estimation for Long-Horizon Agents
- 2026Beyond Trajectory Rewards: Step-level Credit Assignment for Agentic Search via Graph Modeling
- 2026ABSeeker: Training Long-Horizon Search Agents via Answer-Backtracked Credit Assignment
- 2025Agentic Reinforcement Learning with Implicit Step Rewards
- 2026BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent
- 2026APEX-Searcher: Refining Credit Assignment with Subgoaling for Agentic Retrieval-Augmented Generation