Supportive Token Revealing for Fast Diffusion Language Model Decoding

📰 ArXiv cs.AI

arXiv:2606.04236v1 Announce Type: cross Abstract: Discrete diffusion language models can generate text efficiently by updating multiple masked positions in parallel, but this parallelism introduces a quality-latency trade-off. Aggressive decoding may commit mutually dependent tokens too early, while conservative decoding requires many denoising steps. Existing methods address this tension by deciding which tokens are safe to reveal using confidence or dependency criteria. However, avoiding unsaf

Published 4 Jun 2026
Read full paper → ← Back to Reads