Skip to content

Reducing Pretraining-Generation Mismatch in Diffusion Language Models

Aug 2026 · 0 citations · 44 references
Computer Science

TL;DR

Prefix-Conditioned Diffusion (PCD), which samples a boundary, preserves the prefix, preserves the prefix, and denoises the suffix, is proposed, and improvements in reasoning and coding over native diffusion training are shown.

Abstract

Diffusion language models (dLLMs) generate text through iterative denoising, allowing multiple tokens to be predicted in parallel. However, pretraining may mask tokens throughout a sequence, whereas prompt continuation conditions on an intact prefix. This difference remains in conversion pipelines that denoise entire sequences during the stable stage. We propose Prefix-Conditioned Diffusion (PCD), which samples a boundary, preserves the prefix, and denoises the suffix. The training recipe also applies autoregressive supervision to the prefix. We evaluate PCD in the stable stage of a warmup, stable, and decay conversion pipeline, with inference unchanged. Matched experiments across model families show improvements in reasoning and coding over native diffusion training. A matched continuation study further shows that the advantage persists after a shared decay stage. In a separate reconstruction diagnostic, the full PCD recipe's advantage over native diffusion training reverses as more evaluation prefix tokens are masked. Controlled experiments show lower suffix reconstruction loss with a clean training prefix, an intact evaluation prefix, and no autoregressive loss.

View source

Similar papers

#machine learning Preprint Sep 2026

Rethinking Soft Tokens for Parallel Decoding in Diffusion Language Models

Diffusion language models (DLMs) enable parallel generation by predicting and committing multiple tokens at each denoising step, yet they can generate individually plausible but mutually inconsistent tokens. Recent work shows that \emph{soft tokens} can mitigate this issue by representing uncertain positions with conti...

Kodai Kawamura, Kenji Kawaguchi, Anji Liu · 0 citations
Preprint Aug 2026

Accelerating Diffusion Language Models via Structured Suffix Modeling

This work proposes a structured suffix modeling method that incorporates the decoding results from the previous step into the suffix token representations at the current step, allowing them to carry evolving denoising information across generation steps.

Zi-Feng Cheng, Keda Li, Zhiwei Jiang et al. · 0 citations
Preprint Aug 2026

CForce: Boosting Parallel Decoding for dLLMs via Consistency Forcing

This work presents Consistency Forcing (CForce) for dLLMs, a distillation method to force the mask predictions of early stages to align with those of later stages, thereby improving training-inference alignment.

Yujie Ren, Chenkai Xu, Zhuocheng Gong et al. · 1 citation
#artificial intelligence Preprint Sep 2026

In-Place Instruction Following in Diffusion Language Models

GRAFT, an IPP-oriented post-training framework combining constraint-aware SFT and preference optimization is proposed, an IPP-oriented post-training framework combining constraint-aware SFT and preference optimization that raises the average IIF score and preserves general generation ability.

Zheng Nie, Zhe-Rui Li, Jia-Ming Zhang et al. · 0 citations
Review Open access Sep 2026

An overview of discrete diffusion models in natural language processing

Discrete Diffusion Models (DDMs) have recently emerged as a promising paradigm for text generation, providing an alternative to the dominant autoregressive (AR) approach. Unlike AR models that rely on sequential decoding and suffer from exposure bias, DDMs operate in discrete token space through iterative denoising, en...

Yi-Xuan Li, Kai-Dong Yu, Shuang-Yong Song et al. · 0 citations
Preprint Aug 2026

Prefix-Denoising Consistency: Test-Time Verification for Diffusion Language Models

PDC consistently improves upon the initial sample, outperforms independent generations under a computational constrained comparison, and is robust to different unmasking strategies and parameter settings, highlighting prefix-conditioned regeneration as an effective DLM-specific primitive for test-time verification.

Yuki Ichihara, Naoto Iwase, Mohammad Atif Quamar et al. · 0 citations

Related blog posts

Microsoft Research Blog Oct 22, 2026

Flint-interactive: A language for creating interactive data visualizations

Flint-interactive gives AI agents a language for creating interactive visualizations. Click a chart, filter data, highlight related content, and explore beyond the view the author originally chose. The post Flint-interactive: A language for creating interactive data visualizations appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.