SOURCE-LINKED INTELLIGENCE

Coverage, Not Targeting: A Structural Regime in Multi-Turn Agent Credit Assignment

arXiv · AI, language, vision and robotics · article · Sep 2, 2026 · UTC

Multi-turn agentic RL increasingly treats credit assignment as a targeting problem: given a terminal verifiable reward, per-turn methods localize credit onto the turns that mattered. We identify the structural quantity that predicts when this is the right move, the verifier information density V_d = k/C (the fraction of an agent's C-step causal chain whose per-turn correctness the verifier exposes), and show that terminal-state verifiers sit deep in a low-V_d regime where targeting is the wrong axis. In controlled shared-rollout comparisons on tau^2-bench that separate reward density from cred

Read original source ↗ Open in workspace

recordType

paper

region

Global