Simple Diffusion Language Models Are More Effective Few-Step Generators Than Reported
cs.CL, cs.LG
Submitted: 2026-09-27
Updated: 2026-09-27
Code: https://github.com/shasanamin/more-effective-dlms
Project page: https://skylion007.github.io/OpenWebTextCorpus
License: http://creativecommons.org/licenses/by/4.0/
The gist: Diffusion language models (DLMs) promise fast parallel generation, yet high-quality samples often require large number of refinement steps, which diminishes their advantage in practice.
Terminology
Abstract
Diffusion language models (DLMs) promise fast parallel generation, yet high-quality samples often require large number of refinement steps, which diminishes their advantage in practice. This has led to massive interest in and rapid development of new methods for effective few-step generation. We show that much of the supposed quality gap at few steps can instead arise from a suboptimally configured sampler. Modest sampler sharpening, without any model retraining, enables a couple years old masked DLM to rival supposedly far improved successors. This differently sampled DLM in fact achieves lower generative perplexity in just 16 steps than what its standard sampler obtains with 1024, while improving both judged quality and semantic diversity. We further show that conventional per-output metrics can fundamentally obscure these gains, since any optimal trade-off between two such metrics can be attained by a generator supported on at most two outputs. We subsequently introduce GroupEval, which separately evaluates quality and across-output semantic diversity, and offers fresh insights including uncovering how 1.5-4.7x perplexity gains of a distilled model yield no corresponding quality gain. Finally, we explain why sharpening helps: parallel unmasking destroys dependencies among simultaneously generated tokens, creating a gap between prediction and generation. We prove that pervasive temperature choice of one is generically suboptimal under parallel sampling even for an exact denoiser, and that worse predictions can yield better samples. Through these results, we argue for a broader evaluation principle of treating the deployed generator as the object of comparison, benchmarking it against tuned baselines, and assessing quality and diversity jointly and with more human-aligned measures.
Sources
- Latent-Kernel Discrete Flow Maps for Few-Step Generation
- Enabling Approximate Joint Sampling in Diffusion LMs
- Evaluating Large Language Models Trained on Code
- Training Verifiers to Solve Math Word Problems
- Uniform Diffusion Models Revisited: Leave-One-Out Denoiser and Absorbing State Reformulation
- Error Bounds and Optimal Schedules for Masked Diffusions with Factorized Approximations
- Attention-Discounted Adaptive Sampler for Masked Diffusion Language Models
- CaRE Compute-aware Remasking Evaluation Protocol for Masked Diffusion Language Models
- The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity
- Qwen3 Technical Report
- Dream 7B: Diffusion Large Language Models
- Generation Order and Parallel Decoding in Masked Diffusion Models: An Information-Theoretic Perspective
- NoveltyBench: Evaluating Language Models for Humanlike Diversity
Related papers
- Exploring Solution Divergence and Its Effect on Large Language Model Problem Solving
- Ishigaki-IDS-Bench: A Benchmark for Generating Information Delivery Specification from BIM Information Requirements
- Subliminal Steering: Stronger Encoding of Hidden Signals
- MedStruct-S: A Benchmark for Key Discovery, Key-Conditioned QA and Semi-Structured Extraction from OCR Clinical Reports
- The End of Transformers? On Challenging Attention and the Rise of Sub-Quadratic Architectures
- Untangling the Mechanisms of Misleading Context in Medical Question Answering