TL;DR
This paper introduces Token Timestep Allocation (TTA), a novel method that improves the controllability and fluency of diffusion language models by explicitly ordering token updates, thereby reducing update forgetting and enhancing refinement.
Contribution
The paper proposes TTA, a new inference-time technique for token ordering in diffusion language models, which significantly improves control and quality of generated text.
Findings
TTA increases sentiment control accuracy by over 20%.
TTA nearly halves perplexity compared to baseline methods.
TTA reduces toxicity levels in detoxification tasks.
Abstract
While diffusion language models (DLMs) enable fine-grained refinement, their practical controllability remains fragile. We identify and formally characterize a central failure mode called update forgetting, in which uniform and context agnostic updates induce token level fluctuations across timesteps, erasing earlier semantic edits and disrupting the cumulative refinement process, thereby degrading fluency and coherence. As this failure originates in uniform and context agnostic updates, effective control demands explicit token ordering. We propose Token Timestep Allocation (TTA), which realizes soft and semantic token ordering via per token timestep schedules: critical tokens are frozen early, while uncertain tokens receive continued refinement. This timestep based ordering can be instantiated as either a fixed policy or an adaptive policy driven by task signals, thereby supporting a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
