- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper presents TACTIC, a framework for decoding under constraint uncertainty in diffusion language models. Unlike traditional point commitment, TACTIC preserves acquisition uncertainty during candidate selection to reduce false exclusion. The framework uses posterior-predictive compatibility to measure how likely a candidate is accepted. The authors also use tensor-train factorization to further represent correlated posteriors. It also supports confidence-weighted rules for tasks without joint distribution. The paper provides theoretical analysis of false exclusion, posterior consistency, and decision stability. Experiments on multiple benchmarks show improvements over matched hard constraint execution.
Critical strengths
Pros:
- The idea of preserving constraint uncertainty instead of doing point commitment into single constraint hypothesis is simple and potentially useful. Although posterior averaging is not new but applying this into constraint decoding is nice and intuitive. Using Tensor-Train factorization to represent corelatted posterior is fairly interresting.
- The experments and ablations are extensive with various benchmarks and two main diffusion language models. The improvements on CIDDS task are substaintial.
Critical weaknesses
Cons:
- The paper's title is about diffusion language model, but many experiments do not involve actual iterative diffusion decoding. The dlms are only used for generate candidate score which I believe this could also be done by some standard Auto-regressive models. BFCL is the only one that directly integrates the proposed method into diffusion generation, but its improvement is relatively small.
- Each benchmark requires a separately designed constraint hypothesis space and acquisition procedure, which make things hard to generalize. For example, CatSup and GraphColor use posterior-based models, while CIDDS relies on confidence-weighted implication rules. In my opinion, it is unclear how much of the improvement comes from the general framework itself rather than the task-specific constraint design.
Questions for authors
- The experiments show that soft compatibility can outperform hard constraint execution, which makes sense to me. However, I am still unclear about the role of diffusion language models in the proposed framework. Could the authors compare against a standard autoregressive language model for candidate scoring like llama-3 or qwen3 models? This would help clarify whether the improvements are related to diffusion decoding.
- I am also curious about the generalizability of TACTIC. How easily can TACTIC be extended to other tasks with different types of constraints? Moreover, the idea of soft constraint compatibility seems quite general and does not appear to rely on diffusion language models, could the authors clarify which parts of TACTIC are specifically designed for dlms and which parts can be directly applied to other language models?
- Theorem 1 makes sense to me. Though In practice, there could be many possible constraint hypotheses with different posterior probabilities and overlapping accepted sets. Could the authors provide some discussion or empirical analysis of how frequently such conflicts occur in the evaluated tasks, and what the actual false-exclusion rates are?
2 comments
Thank you for the additional experiments. The AR comparison and false-exclusion analysis address my earlier questions. I do think preserving constraint uncertainty is a good idea and it can be generalized into both AR model and dlms. My remaining concern is whether soft constraints actaully improve on unconstrained generation in the diffusion decoding settings. On BFCL, the improvment is relatively small so the benefit in the setting emphasized by the paper remains unclear. I therefore maintain my score
Thank you for your questions about diffusion decoding and generalizability.
1. AR comparison and diffusion generation.
Why diffusion is a substantive setting. Masked dLLMs fill noncontiguous positions and can predict multiple tokens in parallel, so a valid prefix is insufficient to characterize the decoding state. Independent token masks also do not ensure joint validity. This motivates dedicated automaton inference and grammar-based infilling.
Those methods take the constraint as supplied. HCD addresses the next question: what should be executed when a few examples leave that constraint ambiguous? In our BFCL implementation, acquired compatibility enters joint sampling and the constrained marginals used for token commitment. It thus acts during iterative generation. Candidate experiments separately isolate the execution effect.
The contribution is this problem formulation and execution principle; it does not require superiority in every setting. On 100 tuning-disjoint BFCL queries, Soft/Hard/Open reach 54.33/48.67/53.00%. Soft-Hard is +5.67 pp with 95% interval [-1.67, 13.00]; Soft-Open is +1.33 pp with [-4.00, 6.67].
The additional AR experiment tests generality. CIDDS holds demonstrations, rule family and candidates fixed. Hard is dev-retuned using its actual fallback objective:
The AR gain has a 95% interval of [14.91, 17.73] pp. This supports a broader HCD interface beyond dLLMs.
2. Task design and transfer.
Learning constraints that generalize across arbitrary tasks is a difficult, separate research problem. HCD starts from the uncertainty left by acquisition and asks how to execute it; it does not require one acquisition algorithm to work unchanged everywhere. Within each task, Hard and Soft receive the same demonstrations and use the same rule family and candidates. The controlled gains reported above demonstrate TACTIC’s execution advantage under the same acquisition framework.
Simple CIDDS controls further identify the source of benefit:
The last two rows share alpha=0.3. Confidence weighting adds 0.85 pp with 95% interval [0.24, 1.47]; equal weights were not separately retuned. These controls locate the main benefit in graded execution, with a further contribution from confidence weighting in this setting.
Extension is natural at the interface: a task supplies acquired beliefs or weighted rules and a compatibility evaluator; these combine with model evidence through a suitable candidate or decoding interface. The task adapter changes, while the execution principle remains the same. HCD itself is architecture-independent, and the AR control demonstrates this transfer. The current BFCL executor specializes the shared principle to diffusion.
3. Conflict and false exclusion.
The diagnostics confirm that false exclusion occurs in practice. Using plain Hard's feasibility mask, CIDDS yields:
Thus, false exclusion is not limited to cases where the feasible set becomes empty.
For posterior hypotheses, a candidate with compatibility Psi has acceptance-disagreement probability
2*Psi*(1-Psi)under two independent posterior draws. This quantifies candidate-level disagreement between plausible constraints.The separate n=8 GraphColor diagnostic measures the resulting exclusion directly:
These measurements connect the theoretical risk to observed false exclusion and show how its frequency changes with available support.