Coverage, Not Targeting: A Structural Regime in Multi-Turn Agent Credit Assignment
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…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
