Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions

Analyzes the trade-off between difficult training-time infilling and flexible inference-time token order in masked diffusion. Theory and experiments show how adaptive decoding can avoid difficult subproblems.

Analyzes the trade-off between difficult training-time infilling and flexible inference-time token order in masked diffusion. Theory and experiments show how adaptive decoding can avoid difficult subproblems.

When reading the original paper, identify its problem, inputs, outputs, and methodological assumptions.

Analyzes the trade-off between difficult training-time infilling and flexible inference-time token order in masked diffusion. Theory and experiments show how adaptive decoding can avoid difficult subproblems.

Check the baselines, datasets, evaluation protocol, and ablations in the original paper. This directory overview does not provide an independent evaluation or experimental results table.