- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes a lightweight decoding strategy to preserve the refusal of LLMs for harmful queries in high-temperature sampling setting, which is quite important and necessary for many domains. The idea is simple and depends on a probe that can detect the refusal early by inspecting the first tokens. If early refusal is not detected, let the model sample from high temp. othervise use the greedy response. The authors test their methods on 3 datasets and 7 models.
Critical strengths
- The paper's argument is simple, and the presentation is clear and easy to follow, with comprehensive results. Given the major weakness below, it keeps me from giving a strong reject.
Critical weaknesses
-
The whole argument of the paper depends on the observation that the refusal tokens should be in the first few tokens of the model, as observed by Qi et al.. However, this observation is not a fundamental rule of refusal and is only a post-training artifact. We observed this because the refusal post-training data looked like this, and in many cases today, the model first reasons about whether to refuse, then decides to refuse. So the proposed idea wouldn't work in those cases, which is quite a limitation. Also, the model can start without refusing and do self-correction during generation. Those cases are ignored by the authors.
-
The prompt classifiers are actually quite common and effective. It's sometimes more effective than the model's judgment itself e.g. greedy decoding. Please see: Constitutional Classifiers, https://arxiv.org/pdf/2501.18837. So, I believe the paper relies on a moderately. outdated observation and uses a simple trick to convert that observation into compute efficiency, but this tradeoff is questionable.
Questions for authors
I would like to see the author's responses to my criticisms above.
7 comments
Prompt classifiers are common and effective
W2: The prompt classifiers are actually quite common and effective. It's sometimes more effective than the model's judgment itself e.g. greedy decoding. Please see: Constitutional Classifiers, https://arxiv.org/pdf/2501.18837.
While we agree that prompt classifiers are quite common and effective, their objective differs from ours in that they aim to replace the model’s refusal policy. In contrast, RGD aims to preserve the model’s high-temperature sampling distribution for prompts that it would otherwise not refuse under greedy decoding while maintaining its refusal policy as temperature increases.
Our main experimental results (Table 1) show how prompt classifiers change the model’s high-temperature sampling behavior on prompts that it should otherwise answer under greedy decoding. On JBB, Shieldstral routes only 47.4–59.7% of greedy non-refusals to sampling, far below that of RGD (98.7–100%). LlamaGuard-4 does better than Shieldstral in terms of greedy non-refusal preservation on JBB (86.5–93.5%) but still underperforms RGD in both this metric and greedy refusal preservation. Furthermore, Appendix G (Table 18) of our paper evaluates all methods directly against dataset ground-truth harm/benign labels (expected_behavior) rather than the model's greedy anchor at T=2.0. On refuse-labeled prompts, RGD and RGD-residual achieve a higher refusal rate than LlamaGuard-4 in all 21 of 21 model–dataset cells, Shieldstral in 17 and 18 of 21 cells, and TPC in 18 of 21 cells. External prompt classifiers also require a separate model to be deployed alongside the target model, while RGD does not.
None of this is to diminish the role or utility of prompt classifiers. In cases where a model’s refusal response needs to be strengthened beyond its baseline level, they could be used in conjunction with RGD to further improve safety. We tested this by stacking each classifier with RGD, routing the model to greedy decoding if either RGD or the prompt classifier predicts a refusal. Pooled over seven models, the share of greedy refusals sent to sampling falls from 32.6% to 5.0% for LlamaGuard-4, from 9.5% to 2.2% for Shieldstral and from 11.3% to 2.2% for TPC. Thus, RGD catches 76–85% of each classifier's misses. Stacking classifiers with RGD keeps 0.5–0.8 pp fewer non-refusals on sampling than the classifier alone and 5.5–17.5 pp fewer than RGD alone.
Regarding Constitutional Classifiers (Sharma et al., 2025), we already cite and describe this work in Section 2 (Safety classifiers, p. 3) of our submitted manuscript. Because it is a closed Anthropic system with no publicly released weights or code, an empirical comparison is not possible, and its mechanism targets a different point in the compute–safety space: it trains a separate safeguard model on constitution-generated synthetic data and runs a streaming output classifier across every generated token (incurring continuous external-model compute throughout generation), whereas RGD requires no separate model and checks only the first 1.62–3.11 greedy tokens on average for non-refusals (or zero probe tokens for most non-refusals under RGD-residual's prefill bypass). We will expand our discussion of Constitutional Classifiers in Section 2 and add the new analysis on combining RGD with prompt classifiers to our updated manuscript.
Outdated observation; questionable trade-off
W2: I believe the paper relies on a moderately outdated observation and uses a simple trick to convert that observation into compute efficiency, but this tradeoff is questionable
The observation of Qi et al. still holds for models released in 2026 (Qwen3.5, Qwen3.8 and the Gemma-4 family), with the most recent being released 3 months ago. On these models, the first few greedy tokens usually reveal the refusal decision: non-refusal probes exit after 1.62–3.11 tokens on average, and RGD's refusal-prefix check routes only 2.69–9.77% of greedy refusals to sampling (Table 2). Based on this, we disagree that the observation is outdated and would greatly appreciate your reconsideration in light of these results.
Regarding the compute efficiency trade-off of our approach, RGD sacrifices at most 0.31 pp of refusal preservation relative to naive greedy (i.e., decoding a full greedy sequence to check for refusal) while cutting the median non-refusal latency from nearly 2x to 1.022–1.043x. Relative to prompt classifiers, RGD preserves 98.7–100% of greedy non-refusals on JBB, against 86.5–93.5% for LlamaGuard-4 and only 22.7–59.7% for Shieldstral and TPC. RGD achieves this without requiring deployment of a separate classifier alongside the target model. To the best of our knowledge, no other existing approach balances refusal & non-refusal preservation at high temperatures as well as RGD at its minimal level of incremental overhead.
I thank the authors for their rebuttal. However, their proposed method does not address a research question but rather combines multiple well-known techniques (e.g., prompt classifiers, such as residual classifiers) and obvious ideas (e.g., string matching over a few tokens) in a very straightforward way. As is evident from the results on reasoning models, most of the gains come from the prompt classifier applied at the beginning. If the authors had been the first to discover the observation made by Qi et al., this type of contribution could have been part of a research paper. However, in its current form, the work is primarily engineering rather than research. I maintain my original score. In fact, the rebuttal has strengthened my position, as the newly reported results show that most of the gains come from the prompt classifiers.
Thank you for recognizing the simplicity of our arguments, the clarity of our presentation, and the comprehensiveness of our results. We greatly appreciate your time and efforts to review our paper and have responded to each of your concerns below.
Early-refusal tokens are a post-training artifact; reasoning models decide after thinking
Thank you for raising this point regarding text-only gating on thinking traces. Despite this limitation, RGD-residual is actually well-suited for reasoning models because its residual readout predicts post-thinking greedy refusal from the last prompt token before any reasoning trace is generated. Furthermore, RGD-residual can be used with the prefix check applied only to answer-channel tokens (as opposed to reasoning traces) on prompts for which the readout classifier is uncertain.
To test this, we conducted new experiments on Qwen3.5-9B with thinking mode enabled across three variants: Text gate, thinking trace (prefixes re-calibrated on thinking traces), Text gate, answer channel (an ablation applying the published prefix gate to the post-thinking answer channel), and RGD-residual (a thinking-mode-calibrated last-prompt-token readout, AUROC 0.986 [0.981, 0.991], plus the answer-channel gate). We generated a greedy response plus 5 sampled responses at T=1.0 and T=2.0 for 1,000 prompts (4,096-token budget; 896 resolved greedy anchors—408 refusals, 488 non-refusals—with 104 unterminated thinking traces excluded) and replayed each variant's routing on these recorded outputs. Results are provided below for T=2.0 (RGD-residual results are similar for T=1.0). Metrics over the 896 resolved prompts are as in Table 1, except that non-refusal cost is the extra tokens per greedy non-refusal / the token ratio to direct sampling, counted from the recorded outputs.
You are correct that refusal tokens rarely appear at the start of the reasoning trace: gating the thinking trace adds only +1.0 pp over direct sampling, whereas gating the answer channel boosts refusal preservation to 97.8% at high token cost (1.44x). RGD-residual achieves nearly the same refusal preservation (97.5%) at 1.08x non-refusal cost because the pre-thinking readout sends easy-to-classify non-refusals (406 of 488) directly to sampling without decoding the greedy thinking trace.
We appreciate you raising this concern about reasoning models and will update our paper to include this new thinking-mode analysis and clarify that RGD-residual is the recommended variant when thinking mode is enabled.
Self-correction during generation
We already analyzed this exact comply-then-refuse (CTR) scenario in Appendix I. Specifically, we used two LLM annotators to label 766 greedy refusals that RGD or RGD-residual routed to sampling, with an author adjudicating their 48 disagreements. We found that CTR patterns are rare, occurring in only 31 of the 8,512 greedy refusals across the seven models (0.36%), which constitutes 4.3% of RGD's runtime misses and 0.13 pp of its pooled miss rate. Moreover, RGD-residual's high-side readout bypass recovers 5 of those 31 CTR prompts directly from the prompt's refusal representation (with its low-side bypass adding no CTR misses). Conversely, in the reverse self-correction case (refuse-then-comply), if a greedy response opens with a refusal prefix and later transitions into a safe answer, RGD continues the greedy stream to completion and returns that exact greedy response unchanged without safety loss or restart overhead. While we already include the CTR analysis in Appendix I of our submitted manuscript and reference it in Section 5.1, we will make the cross-reference in the main text more prominent.