Left: ARMs generate tokens sequentially via causal conditioning, while dLLMs unmask multiple tokens in parallel through a multi-step diffusion process. Right: dTRPO estimates trajectory probability ratios by sampling one timestep per block, collecting only the newly unmasked token probabilities. All schedule-dependent coefficients cancel in the ratio, enabling efficient offline policy optimization with a single forward pass.
Diffusion Large Language Models (dLLMs) introduce a new paradigm for language generation, which in turn presents new challenges for aligning them with human preferences. In this work, we aim to improve the policy optimization for dLLMs by reducing the cost of the trajectory probability calculation, thereby enabling scaled-up offline policy training. We prove that: (i) under reference policy regularization, the probability ratio of the newly unmasked tokens is an unbiased estimate of that of intermediate diffusion states, and (ii) the probability of the full trajectory can be effectively estimated with a single forward pass of a re-masked final state. By integrating these two trajectory reduction strategies into a policy optimization objective, we propose dTRPO (dLLM Trajectory Reduction Policy Optimization). We evaluate dTRPO on 7B dLLMs across instruction-following and reasoning benchmarks. Results show that it substantially improves the core performance of state-of-the-art dLLMs, achieving gains of up to 9.6% on STEM tasks, up to 4.3% on coding tasks, and up to 3.0% on instruction-following tasks. Moreover, dTRPO exhibits strong training efficiency due to its offline, single-forward nature, and achieves improved generation efficiency through high-quality outputs.
The trajectory probability can be unbiased estimated with one sampled timestep per block:
This reduces computation from $T$ timesteps to $N_B$ blocks, enabling a single forward pass via block attention.
If we only need ratios between the current policy and a reference policy in policy optimization, all schedule-dependent coefficients cancel in the ratio:
where $\mathcal{I}_t$ is the set of newly unmasked coordinates at step $t$. The ratio depends only on categorical probabilities at newly unmasked positions, independent of the masking schedule.
Combining both reductions with DPO, the final objective is:
where $S(\pmb{y}; \theta, \text{ref})$ sums log probability ratios over newly unmasked tokens across all blocks. This enables offline, single-forward-pass training comparable to DPO for ARMs.
Performance of dLLMs under zero-shot evaluation. dTRPO achieves overall best performance and closes the gap to strong ARMs.
| Model | GPQA(cot, diamond) | GSM8K(cot) | MATH | LCBv6 | MBPP+(extra) | HEval+(extra) | IFEval(prompt) | ArenaHard(V2.0) | MTBench |
|---|---|---|---|---|---|---|---|---|---|
| dLLM from Scratch | |||||||||
| LLaDA Instruct | 19.19 | 78.47 | 42.48 | 6.07 | 38.1 | 34.1 | 53.23 | - | - |
| LLaDA 1.5 | 19.19 | 79.45 | 43.64 | 6.54 | 37.0 | 39.0 | 59.52 | - | - |
| Qwen 2.5 7B Instruct vs. dLLM from Qwen2.5 7B Instruct | |||||||||
| Qwen2.5 Instruct | 36.36 | 87.87 | 73.06 | 24.42 | 67.5 | 74.4 | 71.38 | 10.43 | 8.08 |
| Dream Instruct | 28.79 | 75.36 | 50.22 | 12.61 | 54.5 | 53.0 | 50.65 | 6.79 | 3.88 |
| Fast-dLLM-v2 | 20.71 | 82.34 | 60.26 | 11.56 | 51.6 | 59.1 | 62.11 | 1.26 | 3.17 |
| Fast-dLLM-v2+ELBO | 12.63 | 79.98 | 58.48 | 11.56 | 52.4 | 59.1 | 51.02 | 0.17 | 1.01 |
| Fast-dLLM-v2+VRPO | 24.24 | 83.17 | 63.32 | 12.89 | 50.5 | 57.3 | 65.06 | 7.32 | 6.37 |
| Fast-dLLM-v2+DPO w/ MF | 23.74 | 85.37 | 63.20 | 11.00 | 46.3 | 51.8 | 65.62 | 6.02 | 6.48 |
| Fast-dLLM-v2+dTRPO (Ours) | 30.30 | 85.97 | 64.30 | 15.17 | 51.6 | 63.4 | 65.06 | 7.41 | 6.53 |
Side-by-side comparison of generation outputs on Arena-Hard V2.0 from Qwen 2.5, Fast-dLLM-v2, and our dTRPO model.