mlsanityData to 7 Oct 2026

Beyond Uniform Credit: Causal Credit Assignment for Policy Optimization

arXiv 2602.09331 ↗First posted 10 Feb 2026cs.CL cs.AI cs.LGcited by 7

On the map: LLM reasoning → Reinforcement learning for reasoning

Abstract (arXiv)

Policy gradient methods for language model reasoning, such as GRPO and DAPO, assign uniform credit to all generated tokens - the filler phrase "Let me think" receives the same gradient update as the critical calculation "23 + 45 = 68." We propose counterfactual importance weighting: mask reasoning spans, measure the drop in answer probability, and upweight tokens accordingly during policy gradient updates. Our method requires no auxiliary models or external annotation, instead importance is estimated directly from the policy model's own probability shifts. Experiments on GSM8K across three models spanning the Qwen and Llama families demonstrate consistent improvements over uniform baselines and faster convergence to equivalent accuracy. Inverting the importance signal hurts performance, confirming we capture genuine causal structure rather than noise. Analysis shows the method correctly prioritizes calculation steps over scaffolding text. We view these findings as establishing counterfactual importance weighting as a foundation for further research rather than a complete solution.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Placed in Reinforcement learning for reasoning, one of 17 directions in LLM reasoning. Builds on 17 of its 22 references that are in the map. First posted on arXiv 10 Feb 2026.

Builds on

17 of 22 references.

Closest ancestors · 6

Same direction, newest first

  1. 2025Segment Policy Optimization: Effective Segment-Level Credit Assignment in RL for Large Language Models29 May
  2. 2025Understanding R1-Zero-Like Training: A Critical Perspective26 Mar
  3. 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scale18 Mar
  4. 2024TLCR: Token-Level Continuous Reward for Fine-grained Reinforcement Learning from Human Feedback23 Jul
  5. 2023Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotations14 Dec
  6. 2023Let's Verify Step by Step31 May

Other references · 11

  1. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  2. 2017Axiomatic Attribution for Deep Networkscited by 3,350
  3. 2022Locating and Editing Factual Associations in GPTcited by 2,609
  4. 2013Visualizing and Understanding Convolutional Networkscited by 2,278
  5. 2019Attention is not Explanationcited by 916
  6. 2017Counterfactual Multi-Agent Policy Gradientscited by 733
  7. 2016Understanding Neural Networks through Representation Erasurecited by 223
  8. 2024DPO Meets PPO: Reinforced Token Optimization for RLHFcited by 126
  9. 2020Counterfactual Credit Assignment in Model-Free Reinforcement Learningcited by 60
  10. 2025Enhancing Large Language Model Reasoning via Selective Critical Token Fine-Tuningcited by 20
  11. 2025SCAR: Shapley Credit Assignment for More Efficient RLHFcited by 13

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 7.

7 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026A Step Back: Prefix Importance Ratio Stabilizes Policy Optimization
  2. 2026Towards Generalizable Reasoning: Group Causal Counterfactual Policy Optimization for LLM Reasoning
  3. 2025On the Design of KL-Regularized Policy Gradient Algorithms for LLM Reasoning
  4. 2026Reducing Credit Assignment Variance via Counterfactual Reasoning Paths
  5. 2026Beyond Token-Level Policy Gradients for Complex Reasoning with Large Language Models
  6. 2025SEED-GRPO: Semantic Entropy Enhanced GRPO for Uncertainty-Aware Policy Optimization
  7. 2026Not All Tokens Deserve Equal Credit: Counterfactual Sensitivity Credit Reallocation for Long-CoT Reasoning
  8. 2025ESPO: Entropy Importance Sampling Policy Optimization