Forward-Free Diffusion Language Models with BPTT-Free Looped Refinement

Diffusion language models generate text through iterative denoising, offering a powerful alternative to autoregressive generation. However, discrete language spaces lack a natural neighborhood structure for defining effective perturbations, motivating artificial corruption schemes in the forward process. Such prescribed forward processes often produce states that are mathematically convenient but misaligned with the drafts and errors encountered during generation, resulting in degraded sample quality. To address this limitation, we propose FReDA, a forward-free diffusion language model that eliminates the need for a hand-designed forward process. We formulate diffusion language modeling as recursive distribution refinement, in which model-generated drafts serve as implicit intermediate states and the learned refinement model progressively moves the draft distribution toward the target distribution. Training detaches the preceding refinement passes and backpropagates only through the final pass, avoiding backpropagation through time (BPTT) across refinement iterations while retaining standard backpropagation within the final Transformer pass. Concretely, FReDA refines drafts by proposing candidate sequences and either directly performing self-refinement or selecting among parallel candidates via Best-of-N refinement. With this design, FReDA is neighborhood-agnostic, sampler-adaptive, and compatible with flexible refinement parameterizations. Extensive evaluations in the sub-8B regime show that FReDA-4B outperforms larger diffusion base models on reasoning and coding benchmarks, achieving absolute gains of up to 15%, while reaching a 1.5-1.8x average speedup over diffusion baselines and scaling effectively with additional refinement computation.