mlsanityData to 7 Oct 2026

When Implausible Tokens Get Reinforced: Tail-Aware Credit Calibration for LLM Reinforcement Learning

arXiv 2607.07976 ↗First posted 8 Jul 2026cs.CL cs.AI cs.LGcited by 1

On the map: LLM reasoning → Reinforcement learning for reasoning

Abstract (arXiv)

Reinforcement learning (RL) has achieved remarkable success in enhancing the reasoning capabilities of large language models (LLMs). However, widely used critic-free RL methods rely on uniform credit assignment, broadcasting the same advantage to all tokens regardless of their differences. We identify a critical failure mode of this design, which we refer to as Positive-Credit Contamination: low-probability tail tokens that are contextually erroneous receive identical positive credit to plausible ones within the same trajectory, resulting in the indiscriminate reinforcement of flawed reasoning behavior. To mitigate this issue, we propose Tail-Aware Credit calibratiOn (TACO), a method that calibrates uniform credit assignment to suppress undesirable positive updates. TACO first computes a tail-risk score that incorporates the local generation context to assess each token's risk of falling into the unreliable tail, distinguishing unexpected rarity from uncertainty-driven exploration. TACO then uses this score to tune positive credit for risky tokens without removing their gradients entirely, so that recurring useful rare patterns can accumulate reinforcement while incidental noise is progressively dampened. Experimental results across three LLMs and eight benchmarks show that TACO consistently outperforms GRPO-style baselines. Notably, TACO improves training stability, supporting sustained performance gains in long-horizon RL. The source code is available at: https://github.com/xiuyilou/TACO.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Reinforcement learning for reasoning, one of 17 directions in LLM reasoning. Builds on 28 of its 34 references that are in the map. First posted on arXiv 8 Jul 2026.

Builds on

28 of 34 references.

Closest ancestors · 15

Same direction, newest first

  1. 2026Learning at the Right Pace: Adaptive Data Scheduling Improves LLM Reinforcement Learning21 Jun
  2. 2026ERPO: Token-Level Entropy-Regulated Policy Optimization for Large Reasoning Models30 Mar
  3. 2026Execution-Grounded Credit Assignment for GRPO in Code Generation17 Mar
  4. 2026STAPO: Stabilizing Reinforcement Learning for LLMs by Silencing Rare Spurious Tokens17 Feb
  5. 2026InT: Self-Proposed Interventions Enable Credit Assignment in LLM Reasoning20 Jan
  6. 2026Outcome-Grounded Advantage Reshaping for Fine-Grained Credit Assignment in Mathematical Reasoning12 Jan
  7. 2025Unlocking Exploration in RLVR: Uncertainty-aware Advantage Shaping for Deeper Reasoning12 Oct
  8. 2025Low-probability Tokens Sustain Exploration in Reinforcement Learning with Verifiable Reward3 Oct
  9. 2025GRPO-λ: Credit Assignment improves LLM Reasoning30 Sep
  10. 2025Exploiting Tree Structure for Credit Assignment in RL Training of LLMs22 Sep
  11. 2025Do Not Let Low-Probability Tokens Over-Dominate in RL for LLMs19 May
  12. 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scale18 Mar
3 more
  1. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning22 Jan
  2. 2022Solving math word problems with process- and outcome-based feedback25 Nov
  3. 2017Proximal Policy Optimization Algorithms20 Jul

Other references · 13

  1. 2022Training language models to follow instructions with human feedbackcited by 15,712
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  3. 2019The Curious Case of Neural Text Degenerationcited by 2,881
  4. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
  5. 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,758
  6. 2022Solving Quantitative Reasoning Problems with Language Modelscited by 1,359
  7. 2024OlympiadBench: A Challenging Benchmark for Promoting AGI with Olympiad-Level Bilingual Multimodal Scientific Problemscited by 1,099
  8. 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,057
  9. 2023Large Language Models Cannot Self-Correct Reasoning Yetcited by 965
  10. 2019Neural Text Generation with Unlikelihood Trainingcited by 489
  11. 2025VeriThinker: Learning to Verify Makes Reasoning Model Efficientcited by 24
  12. 2025Heterogeneous Adaptive Policy Optimization: Tailoring Optimization to Every Token's Naturecited by 11
1 more
  1. 2025DTS: Enhancing Large Reasoning Models via Decoding Tree Sketchingcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026FARCA: Fact-Aligned Reliability-Aware Credit Assignment for Reinforcement Learning with Factual Supervision
  2. 2026OPPO: Bayesian Value Recursion for Token-Level Credit Assignment in LLM Reasoning
  3. 2026From Reasoning to Agentic: Credit Assignment in Reinforcement Learning for Large Language Models
  4. 2026Where Hindsight Credit Can Reside: A Signed-Capacity View of Token Updates in RLVR
  5. 2026PACT: From Credit Assignment to Critic Alignment
  6. 2026Surprising Success, Repeated Failure: Entropy-Guided Credit Assignment for Exploration in LLM Reasoning
  7. 2026Localizing Credit at the Divergence: Path-Conditioned Self-Distillation for LLM Reasoning
  8. 2026Overconfident Errors Need Stronger Correction: Asymmetric Confidence Penalties for Reinforcement Learning