REVIEW 4 major objections 5 minor 19 references
This paper claims that few-step discrete diffusion samplers are not distributionally correct even when the learned denoiser is replaced by an exact oracle posterior, so the sampling dynamics themselves introduce error that standard metrics
Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →
T0 review · deepseek-v4-flash
2026-08-02 21:34 UTC pith:K57GA7OE
load-bearing objection Useful HMM-oracle framework for isolating sampler error, but the abstract overclaims and the LLaDA result is a coupling artifact rather than clean evidence. the 4 major comments →
Is Your Diffusion Sampler Actually Correct? A Sampler-Centric Evaluation of Discrete Diffusion Language Models
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The paper's central claim is that few-step discrete diffusion samplers are not distributionally correct even under an oracle denoiser. Across four sampler families, the empirical token-to-token transition distribution differs from the ground-truth Markov kernel at small step counts, with transition KL, NLL, and entropy approaching the autoregressive baseline only when the number of steps approaches the sequence length; LLaDA is the exception, degenerating further as steps increase instead of converging. The paper further claims that likelihood-based metrics can improve under biased sampling and that MAUVE can remain insensitive to transition-level mismatch, so improvements in those numbers d
What carries the argument
The central object is an oracle evaluation framework built from a ground-truth discrete-time Markov chain over tokens. Partial observations from the masking process turn the chain into a hidden Markov model, and exact forward-backward smoothing yields the posterior marginal at every position; replacing each sampler's learned denoiser with these exact marginals (and, for SEDD, the corresponding concrete scores) while keeping the sampling logic unchanged isolates sampler-induced error. A sparse top-K transition kernel with a small teleport term keeps the exact message passing at O(VK) per step.
Load-bearing premise
The claim that observed error is purely sampler-induced rests on replacing each learned denoiser with the exact HMM posterior without altering the sampling logic, a substitution the paper itself notes fails for LLaDA because that sampler's re-masking relies on denoiser confidence scores carrying linguistic priors the oracle does not share.
What would settle it
Use the paper's own setup (ground-truth Markov prior, oracle posterior, sequence length 1024) and run MDLM with 8 diffusion steps; if the empirical transition KL equals the autoregressive baseline (about 0.2454 in the OpenWebText configuration) or is within statistical noise, the claim of persistent few-step sampler error would be falsified.
If this is right
- If true, fluent or low-NLL output from few-step discrete diffusion samplers cannot be taken as evidence of correct sampling; the sampling dynamics alone can bias the distribution.
- The number of steps is itself a correctness parameter: transition-level mismatch vanishes only as steps approach the sequence length, so step count determines how closely sampling matches the target transition law.
- Generative perplexity can be systematically improved by local sharpening without faithful sampling, so GenPPL should be treated as an evaluator-alignment measure rather than a correctness metric.
- MAUVE can stay high while transition-level errors change substantially, motivating transition-aware metrics such as transition KL, total variation, and entropy rate against a known kernel.
- Sampler design can create induced collapse: under an oracle posterior, LLaDA's confidence-based remasking produces increasing template-like repetition and entropy collapse as steps grow.
Where Pith is reading between the lines
- One implication the authors leave implicit: if sampling dynamics alone can produce template repetition under an exact oracle, part of the degeneration seen in real diffusion language models may be attributable to the decoder rather than the trained model; a direct test is to run the same frozen model through two different samplers and compare transition statistics.
- The oracle benchmark is synthetic by design, but it suggests a testable extension: before trusting few-step outputs from a new discrete sampler, run it under this Markov-chain oracle and require its transition KL to approach the autoregressive baseline.
- Because the ground-truth prior is first-order Markov, extending the framework to higher-order Markov priors with exact inference would show whether the step-length dependence of sampler error worsens or softens for language-like long-range dependencies.
- The finding that GenPPL drops under sharpening in a pure autoregressive bigram generator implies that any few-step diffusion result reported primarily via GenPPL should be accompanied by diversity and entropy diagnostics to be interpretable.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces an oracle evaluation framework for discrete diffusion samplers. A ground-truth first-order Markov chain is defined, its exact HMM posterior under masking observations is computed via forward-backward smoothing, and this posterior (or the derived concrete score) is substituted for the learned denoiser in SEDD, MDLM, LLaDA, and ReMDM. The resulting samplers are compared against the oracle transition kernel on OWT and Text8 with transition-level, surface, and external-LM metrics. The central claim is that, except for LLaDA, transition-level mismatch persists at small step counts and vanishes only as the number of steps approaches the sequence length, and that GenPPL/MAUVE/NLL do not reliably reflect this mismatch.
Significance. The framework is well suited to its stated purpose: the forward-backward derivation (App. A) and the concrete-score identity (App. B) are correct and standard, and replacing a learned denoiser with an exact posterior is a clean way to separate discretization/independence error from model approximation error. The GenPPL sharpening sanity check is an independent and convincing construction. The availability of code and the controlled comparisons across two datasets are strengths. If the empirical conclusions hold, the paper offers a useful caution that common surface metrics do not certify distributional correctness and that parallel finite-step samplers have intrinsic error. The principal limitations are the toy Markov-chain ground truth, the single-seed/no-error-bar experimental protocol, and the LLaDA exception, which together make the abstract's general claim too strong.
major comments (4)
- [Sec. 7.5 (and Sec. 4)] The headline claim treats LLaDA as evidence of sampler-induced error, but Sec. 7.5 concedes that LLaDA's degeneration under the oracle is caused by the substitution itself: the sampler "relies on denoiser-produced confidence scores that encode rich linguistic priors," and replacing them with the oracle posterior "breaks" that coupling. This is not the same type of failure as an incorrect update rule given an exact denoiser; it is an interaction between the oracle and a confidence heuristic designed for a different denoiser. The framework's claim in Sec. 4 that the oracle is used "in a method-consistent manner" therefore does not hold for LLaDA. Please either exclude LLaDA from the sampler-error claims or reframe it explicitly as a sensitivity/mis-specification diagnostic, and revise the abstract accordingly.
- [Sec. 6, Tables 1-2] All headline numbers are reported for a single seed (seed 123) and N=512 sequences, with no error bars, multiple seeds, or bootstrap intervals. The central empirical conclusion is a convergence pattern: e.g., on OWT, MDLM/SEDD/ReMDM transition KL at S=1024 is 0.2446-0.2564 versus an AR baseline of 0.2454. These differences are small enough that sampling noise could affect the claim that convergence occurs only near S=T. Please add seed variation or bootstrap confidence intervals for the main transition-level and metric comparisons, or explicitly state that the reported trends are single-seed observations.
- [Abstract / Sec. 7.1] The abstract states that transition-level mismatch "vanishes only as the number of steps approaches the sequence length," but Sec. 7.1 and Table 1 show that LLaDA does not converge at all: its KL remains around 1.3 at S=1024 while entropy and diversity keep collapsing. The abstract omits the "except LLaDA" qualifier that appears in the main text. The claim should be restated so that it applies to SEDD/MDLM/ReMDM, with LLaDA described as a separate non-converging case, or the abstract should be changed to match the actual evidence.
- [Sec. 6 / Sec. 3.1] The ground-truth distribution is a first-order Markov chain (a bigram prior with top-K truncation on OWT, dense bigram on Text8). The paper's general conclusion about "few-step discrete diffusion samplers" is therefore supported only for these low-order Markov priors, which are far from the dependencies found in natural language. Even if the exact-HMM oracle correctly isolates sampler error, the scope of the conclusion should be stated as "for the studied Markov priors," unless additional experiments with higher-order or neural-learned ground-truth distributions are provided.
minor comments (5)
- [Abstract] The abstract's contribution 2 should include the "except LLaDA" caveat that appears in the Figure 1 caption and Sec. 7.1; otherwise the summary is internally inconsistent.
- [Sec. 7.2 vs 7.4] The paper says MAUVE "more faithfully detects low-temperature degradation" in Sec. 7.2, but Sec. 7.4 says MAUVE is "largely insensitive to transition-level deviations." These statements are not contradictory if the type of distortion differs, but the conditions under which MAUVE is or is not sensitive should be stated explicitly.
- [Sec. 6 and App. C] The paper uses different samplers with different noise schedules, but the exact schedule α_t and its dependence on S are not fully specified in the main text. Without this, the phrase "number of steps approaches T" is hard to interpret across SEDD, MDLM, and ReMDM. Please include the schedule equations in the main text or reference the appendix more precisely.
- [App. E.4] The teleport term ε is described in Eq. (7) as part of the ground-truth kernel P′, but App. E.4 calls it a "numerical safeguard." Please state clearly whether all metrics are evaluated against the teleport-smoothed P′ or against the pure top-K kernel before mixing.
- [App. F.5] The phrase "LLaDA-pisamples" appears to be a typo for "LLaDA-π samples." Please fix the spacing/formatting.
Circularity Check
No significant circularity: the oracle is fixed from a ground-truth kernel before sampling, and the mismatch is measured, not fitted.
full rationale
The paper's central finding is an empirical measurement rather than a derived prediction. A ground-truth Markov kernel P' is fixed in Eq. (7); the HMM oracle posterior γi is computed by exact forward-backward smoothing (Eqs. 12-14); each sampler's learned denoiser is replaced by this fixed oracle; and generated transition statistics are then compared against the same P'. The target quantities (transition KL, NLL, entropy) are not used to fit any parameter of the oracle or the metrics, and the oracle is not derived from any sampler output. The observed convergence as S approaches T follows from the Markov property: with single-token sequential unmasking, the oracle posterior conditioned on previous tokens becomes exactly the transition kernel P', so the asymptotic agreement is a mathematical property of the construction, not a fitted agreement. The GenPPL/MAUVE demonstrations are independent sanity checks using a separate autoregressive bigram generator, so they do not reuse the fitted oracle. No load-bearing self-citation or imported uniqueness theorem appears; the HMM machinery and teleport construction are standard external tools. The only notable caveat is LLaDA, where Section 7.5 explicitly concedes that replacing the learned denoiser with the oracle breaks the confidence-score coupling, making that particular result an intervention artifact rather than a pure sampler-error measurement. This is a validity and external-generalization limitation, not a circularity: the paper does not use LLaDA's behavior to define or fit anything, and the limitation is stated in the paper itself. Thus no step of the derivation reduces to its own inputs.
Axiom & Free-Parameter Ledger
free parameters (6)
- Sparsity level K =
206
- Teleport probability epsilon =
1e-4
- Temperature beta (SEDD perturbation)
- ReMDM loop/conf hyperparameters =
eta_cap=0.02, t_on=0.55, t_off=0.05, alpha=0.9, p=0.9
- Sequence length T and sample count N =
T=1024, N=512
- MDLM unmasking schedule
axioms (6)
- domain assumption Ground-truth data distribution is a first-order Markov chain (Eq. 6).
- domain assumption Forward noising is position-wise independent masking with schedule alpha_t (Eq. 1).
- standard math Forward-backward smoothing gives the exact posterior marginals under hard evidence (Eqs. 12-14).
- standard math Concrete score reduces to a scaled posterior marginal under the absorbing channel (Eqs. 52, 59).
- domain assumption The samplers' implementations (tau-leaping, parallel unmasking, confidence remasking, ReMDM reverse posterior Eq. 62) faithfully match the original methods.
- domain assumption GPT-2 Large is a representative external evaluator for GenPPL and MAUVE.
read the original abstract
Discrete diffusion language models (dLLMs) provide a fast and flexible alternative to autoregressive models (ARMs) via iterative denoising with parallel updates. However, their evaluation is challenging: existing metrics conflate denoiser approximation error with sampler-induced error from the sampling dynamics, a problem that does not arise for ARMs whose autoregressive sampling exactly reflects the learned probability model. We introduce a sampler-centric oracle framework that replaces learned denoisers with an exact Hidden Markov Model posterior derived from a ground-truth Markov chain, isolating sampler-induced error in a controlled setting. We show that few-step discrete diffusion samplers are not distributionally correct even under an oracle denoiser, with transition-level mismatch that vanishes only as the number of steps approaches the sequence length. Moreover, improvements in negative log-likelihood (NLL), generative perplexity (GenPPL), or MAUVE do not imply correct sampling. Code is available at https://luhantang.github.io/dllm_sampler
Figures
Reference graph
Works this paper leans on
-
[1]
Albrychiewicz, E., Valiente, A. F., and Chen, L.-C. Dy- namical regimes of multimodal diffusion models.arXiv preprint arXiv:2602.04780,
-
[8]
Kang, W., Galim, K., Oh, S., Lee, M., Zeng, Y ., Zhang, S., Hooper, C., Hu, Y ., Koo, H. I., Cho, N. I., et al. Parallel- bench: Understanding the trade-offs of parallel decoding in diffusion llms.arXiv preprint arXiv:2510.04767,
-
[9]
Discrete diffu- sion models: Novel analysis and new sampler guarantees
Liang, Y ., Liang, Y ., Lai, L., and Shroff, N. Discrete diffu- sion models: Novel analysis and new sampler guarantees. arXiv preprint arXiv:2509.16756,
-
[12]
URL https://openreview.net/forum? id=pD6TiCpyDR. Peng, F. Z., Bezemek, Z., Patel, S., Rector-Brooks, J., Yao, S., Bose, A. J., Tong, A., and Chatterjee, P. Path planning for masked diffusion model sampling.arXiv preprint arXiv:2502.03540,
-
[14]
Wang, G., Schiff, Y ., Sahoo, S. S., and Kuleshov, V . Re- masking discrete diffusion models with inference-time scaling.arXiv preprint arXiv:2503.00307,
-
[15]
L., Juergens, D., Bennett, N
Watson, J. L., Juergens, D., Bennett, N. R., Trippe, B. L., Yim, J., Eisenach, H. E., Ahern, W., Borst, A. J., Ragotte, R. J., Milles, L. F., et al. Broadly applicable and ac- curate protein design by integrating structure prediction networks and diffusion generative models.BioRxiv, pp. 2022–12,
2022
-
[16]
Zheng, K., Chen, Y ., Mao, H., Liu, M.-Y ., Zhu, J., and Zhang, Q
URL https: //openreview.net/forum?id=HDeIb67lJe. Zheng, K., Chen, Y ., Mao, H., Liu, M.-Y ., Zhu, J., and Zhang, Q. Masked diffusion models are secretly time- agnostic masked models and exploit inaccurate categori- cal sampling.arXiv preprint arXiv:2409.02908,
-
[18]
Neural mask predictor.In LLaDA, the denoiser (mask predictor) is trained to predict clean tokens at masked positions. In the unconditional setting, the network models pθ(x0,i |z t),(66) while in the conditional setting with a promptp 0, it models pθ(x0,i |p 0, zt),(67) where x0,i denotes the clean token at position i. During training, the cross-entropy lo...
2024
-
[206]
Each truncated row is then renormalized to sum to one
Only the top-Koutgoing transitions are retained for each state. Each truncated row is then renormalized to sum to one. This percentile-based rule prevents a small number of extremely heavy-tailed states from dominating the global sparsity choice while ensuring that the vast majority of states retain at least99%of their outgoing mass. E.4. Teleport Mixture...
2012
-
[1996]
Ghazvininejad, M., Levy, O., Liu, Y ., and Zettlemoyer, L. Mask-predict: Parallel decoding of conditional masked language models.arXiv preprint arXiv:1904.09324,
Pith/arXiv arXiv 1904
-
[2006]
D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al
Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J. D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al. Language models are few-shot learners. Advances in neural information processing systems, 33: 1877–1901,
1901
-
[2012]
Large language diffusion models.arXiv preprint arXiv:2502.09992,
Nie, S., Zhu, F., You, Z., Zhang, X., Ou, J., Hu, J., Zhou, J., Lin, Y ., Wen, J.-R., and Li, C. Large language diffusion models.arXiv preprint arXiv:2502.09992,
-
[2015]
I., Burnell, R., Bai, L., Gulati, A., Tanzer, G., Vincent, D., Pan, Z., Wang, S., et al
Team, G., Georgiev, P., Lei, V . I., Burnell, R., Bai, L., Gulati, A., Tanzer, G., Vincent, D., Pan, Z., Wang, S., et al. Gemini 1.5: Unlocking multimodal understand- ing across millions of tokens of context.arXiv preprint arXiv:2403.05530,
-
[2019]
The llama 3 herd of models.arXiv preprint arXiv:2407.21783,
Grattafiori, A., Dubey, A., Jauhri, A., Pandey, A., Kadian, A., Al-Dahle, A., Letman, A., Mathur, A., Schelten, A., Vaughan, A., et al. The llama 3 herd of models.arXiv preprint arXiv:2407.21783,
-
[2022]
Optimal inference sched- ules for masked diffusion models.arXiv preprint arXiv:2511.04647,
Chen, S., Cong, K., and Li, J. Optimal inference sched- ules for masked diffusion models.arXiv preprint arXiv:2511.04647,
-
[2023]
inaccurate oracle SEDD
define a continuous-time Markov jump process over discrete sequences with an absorbing [MASK] state. Let pt denote the marginal distribution of the noisy sequence at time t. The reverse-time dynamics are parameterized byconcrete score ratiosbetween discrete states, which determine the token-level jump rates. Under the absorbing noise model, the only nontr...
2023
-
[2024]
The curious case of neural text degeneration.arXiv preprint arXiv:1904.09751,
Holtzman, A., Buys, J., Du, L., Forbes, M., and Choi, Y . The curious case of neural text degeneration.arXiv preprint arXiv:1904.09751,
Pith/arXiv arXiv 1904
-
[2025]
Lou, A., Meng, C., and Ermon, S. Discrete diffusion model- ing by estimating the ratios of the data distribution.arXiv preprint arXiv:2310.16834,
-
[2026]
T., Yang, Z., Qi, Z., Han, J., Sahoo, S
Arriola, M., Gokaslan, A., Chiu, J. T., Yang, Z., Qi, Z., Han, J., Sahoo, S. S., and Kuleshov, V . Block diffusion: Inter- polating between autoregressive and diffusion language models.arXiv preprint arXiv:2503.09573,
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.