AIAny
Icon for item

DTCA: Denoising Token Credit Assignment for Reinforcement Learning in Diffusion Language Models

Estimates how committed tokens improve predictions at remaining masked positions, then uses those contributions to refine reinforcement-learning signals for diffusion language models. On LLaDA-8B-Instruct, it raises MATH500 and GSM8K scores by up to 9.0 and 5.3 points.

Introduction

In a diffusion language model, a final answer is assembled through successive token commitments, but a single outcome reward does not reveal which commitments helped later denoising. DTCA turns that hidden interaction into a training signal: it asks whether committing a token makes the model more confident about positions that are still masked, then uses the estimate to guide credit assignment.

Key Findings
  • Contribution estimates are grouped by part of speech, making token-level signals more stable across rollout samples and helping select informative denoising steps.
  • The method calibrates learning signals using token-level entropy changes caused by policy updates, addressing the risk that an update changes confidence without improving useful behavior.
  • On LLaDA-8B-Instruct, reported gains over the base model reach 9.0 percentage points on MATH500 and 5.3 on GSM8K at a generation budget of 128; improvements remain positive at budgets of 256 and 512. This suggests the approach is particularly helpful when denoising computation is constrained.
Method and Scope

The central idea is to measure refinement, not merely reward: after a token is committed, DTCA compares prediction confidence on positions that remain masked. Offline rollouts provide estimates that are averaged by POS category, avoiding the extra forward-pass cost of repeatedly calculating individual token effects during policy optimization. The approach therefore depends on the quality of POS grouping and on confidence change being a useful proxy for contribution.

Who It’s For

A good fit for researchers studying reinforcement learning, credit assignment, or training methods for diffusion language models, especially those evaluating mathematical reasoning under limited generation budgets. Look elsewhere if you need evidence across diverse tasks or model families: the reported experiments center on mathematical benchmarks and LLaDA-8B-Instruct, and broader applicability remains unestablished.

Information

  • Websitearxiv.org
  • OrganizationsZhejiang University, National University of Singapore, SAP
  • AuthorsHongze Chen, Miao Pan, Lizhou Liang, Qinfeng Li, Xinyin Ma, Yongliang Shen, Weishi Wang, Daniel Dahlmeier, Xuhong Zhang, Wenqi Zhang
  • Published date2026/10/26

More Items

Jointly decides when waiting agent sessions should run on GPUs and which node should serve them. Scheduling accounts for tool-return readiness, time-decaying node cache value, and token demand.

Rewinds world-model trajectories to test alternative robot actions and turn outcome comparisons into action-level training signals. Real-robot data continually corrects the model; across three physical tasks, success rates beat the strongest baseline by 10.67–11.85 percentage points.

Lets a main agent synthesize executable workflows to coordinate and verify sub-agents as a task unfolds. The paper reports 88.08% overall accuracy in Forced mode across six benchmarks.