dUltra: Ultra-Fast Diffusion Language Models via Reinforcement Learning

Shirui Chen, Jiantao Jiao, Lillian J. Ratliff, Banghua Zhu
12/24/2025
cs.LGcs.AI

No official code found. Best implementation: chinsengi/dUltra-os (18 stars, Apache-2.0, last commit 2026-04-17).

Abstract

Masked diffusion language models (MDLMs) offer the potential for parallel token generation, but most open-source MDLMs decode fewer than 5 tokens per model forward pass even with sophisticated sampling strategies. As a result, their sampling speeds are often comparable to AR + speculative decoding schemes, limiting their advantage over mainstream autoregressive approaches. Existing distillation-based accelerators (dParallel, d3LLM) finetune MDLMs on trajectories generated by a base model, which can become off-policy during finetuning and restrict performance to the quality of the base model's samples. We propose \texttt{dUltra}, an on-policy reinforcement learning framework based on Group Relative Policy Optimization (GRPO) that learns unmasking strategies for efficient parallel decoding. dUltra introduces an unmasking planner head that predicts per-token unmasking likelihoods under independent Bernoulli distributions. We jointly optimize the base diffusion LLM and the unmasking order planner using reward signals combining verifiable reward, distillation reward, and the number of unmasking steps. Across mathematical reasoning and code generation tasks, dUltra improves the accuracy--efficiency trade-off over state-of-the-art heuristic and distillation baselines, moving towards achieving ``diffusion supremacy'' over autoregressive models.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

dUltra: Ultra-Fast Diffusion Large Language Models via Reinforcement Learning

183Shell, PythonJan 11, 20266 months agoApache-2.0

Similar Papers

Cite this paper

@article{chen2025dultra,
  title  = {dUltra: Ultra-Fast Diffusion Language Models via Reinforcement Learning},
  author = {Shirui Chen and Jiantao Jiao and Lillian J. Ratliff and Banghua Zhu},
  year   = {2025},
  eprint = {2512.21446},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.21446v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.21446.svg)](https://codeofpaper.com/paper/2512.21446)

Discussion