Bringing Stability to Diffusion: Decomposing and Reducing Variance of Training Masked Diffusion Models
Mengni Jia, Mengyu Zhou, Yihao Liu, Xiaoxi Jiang, Guanjun Jiang
TL;DR
This work addresses the pronounced training variance of masked diffusion models (MDMs) by deriving the first systematic variance decomposition for MDM training, isolating three sources: masking pattern noise (A), masking rate noise (B), and data noise (C), with autoregressive models (ARMs) affected only by C. Building on this, the authors propose six variance-reduction techniques, centering on two core methods: P-POTS, which uses a Pareto-optimal nonuniform sampling for the masking rate t with an unbiased estimator that minimizes A+B+C, and MIRROR, which introduces negatively correlated masked samples to reduce A; they also introduce ISAD, SyRM, StraTS, and EMA as complementary strategies. Empirical results across text and image tasks show 7–8% accuracy gains on complex reasoning benchmarks and substantial reductions in run-to-run variability, narrowing the training gap with strong ARM baselines. The combination of theoretical variance control and robust empirical improvements demonstrates that stabilized, data-efficient MDM training is achievable, enabling MDMs to approach or surpass ARM performance in several settings. Overall, the paper provides a principled framework and practical toolkit for variance management in masked diffusion models, with broad implications for scalable, stable diffusion-based learning.
Abstract
Masked diffusion models (MDMs) are a promising alternative to autoregressive models (ARMs), but they suffer from inherently much higher training variance. High variance leads to noisier gradient estimates and unstable optimization, so even equally strong pretrained MDMs and ARMs that are competitive at initialization often diverge after task-specific training, with MDMs falling far behind. There has been no theoretical explanation or systematic solution. We derive the first decomposition of MDM training variance into three sources: (A) masking pattern noise, (B) masking rate noise, and (C) data noise, while ARMs are only affected by (C). This explains the fundamental training gap. Building on this foundation, we design six variance-reduction methods, including two core methods: (1) P-POTS, a Pareto-optimal t sampler that minimizes training variance by sampling harder t values more often with appropriately smaller update steps, and (2) MIRROR, which uses negatively correlated samples to reduce (A). Experiments show that compared to standard MDM training, our methods improve accuracy by 7-8% on complex reasoning tasks, while simultaneously reducing run-to-run variability to near ARM levels, substantially narrowing the gap with strong ARM baselines; in most settings, even the best baseline runs remain below the worst run of our method.
