mlsanityData to 7 Oct 2026

Learning to Re-Draft: A Variational Stackelberg Game for Discrete Diffusion

arXiv 2609.35166 ↗First posted 28 Sep 2026cs.LG cs.AIcited by 0

On the map: Diffusion models → Diffusion foundations and sampling also fits: Discrete and text diffusion

Abstract (arXiv)

Discrete diffusion models offer the ability to re-draft, revisiting and correcting earlier tokens throughout generation. This capability depends on the forward corruption process that defines what the denoiser learns to correct. Masked diffusion models fix tokens once they are unmasked, while uniform diffusion permits revisions but relies on uniformly random token substitutions. We instead learn which substitutions are most useful for training the denoiser to re-draft. We introduce Variational Stackelberg Discrete Diffusion (VSDD), a framework for learning a semantically aware corruption process. VSDD formulates training as a leader-follower game: the leader defines a Markovian corruption process parameterized by the denoiser's token embeddings, while the follower optimizes a variational denoising objective with the corruption process held fixed. The leader rewards corruptions based on how much the denoiser improves after learning from them, rather than on how easily the current denoiser can reconstruct them. We measure this improvement under a fixed reference corruption process, approximate the follower's response with a one-step gradient update, and optimize the leader using a score-function estimator. We evaluate VSDD across molecular, text, and playlist generation. VSDD substantially improves molecular validity over uniform and masked diffusion, reduces text perplexity relative to uniform diffusion while remaining competitive with masked diffusion, and achieves sizable improvements in offline playlist recommendation metrics.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Diffusion foundations and sampling, one of 14 directions in Diffusion models. Builds on 17 of its 26 references that are in the map. First posted on arXiv 28 Sep 2026.

Builds on

17 of 26 references.

Closest ancestors · 6

Same direction, newest first

  1. 2026Forward-Learned Discrete Diffusion: Learning how to noise to denoise faster18 May
  2. 2021Structured Denoising Diffusion Models in Discrete State-Spaces7 Jul
  3. 2021Variational Diffusion Models1 Jul
  4. 2021Improved Denoising Diffusion Probabilistic Models18 Feb
  5. 2020Score-Based Generative Modeling through Stochastic Differential Equations26 Nov
  6. 2020Denoising Diffusion Probabilistic Models19 Jun

Other references · 11

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
  3. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  4. 2015A Diversity-Promoting Objective Function for Neural Conversation Modelscited by 1,068
  5. 2024Simple and Effective Masked Diffusion Language Modelscited by 800
  6. 2015Scheduled Sampling for Sequence Prediction with Recurrent Neural Networkscited by 779
  7. 2023Discrete Diffusion Modeling by Estimating the Ratios of the Data Distributioncited by 712
  8. 2024Simplified and Generalized Masked Diffusion for Discrete Datacited by 606
  9. 2015Sequence Level Training with Recurrent Neural Networkscited by 568
  10. 2021Argmax Flows and Multinomial Diffusion: Learning Categorical Distributionscited by 566
  11. 2023TinyStories: How Small Can Language Models Be and Still Speak Coherent English?cited by 425

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Learned Relay Representations for Forward-Thinking Discrete Diffusion Models
  2. 2026Divide-and-Denoise: A Game-Theoretic Method for Fairly Composing Diffusion Models
  3. 2026D-DOIT: Training-free Adaptation of Discrete Diffusion via Doob's h-Transform
  4. 2026Diffusion as a Training Curriculum for Timestep-Free Iterative Reasoning
  5. 2026Less Uniform Discrete Diffusion is More Powerful and Scalable
  6. 2025Variational Masked Diffusion Models
  7. 2025Fewer Denoising Steps or Cheaper Per-Step Inference: Towards Compute-Optimal Diffusion Model Deployment
  8. 2026Let It Go or Learn to Self-Correct: Continuous Diffusion for Constrained Discrete Tasks