CASI: Credit Assignment via Set Intervention for Agentic Retrieval
On the map: LLM agents and tool use → Web, search, and research agents also fits: Financial trading and forecasting agents
Abstract (arXiv)
Large language models increasingly generate multiple retrieval actions jointly, while downstream systems often provide only one reward for the resulting set. Broadcasting this reward provides a valid score-function gradient estimator for the expected set-level objective, but does not determine a coalition-dependent within-set attribution. We introduce CASI (Credit Assignment via Set Intervention for Agentic Retrieval), which constructs the missing counterfactual information through snapshot-grounded set intervention: generate and retrieve once, hold replayable snapshot components fixed, and evaluate alternative subsets under common conditions. Shapley aggregation converts these marginals into within-set credit, which bounded zero-sum advantage shaping incorporates into policy optimization. For m >= 4, singleton, leave-one-out, and full-set endpoints do not generally determine the Shapley allocation; under additive set values, extra coalition evaluations are redundant. In a five-action sponsored-search setting, exhaustive auction replay over 1,200 requests reveals substantial coalition dependence. Under the training-time evaluator, CASI achieves the highest median cosine similarity to a replay-defined Shapley reference among evaluated credit rules; under a sensitivity backend, CASI does not outperform Singleton. Across five independent training runs, CASI-trained policies achieve higher held-out auction-replay set value than Singleton- or Broadcast-trained policies. In a randomized seven-day production A/B test on 10% of traffic, the CASI-trained policy yields an observed 3.51% lift in the primary advertiser-value metric over production control.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Web, search, and research agents, one of 16 directions in LLM agents and tool use. Builds on 14 of its 19 references that are in the map. First posted on arXiv 14 Oct 2026.
Builds on
14 of 19 references.
References · 14
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2023Let's Verify Step by Stepcited by 3,789
- 2025Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learningcited by 1,444
- 2017Counterfactual Multi-Agent Policy Gradientscited by 751
- 2018QMIX: Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learningcited by 708
- 2016Off-policy evaluation for slate recommendationcited by 103
- 2019Shapley Q-value: A Local Reward Approach to Solve Global Reward Gamescited by 73
- 2025Parallel-R1: Towards Parallel Thinking via Reinforcement Learningcited by 61
- 2021Shapley Counterfactual Credits for Multi-Agent Reinforcement Learningcited by 38
- 2025ParallelSearch: Train your LLMs to Decompose Query and Search Sub-queries in Parallel with Reinforcement Learningcited by 26
- 2025RAG-R1: Incentivizing the Search and Reasoning Capabilities of LLMs through Multi-query Parallelismcited by 16
- 2021Diversity driven Query Rewriting in Search Advertisingcited by 15
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026APEX-Searcher: Refining Credit Assignment with Subgoaling for Agentic Retrieval-Augmented Generation
- 2026RICE-PO: Turning Retrieval Interactions into Credit Signals for Reasoning Agents
- 2026BRIDGE: Bilevel Retrieval-Credit-Aware Agentic Reinforcement Learning
- 2025CriticSearch: Fine-Grained Credit Assignment for Search Agents via a Retrospective Critic
- 2026From Reasoning to Agentic: Credit Assignment in Reinforcement Learning for Large Language Models
- 2025SCAR: Shapley Credit Assignment for More Efficient RLHF
- 2026Self-Induced Outcome Potential: Turn-Level Credit Assignment for Agents without Verifiers
- 2026ASCT: Attentive Search over Counterfactual Trees for Credit Assignment in Agentic Reinforcement Learning