aiqbench analysis
This research presents a novel post-training technique for diffusion language models that minimizes distributional divergence in feature space, achieving improved perplexity and accuracy without requiring full sampling trajectories. By leveraging policy gradients and direct differentiation, the method offers an efficient path to enhancing model performance on math and code benchmarks while maintaining computational efficiency.
Representation-Space MMD for Diffusion Language Models
arXiv:2610.06648v1 Announce Type: new 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.
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.
Tech Report. Code: this https URL
Computation and Language (cs.CL); Machine Learning (cs.LG)
arXiv:2610.06648 [cs.CL]
(or arXiv:2610.06648v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2610.06648 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 234 words
Related coverage
Dyna-2: General Purpose Physical Agents with Hour-Long Autonomy — Jason Ma, Dyna Robotics
Latent Space · Oct 13, 2026
AURORA-LM: Autoencoding Unified Representation for Continuous-Latent Diffusion Language Modeling
arXiv · Aug 4, 2026
Where Should Diffusion Enter a Language Model? Geometry-Guided Hidden-State Replacement
arXiv · Sep 30, 2026
Does DiffusionGemma do latent reasoning?
AI Alignment Forum · Aug 16, 2026