Sign inGet started
Paper · arXiv

ForkGRPO: Efficient Exploration and Fine-Grained Credit Assignment for Diffusion Language Models

Diffusion large language models (dLLMs) have advanced rapidly, yet strengthening their reasoning through reinforcement learning (RL) remains an open challenge. Any-order generation can suffer from entropy degradation, which narrows the reasoning paths available for exploration. Recent work mitigates this issue by applying standard GRPO with left-to-right generation. However, independently generating every rollout from the input prompt can leave alternative continuations from intermediate states underexplored, while trajectory-level advantages assign uniform credit to all tokens without distinguishing the contributions of individual reasoning segments. We propose ForkGRPO, an RL framework ...

AuthorsZhaoyan Jia, Chengwei Zhou, Gourav Datta et al.
Primary categorycs.CL
Published14 October 2026
Last updated at source14 October 2026
cs.CL
Embed this entry
<iframe src="https://silytics.si/embed/item/4ab20078-5cb3-48d5-a6f4-874f9b2acc27" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 15 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.