arXiv:2509.22738cs.CLcs.LG2025-09被引 7

提出一种近似联合采样方法,让扩散语言模型并行生成多个词且更接近真实分布。

Enabling Approximate Joint Sampling in Diffusion LMs

  • 设计轻量级采样层,在一次完整前向传播后多次运行,实现多词并行解码。
  • 四词并行时MAUVE得分0.87,远超基线的0.31,兼顾速度与质量。
  • 适用于预训练和指令微调模型,尤其适合需快速生成的数学与编程任务。

在自回归语言模型中,每个词的采样都基于之前所有词,从而从模型所表示的正确联合分布中生成序列。相比之下,掩码扩散语言模型以非顺序、可能并行的方式解码词元。若要生成符合真实联合分布的完整序列,需在每次完整前向传播中仅解码一个词元。并行解码的词元越多,结果越偏离真实分布,表现为准确率下降(但速度提升)。本文提出一种方法,在单次完整模型前向传播中近似采样多个词元:在现有大型扩散语言模型上构建轻量级单层“采样器”。一次完整前向传播后,可多次运行该采样层,生成多个未掩码词元。采样器通过模仿冻结的完整模型的精确联合采样进行训练。实验表明,该近似联合采样在预训练模型(Dream-7B-Base、Llada-7B-Base)和指令微调模型(Dream-7B-Instruct、Dream-7B-Coder)上均有效,适用于语言建模、数学与编程任务。当每轮去噪步骤解码四个词元时,其相对于真实联合分布的MAUVE得分为0.87(边际基线为0.31)。

原文摘要 · Abstract (English)

In autoregressive language models, each token is sampled by conditioning on all the past tokens; the overall string has thus been sampled from the correct underlying joint distribution represented by the model. In contrast, masked diffusion language models generate text by unmasking tokens out of order and potentially in parallel. Generating an overall string sampled from the correct underlying joint distribution would (again) require exactly one token unmasking in every full-model forward pass. The more tokens unmasked in parallel, the further away the string is from the true joint; this can be seen in the resulting drop in accuracy (but, increase in speed). In this paper we devise a way to {\em approximately} sample multiple tokens from the joint distribution in a single full-model forward pass; we do so by developing a new lightweight single-layer ``sampler" on top of an existing large diffusion LM. One forward pass of the full model can now be followed by multiple forward passes of only this sampler layer, to yield multiple unmasked tokens. Our sampler is trained to mimic exact joint sampling from the (frozen) full model. We show the effectiveness of our approximate joint sampling for both pretrained-only (Dream-7B-Base, Llada-7B-Base) and instruction-tuned (Dream-7B-Instruct, Dream-7B-Coder) models on language modeling and math \& coding tasks. When four tokens are unmasked for each full-model denoising step, our sampling algorithm achieves a MAUVE score of 0.87 (vs marginal baseline of 0.31) with respect to the true joint distribution.

扩散模型文本生成并行采样语言模型

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