将掩码机制引入流模型,实现高效多步推理的文本生成。
Masked Language Flow Models
- 用连续随机插值连接部分掩码与完整序列,支持条件生成。
- 可将预训练掩码扩散模型轻量转换为流模型,保持高效采样。
- 新采样器交替进行去噪与置信度高的词解掩,支持复杂推理任务。
掩码扩散模型(MDMs)承诺快速并行语言生成,但其反向过程在词元位置上独立假设,在少步采样时效率优势受限。流语言模型(FLMs)通过学习连续流将噪声映射至欧氏空间中的干净序列,可实现单步生成,但因需逐个解码所有词元,难以处理需要多步推理的复杂任务。为此,我们提出掩码语言流模型(MLFMs),通过连续随机插值将部分掩码序列与完整序列连接,使流模型具备条件生成能力,并能以轻量方式将预训练的MDMs转化为MLFMs。基于此灵活性,我们设计一种新采样器,交替执行连续去噪与置信度高词元的离散解掩,更有效支持多步推理。我们在GSM8K和MT-Bench上评估该方法,首次证明流模型可扩展至解决下游推理与指令遵循任务。
原文摘要 · Abstract (English)
Masked Diffusion Models (MDMs) promise fast, parallel language generation, but their reverse transition factorises across token positions -- an approximation that breaks down in the few-step sampling regime where parallel generation ought to provide the greatest efficiency gains. Flow Language Models (FLMs) sidestep this limitation by learning a continuous flow that transports noise toward clean sequences represented in Euclidean space, inducing a flow map that can be distilled for single-step generation. However, this makes complex tasks requiring multi-step reasoning problematic for FLMs, as FLMs are forced to decode every token during generation. To address this, we introduce Masked Language Flow Models (MLFMs), which incorporate masking into FLMs using a continuous stochastic interpolant to bridge partially masked and clean sequences. This design enables conditional generation via continuous flows and allows pretrained MDMs to be converted into MLFMs through a simple, lightweight adaptation. Leveraging this flexibility, we propose a novel sampler that alternates continuous denoising with the discrete unmasking of confident tokens to better support multi-step reasoning. We evaluate our approach on GSM8K and MT-Bench and find, for the first time, that flow-based language models can be scaled to solve downstream reasoning and instruction-following tasks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。