Schedule optimization for tau-leaping in masked discrete diffusion

Paper recorded by Signals 4 on 2026-09-18 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-18 on arXiv · recorded by Signals 4 on 2026-09-21

Category: cs.LG · 机器学习 · first seen 2026-09-21

Abstract

Masked discrete diffusion models are commonly accelerated using the so-called tau-leaping discretization method, which reveals several coordinates in parallel at each sampling step. The sampler replaces the joint conditional law of each revealed block by a product distribution, incurring a factorization error $\varepsilon_\text{fact}$ present even with perfectly learned predictors. We analyze the

Read on arXiv →