W1. My major concern is the overlap with COVER [1] (ICML 2026), which is not cited. COVER already proposes:
-
the same flip-flop motivation (remask, then restore the same token);
-
the same single-pass verification -- seeds are masked in the input, other queries use the seeds’ cached K/V from the previous step, and a diagonal correction with row renormalization prevents self-leakage. Sec. 4.2 even uses COVER’s title phrase “context-preserving verification”;
-
the same seed score form, u x (1 + attention terms), computed from last-layer, head-averaged attention;
KEEP/REMASK resolution;
-
the same setup: B=15, tau=0.8, lengths 256/512, the same four benchmarks, WINO/Saber baselines and the effective-revision-ratio metric.
The remaining differences are small:
-
the attention terms in the score are changed;
-
K is fixed at 2 instead of COVER’s adaptive budget;
-
REPLACE is dropped;
-
guided drafting (Eq. 9) is added. This is close in spirit to anchor-guided injection into masked positions in ASRD [2].
The flip-flop observation itself is also reported in [3]. The authors should cite and compare against [1], and present the contribution as these deltas, with ablations against COVER.
W2. The speedup is measured against one-token-per-step decoding, so most of it likely comes from threshold parallel decoding rather than revision. Threshold decoding without revision (Fast-dLLM [4]) is the necessary baseline. [3] shows that WINO’s gain over Fast-dLLM is marginal at standard block lengths. [3] also shows that confidence read at an unmasked position, which is how u is computed here, does not help remasking.
W3. The efficiency numbers need explanation. With B=15 and block length 64, each block needs at least 5 steps, so going from 256 to 512 tokens should add at least 20 NFE. Yet CAPER’s NFE stays flat or drops: Dream GSM8K goes 66 ---> 48, Dream HumanEval 70 ---> 54, and LLaDA GSM8K 71 --> 71. WINO and Saber both increase. Is early stopping at EOS used for CAPER but not for the baseline? Also, Dream GSM8K at 512 reports a 12.47x wall-clock speedup, above its NFE ratio of 10.7x, even though CAPER needs attention maps and K/V caching at every step.
W4. Several technical choices are not justified:
-
Verification only removes the self-entry. Neighbors attend to the cached K/V of the token at every layer, so from layer 2 onward the token can still see its own value indirectly, which biases the check toward KEEP. There is no comparison with an oracle leave-one-out check, as done in [3].
-
Eq. 9 has no scale factor. Since all masked positions share the same [MASK] embedding, it reduces to one out-of-distribution shift, 2e_MASK − e_P, and there is no sensitivity study.
W5. Results come from a single greedy run, and the gains are small; for example, +2.43 on HumanEval is 4 problems. Fig. 1b–c pools about 1k token-changing events across 2 models and 4 tasks, and is drawn as interpolated histograms.
W6. The Ethics and Reproducibility sections are left as the unedited template. The paper writing seems to be rushed. Very few papers are discussed in related work and in Introduction.
References
-
Xiang, Yanzheng, et al. “Stop the Flip-Flop: Context-Preserving Verification for Fast Revocable Diffusion Decoding.” International Conference on Machine Learning. 2026. (arXiv:2602.06161)
-
Yao, Yizhen, et al. “Follow the Latent Roadmap: Navigating Revocable Decoding for Diffusion LLMs with Anchor Tokens.” arXiv preprint arXiv:2606.16847 (2026).
-
Frković, Stipe, et al. “Re-evaluating Confidence Remasking in Masked Diffusion Language Models.” arXiv preprint arXiv:2606.12232 (2026).
-
Wu, Chengyue, et al. “Fast-dllm: Training-free acceleration of diffusion llm by enabling kv cache and parallel decoding.” International Conference on Learning Representations. 2026.
\section*{Response to Reviewer nidC}
Thank you for the detailed review. We added a direct COVER comparison, an Exact LOO evaluation, and an analysis of Eq.~9.
\paragraph{W1. Attribution and contribution.} We now cite COVER and Frkovi'{c} et al.\ and include COVER in Table~1. We credit COVER with the flip-flop observation, cached-KV verification with diagonal correction, and the shared drafting and verification pass.
CAPER combines uncertainty with incoming attention from decoded and newly drafted positions to prioritize verification. COVER rewards influence on masked positions and penalizes outgoing attention to new drafts as a proxy for cache instability. CAPER remasks when verification changes the top-1 prediction or when its confidence falls below the threshold.
Inspired by SFG, CAPER shifts masked embeddings away from a priority-weighted aggregate of unresolved assignments. ASRD guides them toward an unweighted centroid of stable anchors using entropy-dependent strengths. CAPER scores higher than COVER in 14 of 16 settings and is at least as fast in all 16. Table~2 evaluates the components within CAPER.
\paragraph{W2. Parallel decoding and confidence.} The single-token decoder supplies the speedup denominator. On Dream GSM8K at length 512, CAPER is 1.30× faster than WINO and 1.97× faster than COVER, with higher accuracy. Replacing verification with immediate remasking preserves parallel drafting, lowers all four scores, and reduces normalized performance to 0.333--0.383×. This ablation measures the benefit of verification within revocable decoding. Isolating revision requires a matched irreversible parallel decoder.
Frkovi'{c} et al.\ study unmasked confidence as a direct remasking criterion. CAPER combines it with attention to select candidates and uses masked verification for the final decision.
\paragraph{W3. EOS, NFE, and runtime.} Revocable methods use EOS-based early termination. The reference uses a fixed budget of 256 or 512 steps. The five-step bound applies to fully decoding one 64-token block under the 15-token-per-step budget. A longer allocation can change how many blocks are actually decoded. For example, WINO on Dream HumanEval goes from 75.27 to 74.77 forwards. The aggregate results leave the cause unresolved.
The 12.47× runtime speedup and 512/48≈10.67 forward-count ratio imply that the reference uses about 1.17× as much GPU time per counted forward. Identifying the source of this difference requires component-level profiling.
\paragraph{W4. Verification and guidance.} Diagonal correction can leave indirect self-conditioning paths. In Appendix Sec.~3, Exact LOO masks only the target and recomputes the full model without cached KV states. With guidance disabled for both verifiers, top-1 and decision agreement across 151,281 events are 99.37% and 97.74%. Exact LOO reverses 1.34% of KEEP and 24.87% of REMASK decisions. In 89.22% of disagreements, top-1 stays fixed while confidence crosses the threshold. Using Exact LOO during generation increases mean accuracy by 0.38 points, NFE by 44.11%, and measured runtime by 36.56%, including diagnostic overhead. Fidelity with guidance enabled remains untested.
Appendix Secs.~1--2 show that under linear query projection and fixed keys and values, the shared shift reduces relative attention to keys with greater excess alignment to the probation aggregate. The shift depends on the selected assignments and priorities. Reversing guidance at −0.5 lowers scores by 19.00--72.10 percentage points versus zero guidance. Coefficient-1 results come from a separate setting, leaving the sweep optimum unresolved.
\paragraph{W5. Reliability.} Repeating greedy decoding does not quantify uncertainty across test problems. CAPER matches or exceeds the irreversible reference in all 16 settings at 2.07--12.47× speedups. Figure
1(b,c) describes pooled, binned events. Separately, removing contextual attention in Table2 lowers all four scores and reduces the mean effective remask rate from 26.37% to 12.76%.\paragraph{W6. Presentation and reproducibility.} We clarified attribution and documented the experimental settings and verification protocol. The Ethics and Reproducibility template passages still require correction.