aiqbench analysis
This paper addresses critical gradient inefficiencies in diffusion large language models by introducing PAPO, a framework that aligns reinforcement learning updates with authentic generation trajectories. By converting sparse terminal rewards into dense step-wise signals and replaying high-uncertainty steps, the method achieves significant performance gains on mathematical and logical reasoning benchmarks. The approach offers a concrete path forward for improving the reasoning capabilities of dLLMs without relying on artificial state divergences.
Back on Track: Aligning Rewards and States for Reasoning in Diffusion Large Language Models
arXiv:2606.08501v1 Announce Type: new Abstract: Reinforcement learning (RL) holds immense promise for enhancing the reasoning capabilities of diffusion large language models (dLLMs). However, progress is fundamentally constrained by a dual misalignment between authentic generation trajectory and the gradient update process: (i) Process-reward misalignment. Sparse, terminal rewards are indiscriminately assigned to all intermediate steps of the generation process, failing to provide discriminative credit assignment. (ii) State-trajectory misalignment. Policy updates are often diverted toward artificial, out-of-trajectory states, squandering gradients on less informative samples. To address these limitations, we introduce Process Aligned Policy Optimization (PAPO), a novel framework that holistically aligns the RL update with the dLLM's generative trajectory via Step-Aware Process Rewards (SPR) that transform sparse terminal rewards into dense, step-wise credit, and Entropy-Guided Historical Re-enactment (EHR) that replays authentic trajectories at high-uncertainty steps. Extensive experiments on four benchmarks demonstrate that PAPO significantly outperforms baselines, achieving gains of up to 4.5% on GSM8K, 4.8% on MATH500, 42.2% on Countdown and 16.1% on Sudoku.
Abstract:Reinforcement learning (RL) holds immense promise for enhancing the reasoning capabilities of diffusion large language models (dLLMs). However, progress is fundamentally constrained by a dual misalignment between authentic generation trajectory and the gradient update process: (i) Process-reward misalignment. Sparse, terminal rewards are indiscriminately assigned to all intermediate steps of the generation process, failing to provide discriminative credit assignment. (ii) State-trajectory misalignment. Policy updates are often diverted toward artificial, out-of-trajectory states, squandering gradients on less informative samples. To address these limitations, we introduce Process Aligned Policy Optimization (PAPO), a novel framework that holistically aligns the RL update with the dLLM's generative trajectory via Step-Aware Process Rewards (SPR) that transform sparse terminal rewards into dense, step-wise credit, and Entropy-Guided Historical Re-enactment (EHR) that replays authentic trajectories at high-uncertainty steps. Extensive experiments on four benchmarks demonstrate that PAPO significantly outperforms baselines, achieving gains of up to 4.5% on GSM8K, 4.8% on MATH500, 42.2% on Countdown and 16.1% on Sudoku.
Computation and Language (cs.CL)
arXiv:2606.08501 [cs.CL]
(or arXiv:2606.08501v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2606.08501 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 251 words
Related coverage
Uni-LaDiR: Latent Diffusion Unifies Multimodal Reasoning
arXiv · Sep 18, 2026
Reasoning with Continuous Latent Diffusion
arXiv · Sep 29, 2026
Adaptive Test-Time Compute Allocation for Block Diffusion Language Models in Complex Reasoning
arXiv · Aug 25, 2026
Test-Time Scaling with Diffusion Language Models via Reward-Guided Stitching
arXiv · Oct 10, 2026