arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.01849cs.LG
收藏

自奖励序列蒙特卡洛方法用于掩码扩散语言模型

Self-Rewarding Sequential Monte Carlo for Masked Diffusion Language Models

Uppsala University, Sweden(乌普萨拉大学,瑞典);Nanyang Technological University, Singapore(南洋理工大学,新加坡)

Ziwei Luo, Ziqi Jin, Lei Wang, Lidong Bing, Thomas B. Schön

AI总结:

本文提出自奖励序列蒙特卡洛方法,用于提升掩码扩散语言模型的采样质量,通过引入轨迹级置信度信号改进生成多样性。

摘要:

本文提出了自奖励序列蒙特卡洛(SMC)方法,这是一种推理时间扩展算法,能够有效采样掩码扩散语言模型(MDLMs)。我们的算法源于观察到大多数现有MDLMs依赖于基于置信度的采样策略,其中在每一步只保留预测置信度最高的token。这限制了生成过程到一种对噪声敏感的贪心解码范式,导致可能路径的多样性不可避免地降低。我们通过并行启动多个相互作用的扩散过程(称为粒子)来解决这个问题,用于轨迹探索。重要的是,我们引入了轨迹级置信度作为自奖励信号,用于分配粒子的重要性权重。在采样过程中,粒子被迭代加权和重采样,以系统地将生成过程引导到全球置信度高、高质量的样本。我们的自奖励SMC在各种掩码扩散语言模型和基准上得到验证,实现了显著改进,而无需额外训练或奖励指导,同时有效将并行推理能力转化为改进的采样质量。我们的代码可在https://github.com/Algolzw/self-rewarding-smc上获得。

英文摘要:

This work presents self-rewarding sequential Monte Carlo (SMC), an inference-time scaling algorithm enabling effective sampling of masked diffusion language models (MDLMs). Our algorithm stems from the observation that most existing MDLMs rely on a confidence-based sampling strategy, where only tokens with the highest prediction confidence are preserved at each step. This restricts the generation to a noise-sensitive, greedy decoding paradigm, resulting in an inevitable collapse in the diversity of possible paths. We address this problem by launching multiple interacting diffusion processes in parallel, referred to as particles, for trajectory exploration. Importantly, we introduce the trajectory-level confidence as a self-rewarding signal for assigning particle importance weights. During sampling, particles are iteratively weighted and resampled to systematically steer generation towards globally confident, high-quality samples. Our self-rewarding SMC is verified on various masked diffusion language models and benchmarks, achieving significant improvement without extra training or reward guidance, while effectively converting parallel inference capacity into improved sampling quality. Our code is available at https://github.com/Algolzw/self-rewarding-smc.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑