Diffusion Language Models are Super Data Learners

Jinjie Ni, Qian Liu, Longxu Dou, Chao Du, Zili Wang +3 more
11/5/2025
cs.LG

No official code found. Best implementation: JinjieNi/dlms-are-super-data-learners (227 stars, last commit 2025-11-06).

Abstract

Under strictly controlled pre-training settings, we observe a Crossover: when unique data is limited, diffusion language models (DLMs) consistently surpass autoregressive (AR) models by training for more epochs. The crossover shifts later with more or higher-quality data, earlier with larger models, and persists across dense and sparse architectures. We attribute the gains to three compounding factors: (1) any-order modeling, (2) super-dense compute from iterative bidirectional denoising, and (3) built-in Monte Carlo augmentation; input or parameter noise improves AR under data constraint but cannot close the gap. At scale, a 1.7B DLM trained with a ~1.5T-token compute budget on 10B unique Python tokens overtakes an AR coder trained with strictly matched settings. In addition, a 1B-parameter DLM achieves > 56% accuracy on HellaSwag and > 33% on MMLU using only 1B tokens, without any special tricks, just by repeating standard pre-training data. We also show that rising validation cross-entropy does not imply degraded downstream performance in this regime.

View on arXivView PDF

Code Implementations(1)

The official github repo for "Diffusion Language Models are Super Data Learners".

2278C, C++Aug 9, 202511 months ago

Similar Papers

Cite this paper

@article{ni2025diffusion,
  title  = {Diffusion Language Models are Super Data Learners},
  author = {Jinjie Ni and Qian Liu and Longxu Dou and Chao Du and Zili Wang and Hang Yan and Tianyu Pang and Michael Qizhe Shieh},
  year   = {2025},
  eprint = {2511.03276},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.03276v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.03276.svg)](https://codeofpaper.com/paper/2511.03276)

Discussion