arXiv:2603.18806cs.AI2026-03被引 2

提出dTRPO方法,让扩散语言模型训练更快更高效。

dTRPO: Trajectory Reduction in Policy Optimization of Diffusion Large Language Models

  • 用重掩码单次前向计算替代多步轨迹概率,降低计算开销。
  • 在STEM任务上提升9.6%,编码任务提升4.3%,指令跟随提升3.0%。
  • 适合追求高效训练与高质量生成的扩散语言模型研究者。

扩散大语言模型(dLLMs)为语言生成带来新范式,但也带来了对齐人类偏好的新挑战。本文通过降低轨迹概率计算成本,提升dLLMs策略优化效率,实现可扩展的离线策略训练。我们证明:(i) 在参考策略正则化下,新解码词元的概率比是中间扩散状态概率比的无偏估计;(ii) 全轨迹概率可通过重掩码终态的单次前向传播有效估计。将这两项轨迹缩减策略整合进策略优化目标,提出轨迹缩减策略优化(dTRPO)。我们在7B规模dLLM上评估了dTRPO在指令遵循与推理基准上的表现,结果表明其显著提升当前最先进dLLMs的核心性能,在STEM任务上最高提升9.6%,编码任务提升4.3%,指令遵循任务提升3.0%。此外,由于采用离线、单前向特性,dTRPO展现出强大训练效率,并通过高质量输出提升生成效率。

原文摘要 · Abstract (English)

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 Trajectory Reduction Policy Optimization (dTRPO). 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.

扩散模型语言生成策略优化高效训练

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。