An exact inference algorithm over finite automata enables guaranteed constraint satisfaction in diffusion language models with logarithmic-depth parallel sampling.
Simple and effective masked diffusion language models
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Constrained Decoding for Diffusion Language Models via Efficient Inference over Finite Automata
An exact inference algorithm over finite automata enables guaranteed constraint satisfaction in diffusion language models with logarithmic-depth parallel sampling.