Free Lunch for Pass@$k$? Low Cost Diverse Sampling for Diffusion Language Models
Sean Lamont ⋅ Christian Walder ⋅ Paul Montague ⋅ Amir Dezfouli ⋅ Michael Norrish
Abstract
Diverse outputs in text generation are necessary for effective exploration in complex reasoning tasks, such as code generation and mathematical problem solving. Such Pass@$k$ problems benefit from distinct candidates covering the solution space. However, traditional sampling approaches often waste computational resources on repetitive failure modes. While Diffusion Language Models have emerged as a competitive alternative to the prevailing Autoregressive paradigm, they remain susceptible to this redundancy, with independent samples frequently collapsing into similar modes. To address this, we propose a training free, low cost intervention to enhance generative diversity in Diffusion Language Models. Our approach modifies intermediate samples in a batch sequentially, where each sample is repelled from the feature space of previous samples, actively penalising redundancy. Unlike prior methods that require retraining or beam search, our strategy incurs negligible computational overhead, while ensuring that each sample contributes a unique perspective to the batch. We evaluate our method on HumanEval and GSM8K using the LLaDA-8B-Instruct and Dream-v0-Instruct-7B models, where we demonstrate significantly improved diversity and Pass@$k$ performance across various sampling settings. As a simple modification to the sampling process, our method offers an immediate, low cost improvement for current and future Diffusion Language Models in tasks that benefit from diverse solution search.
Chat is not available.
Successful Page Load