Unmask the State: When Does State Adaptation Matter for Masked Diffusion Language Models

Injin Kong, Sunghwan Choi, Yohan Jo

Seoul National University

Published September 27, 2026 · on the feed October 1, 2026 · ▲ 42 · arXiv 2609.33355

Model architecture No code arXiv ↗Hugging Face ↗

The abstract

Masked diffusion language models (MDMs) admit flexible generation orders, making the unmasking strategy an inference decision. Existing methods vary in how they prioritize positions, control parallelism, restrict selection regions, revise predictions, or plan future denoising, yet it remains unclear when these choices should change during generation. We study this question through strategy reversals, where an alternative action becomes preferable to a fixed choice. We organize MDM inference into five axes--score, cardinality, region, commitment, and planning--and define adaptation opportunity as the one-step utility advantage of the best candidate action over a validation-selected fixed action. This view shows that adaptation value depends on both the frequency and magnitude of such reversals. Across three MDMs and ten tasks, adaptation opportunities are highly heterogeneous, with some regimes exhibiting concentrated and predictable one-step gains. This motivates selective adaptation: lightweight detectors calibrated on validation prompts identify high-opportunity states, capturing, for example, 56.9 percent of the candidate-set oracle opportunity by adapting only the top 10 percent of states on LLaDA-8B constrained JSON filling. Our transition-level results suggest that state adaptation is most useful when applied selectively rather than uniformly.

The Brief

2:28

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Unmask the State. When Does State Adaptation Matter for Masked Diffusion Language Models. By Injin Kong and two others, from Seoul National University. Published on the twenty-seventh of September. No code repository is linked to it.

Masked diffusion language models, MDMs, can generate in flexible orders, which turns the unmasking strategy into a decision made at inference. Existing methods differ in how they prioritize positions, control parallelism, restrict where selection happens, revise predictions, or plan future denoising. What stays unclear is when those choices ought to change partway through generation. A fixed strategy holds the same choice from the first token to the last. The open question is whether, and where, switching would pay off.

The authors approach this through strategy reversals: moments where some alternative action becomes better than a fixed choice. They organize MDM inference along five axes, namely score, cardinality, region, commitment, and planning. Adaptation opportunity is then defined as the one-step utility advantage of the best candidate action over a fixed action chosen on validation data. Seen this way, the value of adapting depends on two things: how often reversals happen, and how large they are. Rare but large reversals and frequent but tiny ones are different situations, and a single average would hide the difference.

Across three MDMs and ten tasks, adaptation opportunities turn out highly heterogeneous. Some regimes show one-step gains that are concentrated and predictable. That points to selective adaptation. Lightweight detectors, calibrated on validation prompts, pick out the high-opportunity states. In one example, LLaDA-8B on constrained JSON filling, adapting only the top ten percent of states captures fifty-six point nine percent of the candidate-set oracle opportunity. A tenth of the decisions, in other words, accounts for more than half of what an oracle choosing among the candidates could have gained in that setting.

These are transition-level results, built on a one-step measure of utility and on a candidate set of actions, so the oracle being approached is the best of those candidates. Within that frame, they suggest that state adaptation is most useful when applied selectively rather than everywhere.

Picture adaptive decoding as a switch one could leave on all the time. The evidence here says its value is uneven from state to state. Where gains are concentrated and predictable, a cheap detector can find them, and those states are where adapting belongs.

Paper Quest · 7 chapters · about 40 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

A diffusion model can write in any order. That freedom raises a question nobody has settled.

You decode with a masked diffusion language model: it fills in hidden tokens over many steps, in any order. At every step you choose which positions to reveal, how many, where, and whether to revise.

The road ahead

  1. 1 · The problem ~6 min A masked diffusion model lets you choose how to unmask at every step, yet most decoders lock those choices in for the whole run.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~9 min Keep a strong fixed unmasking action by default and switch only at the few states where a cheap detector predicts a big gain.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min Name the decision axes, set a validated default, measure each state's gain, calibrate a detector, then adapt only where it flags.
  6. 6 · The experiment ~6 min You’ll guess: On LLaDA-8B constrained JSON filling, adapting only the top 10 percent of states captured what share of the candidate-set oracle opportunity?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.