REVIEW 4 major objections 6 minor 19 references
This paper claims that a training-free analytic score, computed by dynamic programming over a regular expression's automaton, can guide continuous diffusion language models to generate syntactically valid output while approximately preservi
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 →
Training-free gradient guidance, based on the exact regex-acceptance probability under the decoder's unigram distribution, lets continuous diffusion language models satisfy regular-expression constraints.
T0 review reviewed 2026-08-02 challenge →
load-bearing objection A genuinely new steering mechanism for continuous diffusion LMs, with a sound DP core, but the guidance signal rests on an unmeasured approximation and parts of the evaluation are confounded; worth a serious referee. the 4 major comments →
Continuous Diffusion Models Can Obey Formal Syntax
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
Core claim
The central claim is that the reverse process of a continuous diffusion language model can be steered to satisfy a regular language L by replacing the learned classifier of standard classifier guidance with an analytically computed expectation. The noisy latent x_t is interpreted through the model's decoder as a product of independent per-position vocabulary distributions; the paper's Algorithm 1 builds, for a fixed sequence length, transition matrices of a tokenizer-aligned automaton in which each transition weight is the probability that the token at that position moves the automaton between states. Multiplying these matrices from the initial-state vector yields exactly E_{s~Dec(x_t)}[s in
What carries the argument
The central object is the analytic expected-acceptance score E_{s~Dec(x_t)}[s in L], computed by dynamic programming over a tokenizer-aligned deterministic finite automaton. The decoder-induced unigram distribution turns the latent into per-position token probabilities; the alignment step folds vocabulary tokenization into automaton transitions so that all tokenizations of a valid string contribute probability mass. Matrix-vector products propagate state probabilities through the automaton, and the total mass in accepting states is the score. Its logarithmic gradient enters the denoising update as a guidance potential, scaled by the noise variance and a guidance-strength hyperparameter. This
Load-bearing premise
The load-bearing premise is that the probability that a latent decodes to a valid string is well approximated by the probability that independent per-position token draws from the decoder's unigram distribution are accepted by the automaton; this is exact only in the zero-noise limit, and the paper provides no error bound or direct measurement of the gap at intermediate noise levels.
What would settle it
Train a lightweight classifier on noisy latents to estimate p(L|x_t) directly, then compare its gradient with the analytic unigram-proxy gradient on samples drawn at intermediate noise levels; if the two disagree in direction on a substantial fraction of trajectories, the guidance signal is not the conditional score. A simpler check: at mid-noise, compute a Monte Carlo estimate of the acceptance probability by actually sampling multiple token sequences from Dec(x_t) and compare it with the matrix-product value; a large discrepancy on trajectories that later violate the regex would falsify the
If this is right
- Continuous diffusion language models can be constrained by any regular language without per-constraint training; applying a new regex requires only a new automaton and a gradient computation, not a new classifier.
- Because the guidance approximates conditioning on validity rather than filtering token choices, it preserves more of the base model's distribution, as reflected in lower perplexity than autoregressive constrained decoding and the absence of the infinite-repetition stall.
- Under the unigram-proxy approximation, the sampler's convergence follows from existing score-based conditional generation theory, giving the method the same theoretical footing as classifier guidance without its training cost.
- The method handles constraints that token-level steering cannot express, such as ordering, position, and unbounded distance between specified words.
- The approach enables diffusion models to generate structured outputs, such as JSON-schema documents, that lie outside the model's training distribution.
Where Pith is reading between the lines
- The unigram independence assumption means the guidance signal at intermediate and high noise may be miscalibrated; a testable extension is to quantify the gap between the analytic proxy and a learned noisy classifier, or to introduce a temperature that sharpens the decoder distribution during early denoising.
- The same analytic score could serve as a proposal or control variate for Monte Carlo sampling schemes in discrete diffusion models, not just as a gradient-based steering term.
- Because the overhead scales with the number of automaton transitions, compact symbolic automaton representations or custom gradient kernels could plausibly reduce the reported cost by one to two orders of magnitude, as the paper itself suggests but does not demonstrate.
- If the proxy is reliable, the guidance term could be reused as a rejection-sampling filter after generation, turning high satisfaction rates into near-certain validity with modest sampling overhead.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes DIFFINITY, a training-free guidance method for continuous diffusion language models (specifically PLAID) that steers generation toward strings accepted by a given regular expression. The method builds a tokenizer-aligned DFA for the regex, computes the expected acceptance probability of a length-l token sequence under the decoder's independent unigram model via dynamic programming (Algorithm 1), and uses the gradient of this probability as a classifier-guidance term in the DDPM reverse step (Eq. 2). The authors claim this analytically computed proxy approximates the true conditioning probability p(L|x_t) and thus that the sampler targets the base model conditioned on syntactic validity. They evaluate DIFFINITY on 180 regex constraints over JSON and natural-language benchmarks, reporting constraint-satisfaction rates of 68–96%, and compare against autoregressive constrained decoding (GPT-2 with Guidance).
Significance. If the central conditioning claim holds, the paper contributes a genuinely training-free way to impose discrete, nonlocal syntactic constraints on continuous diffusion language models, avoiding auxiliary classifier training and extending beyond the simple token-position controls supported by PLAID. The core dynamic program is correct for the declared proxy: Theorem 3.1 is a standard forward pass over the aligned automaton, and the tokenizer-automaton alignment in Section 3.1 addresses a real and nontrivial problem. The paper is also commendably open about computational overhead and ships an open-source implementation. However, the significance is tempered by the fact that the paper's main theoretical contribution—that the guidance term approximates conditioning on validity—rests on an unmeasured approximation (Eq. 4), and several reported empirical aggregates are difficult to reconcile with the stated sampling protocol.
major comments (4)
- [§3.3, Eq. (4)] The load-bearing substitution log p(L|x_t) ≈ log E_{s~Dec(x_t)}[s∈L] is asserted without an error bound or empirical validation. The paper itself concedes the approximation is only valid for t→0, and Section 4 states that final sentences are produced by argmax decoding—not by sampling from Dec(x0). Thus even the claimed t→0 exactness does not apply to the evaluation protocol. Because every guidance step in Eq. (2) uses the gradient of this proxy, the central claim that the sampler targets p(x|L) is not fully established. I ask for either (a) an empirical measurement of the gap, e.g., comparing E_{s~Dec(x_t)}[s∈L] to a Monte Carlo estimate of p(L|x_t) obtained from the base model's posterior at several noise levels, or (b) a clear theoretical statement of the approximation regime and a demonstration that the proxy's level sets and gradients align with the true conditional probability in t
- [§F, Tables 1–3] The reported satisfaction rates appear inconsistent with the stated per-benchmark sample sizes. Section F says 10 samples per JSON benchmark and 20 samples per natural-language benchmark. Under that protocol, per-benchmark satisfaction rates are multiples of 10% or 5%, respectively, and category-level averages inherit corresponding constraints. Yet Table 1 reports JSON satisfaction values such as 68.4% and 79.3%, which are not achievable averages over 70 benchmarks of 10 samples each, and Table 3 reports natural-language averages such as 0.2% and 1.8%, which are not achievable averages over 20 benchmarks of 20 samples each. If the reported aggregates are weighted by benchmark or computed as pooled counts, please provide the exact formula and the per-benchmark or raw counts so the numbers can be reproduced. As written, the headline empirical claims cannot be verified from the stated proto
- [§4.2, Table 2] The claim that DIFFINITY incurs a "virtually nonexistent" perplexity cost is not supported by the reported comparison. Section 4.2 states that the average perplexity of "all samples generated by DIFFINITY" is 60.0, but Table 2 explicitly says perplexity is computed only on samples that satisfy the regex. Comparing this selected subset against base PLAID's unconditional-generation perplexity (61.6) is not an apples-to-apples comparison, since conditional samples are preselected to lie in a constrained subset that may be easier for the reference perplexity model. In fact, Section 4.4 reports that when PLAID's own constraint-satisfying samples are used, PLAID's average perplexity is 55.65 versus DIFFINITY's 60.27. Please report perplexity on all DIFFINITY samples, or compare against PLAID samples that satisfy the same constraints, and revise the quality-preservation claim accordingly.
- [§G.1] The additional experiment intended to demonstrate distribution preservation is too weak to support the claim. The The/It ratios for the three regexes are only described as "roughly matching" the Llama-3.1 reference ratios, but the observed ratios (5.63 vs 10.10, 0.03 vs 0.11, 0 vs 1.26e-6) differ by factors of ~2, ~3.7, and from a very small to exactly 0. With only 200 samples per regex, no confidence intervals or statistical test is provided, and it is unclear how the choice of guidance scale γ affects these ratios. This experiment should be strengthened (e.g., with bootstrap intervals or a proper divergence measure) before the paper claims that DIFFINITY preserves the base model's distribution.
minor comments (6)
- [§3.2, Theorem 3.1] The statement of Theorem 3.1 says the algorithm returns E_{x∼θ}[x∈L], but x is a latent; the quantity is E_{s∼Dec(x)}[s∈L]. Use consistent notation.
- [§4.2] Typo: "between (udb.)" should be "between (unbounded)."
- [§4.1] The phrase "When generating regexes" is unclear; presumably "When generating JSON samples against regexes" is meant.
- [§3.3] Minor language: "a là classifier guidance" should be "à la classifier guidance."
- [Figure 1] The figure uses color coding to indicate valid transitions, but the printed version may be monochrome; please add explicit labels or line styles.
- [§4.3] The claim that increasing γ "monotonically improves" satisfaction is based on a small number of samples; with 10–20 samples per benchmark, error bars or significance tests would be appropriate.
Circularity Check
No significant circularity: the analytic score is computed from the constraint and decoder by a direct DP, and the empirical satisfaction rates are external measurements; the conceded Eq. (4) approximation is a correctness risk, not a circular reduction.
full rationale
The derivation chain is: (i) Dec(x_t) is defined as a matrix of independent unigram distributions; (ii) Algorithm 1 accumulates, via automaton transition matrices, the exact expectation E_{s~Dec(x_t)}[s in L]; (iii) Eq. (2) adds the gradient of log of that expectation; (iv) Eqs. (3)-(4) identify this with classifier guidance, with the paper explicitly saying the identification is approximate and 'contingent on the quality of this unigram approximation'. Step (ii) is a correctness proof of a DP against its own specification; it verifies the algorithm rather than deriving the conditioning claim, and it is not used to prove that the proxy equals the true conditional score. Step (iv) is the only place where circularity could arise: if log p(L|x_t) were defined as log E_{s~Dec(x_t)}[s in L], then Eq. (2) would be self-definitional. The paper does not do this; it treats the expectation as a proxy and explicitly concedes the gap at high noise. The lack of an error bound or empirical estimate of this gap is a genuine correctness/robustness risk, but it is not a circular reduction. The evaluation is externally falsifiable: constraint satisfaction is checked against the regex, perplexity is measured by Llama-3.1-8B, and fluency by an external judge; none of these metrics are reconstructed from the guidance score. The only tuned hyperparameter, gamma, is a guidance scale whose effect is reported as a sweep, not as a prediction forced by the method. Self-citations to the authors' prior constrained-decoding work are used only as related work and are independently supported by this paper's own GPT2-GCD comparisons. One measurement inconsistency is worth flagging: Section 2.1 says final text is sampled from Dec(x0), while Section 4 says argmax decoding is used, so Eq. (4)'s 'exact as t->0' claim applies to stochastic decoding rather than the evaluated argmax mode. This is a validity/measurement gap, not a circularity: no equation in the paper is equivalent to its own input by construction.
Axiom & Free-Parameter Ledger
free parameters (4)
- guidance scale gamma =
2.5
- JSON automaton size filter =
states <= 230; transitions <= 7.5M
- sequence length =
64 tokens
- diffusion timesteps =
256 (JSON), 1024 (NL)
axioms (4)
- domain assumption E_{s~Dec(x_t)}[s in L] is a faithful proxy for p(L | x_t) across the denoising trajectory
- domain assumption The PLAID latent is interpretable as independent per-position unigram distributions via its decoder
- domain assumption Standard classifier-guidance theory (Anderson 1982; Song et al. 2020) transfers to the guided sampler in Eq. (2)
- standard math Theorem E.1: Align(A, V) accepts token sequence (tok_1..tok_l) iff each tok_i is in V and concat(tok_1..tok_l) is in L
Cite this review
Pith. "Pith review of Continuous Diffusion Models Can Obey Formal Syntax." pith.science (2026). https://pith.science/paper/EEXKMIHF
@misc{pith2026260212468,
author = {Pith},
title = {Pith review of: Continuous Diffusion Models Can Obey Formal Syntax},
year = {2026},
howpublished = {\url{https://pith.science/paper/EEXKMIHF}},
note = {Machine review of arXiv:2602.12468}
}
read the original abstract
Diffusion language models offer a promising alternative to autoregressive models due to their global, non-causal generation process, but their continuous latent dynamics make discrete constraints -- e.g., the output should be a JSON file that matches a given schema -- difficult to impose. We introduce a training-free guidance method for steering continuous diffusion language models to satisfy formal syntactic constraints expressed using regular expressions. Our approach constructs an analytic score estimating the probability that a latent state decodes to a valid string accepted by a given regular expression, and uses its gradient to guide sampling, without training auxiliary classifiers. The denoising process targets the base model conditioned on syntactic validity. We implement our method in Diffinity on top of the PLAID diffusion model and evaluate it on 180 regular-expression constraints over JSON and natural-language benchmarks. Diffinity achieves 68-96\% constraint satisfaction while incurring only a small perplexity cost relative to unconstrained sampling, outperforming autoregressive constrained decoding in both constraint satisfaction and output quality. Diffinity is open-sourced at github.com/large-loris-models/Diffinity.
Figures
Reference graph
Works this paper leans on
-
[2]
?!()-]+.|It [A-Za-z .,;:
E. Proofs We provide simple proofs for Theorem E.1 and Theorem 3.1. Theorem E.1(V ocabulary Alignment).Let L be a regular constraint and A be the DFA representation of L. Then Align(A, V)as defined by Algorithm 2 returns a DFA AV such that AV accepts a sequence of tokens tok 1,· · ·,tokl iff tok i ∈Vfor all1≤i≤land the concatenationconcat(tok 1,· · ·,tokl...
2017
-
[3]
Grattafiori, A., Dubey, A., Jauhri, A., Pandey, A., and others, A
URL https:// arxiv.org/abs/2501.10868. Grattafiori, A., Dubey, A., Jauhri, A., Pandey, A., and others, A. K. The Llama 3 herd of models,
-
[7]
URL https://arxiv. org/abs/2510.04573. Kingma, D., Salimans, T., Poole, B., and Ho, J. Varia- tional diffusion models.Advances in neural information processing systems, 34:21696–21707,
-
[8]
Lee, I. and Berg-Kirkpatrick, T. Readability ̸= learnability: Rethinking the role of simplicity in training small lan- guage models.arXiv preprint arXiv:2510.13915,
-
[10]
Constrained decoding of diffusion llms with context-free grammars
Mündler, N., Dekoninck, J., and Vechev, M. Constrained decoding of diffusion llms with context-free grammars. arXiv preprint arXiv:2508.10111,
-
[11]
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,
-
[12]
Parys, P., Vaidya, S., Berg-Kirkpatrick, T., and D’Antoni, L
URLhttps:// arxiv.org/abs/2502.05111. Parys, P., Vaidya, S., Berg-Kirkpatrick, T., and D’Antoni, L. Constrained adaptive rejection sampling,
-
[13]
Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., and Sutskever, I
URL https://arxiv.org/abs/2510.01902. Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., and Sutskever, I. Language models are unsupervised multitask learners
-
[14]
Dingo: Constrained inference for diffusion llms.arXiv preprint arXiv:2505.23061,
Suresh, T., Banerjee, D., Ugare, S., Misailovic, S., and Singh, G. Dingo: Constrained inference for diffusion llms.arXiv preprint arXiv:2505.23061,
-
[15]
URL https://arxiv.org/abs/2403. 01632. Willard, B. T. and Louf, R. Efficient guided generation for large language models.arXiv preprint arXiv:2307.09702,
-
[16]
Dream 7b: Diffusion large language models.arXiv preprint arXiv:2508.15487,
Ye, J., Xie, Z., Zheng, L., Gao, J., Wu, Z., Jiang, X., Li, Z., and Kong, L. Dream 7b: Diffusion large language models.arXiv preprint arXiv:2508.15487,
-
[17]
score": an integer from 1 to 100 -
10 Continuous Diffusion Models Can Obey Formal Syntax A. Hardware and Software Our experiments were conducted on a Ubuntu 20.04.5 LTS server equipped with a AMD EPYC 7282 CPU (16-cores at 2.8GHz) and NVIDIA RTX A6000 GPUs. We ran all experiments using a single GPU. Our implementation is based on Python 3.10.19, PyTorch 2.0.1 with CUDA 11.8, and Flash Atte...
2019
-
[100]
Perplexity and fluency are only computed for samples that successfully meet the regex; non-matching samples are excluded
across benchmarks. Perplexity and fluency are only computed for samples that successfully meet the regex; non-matching samples are excluded. Rates for DIFFINITYare reported with guidance scale2.5. Lower perplexity (↓) and higher fluency (↑) indicate better distribution alignment. DIFFINITYGPT2-Small-GCD GPT2-Medium-GCD GPT2-Large-GCD BenchmarkPPL↓Flu.↑PPL...
1946
-
[2020]
Curran Associates Inc. ISBN 9781713829546. Jo, J. and Hwang, S. J. Continuous diffusion model for language modeling.arXiv preprint arXiv:2502.11564,
-
[2021]
Curran Associates Inc. ISBN 9781713845393. Geng, S., Josifoski, M., Peyrard, M., and West, R. Grammar- constrained decoding for structured nlp tasks without finetuning.arXiv preprint arXiv:2305.13971,
-
[2022]
Lou, A., Meng, C., and Ermon, S. Discrete diffusion model- ing by estimating the ratios of the data distribution.arXiv preprint arXiv:2310.16834,
-
[2023]
URL https://arxiv. org/abs/2305.18619. Ho, J., Jain, A., and Abbeel, P. Denoising diffusion proba- bilistic models. InProceedings of the 34th International Conference on Neural Information Processing Systems, NIPS ’20, Red Hook, NY , USA,
-
[2024]
URL https: //arxiv.org/abs/2407.21783. Guidance Contributors. Guidance: A guidance language for controlling large language models,
-
[2025]
URL https://arxiv.org/abs/2506.05754. Anderson, B. D. Reverse-time diffusion equation models. Stochastic Processes and their Applications, 12(3):313– 326,
This paper was first reviewed by deepseek-v4-flash on August 2, 2026.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.