🤖 AI Summary
Pretrained masked diffusion models suffer from irreversible decision-making and poor generation quality under low-step sampling. To address this, we propose the star-shaped sampling paradigm: it reformulates sequential generation as a multi-branch parallel re-generation process centered on the initial mask, and introduces a lightweight learnable remasking scheduler to dynamically optimize mask-updating strategies across branches. Our method requires only fine-tuning a single network layer to adapt existing models. Experiments demonstrate substantial improvements in generation quality and stability under ultra-low-step regimes (e.g., 4–8 steps) for both text and code generation tasks. It outperforms or matches state-of-the-art acceleration methods, and—crucially—enables the first efficient, correctable, non-Markovian generation process in masked diffusion models.
📝 Abstract
The performance of pre-trained masked diffusion models is often constrained by their sampling procedure, which makes decisions irreversible and struggles in low-step generation regimes. We introduce a novel sampling algorithm that works with pre-trained models and, after a lightweight fine-tuning of a single layer, significantly improves sample quality and efficiency. Our method reformulates the generation process using a star-shaped paradigm, which inherently allows for error correction. To make this process effective, we augment it with a learnable re-masking scheduler that intelligently identifies and revises likely errors. This approach yields a substantial quality boost, particularly when using a small number of sampling steps. We extensively ablate key components of our approach and show its usability in different scenarios. In comprehensive experiments on text, and code generation, our sampling algorithm outperforms or matches existing methods.