Representation-Space MMD for Diffusion Language Models

Ilya Drobyshevskiy, Ilia Sudakov, Maksim Semenov, Denis Kuznedelev, Maksim Ignatov, Pavel Temirchev, Nikita Balagansky, Viacheslav Meshchaninov and 2 others

Yandex Research · HSE University · Applied AI Institute · AXXX · T-Tech · Constructor University

Published October 5, 2026 · on the feed October 6, 2026 · ▲ 31 · arXiv 2610.06648

The abstract

We introduce a post-training method for diffusion language models (DLMs) that minimizes Maximum Mean Discrepancy (MMD) between generated and reference distributions in the feature space of a frozen pretrained DLM. To estimate MMD, we retain contextual features at individual token positions, obtaining multiple observations per sequence from a single extractor pass. We optimize this objective using policy gradients for discrete models and direct differentiation through generated latents for continuous models. In both cases, computing the loss directly from these features enables efficient post-training without full sampling trajectories or jointly trained auxiliary models. Experiments show lower generative perplexity at comparable entropy on OpenWebText and better accuracy-computation trade-offs on GSM8K. On 16B DMax-LLaDA2.0 models with hybrid masked-uniform diffusion, we increase decoding parallelism with similar or higher accuracy on math and code benchmarks.

The Brief

1:52

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Representation-Space MMD for Diffusion Language Models. By Ilya Drobyshevskiy and nine others, from Yandex Research, HSE University, and four other institutions. Published on the fifth of October. Its code repository is public and real: fourteen source files.

Post-training a diffusion language model needs some measure of how far its generations sit from reference text. The method here is built to get that measure cheaply: without full sampling trajectories, and without auxiliary models trained jointly alongside the one being improved. Those are the two costs it sets out to avoid.

The objective is Maximum Mean Discrepancy, or MMD, between the generated and reference distributions. It is a comparison of two distributions as wholes, rather than of individual samples. And it is measured not on raw text but in the feature space of a frozen, pretrained diffusion language model, which stays fixed throughout.

To estimate MMD, contextual features are kept at individual token positions. A single pass of the extractor therefore yields many observations per sequence rather than one, which is what makes the estimate affordable. The objective is optimized with policy gradients for discrete models, and by differentiating directly through generated latents for continuous ones. Either way, the loss comes straight from those features.

On OpenWebText, generative perplexity is lower at comparable entropy. On GSM8K, the trade-off between accuracy and computation improves. And on sixteen billion parameter DMax-LLaDA2.0 models with hybrid masked-uniform diffusion, decoding parallelism goes up with similar or higher accuracy on math and code benchmarks.

Compactly: a frozen model's features become the measuring stick, every token position counts as a sample, and that is enough to post-train both discrete and continuous diffusion models efficiently, at scales up to sixteen billion parameters.

More with an account

Listen to every day’s papers

Daily playlists, deep dives, quests for the papers, and quizzes on their key terms.

Join free
KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.