- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
In this paper, the authors study whether an observed refusal adequately characterizes the safety of an autoregressive language model’s continuation distribution. The paper introduces Bounded Continuation Analysis (BCA), which constructs a continuation tree, evaluates terminal continuations with a semantic harm judge, and aggregates their probabilities to quantify bounded harmful reachability. The authors further introduce Generative-Attack Susceptibility (GAS), which tracks the maximum bounded harmful mass among prompts encountered within an attack budget. Overall, the paper presents a potentially useful perspective on distribution-aware safety evaluation.
Critical strengths
- The paper addresses an important limitation of evaluating safety from a single decoded response. A refusal under greedy decoding does not establish that other likely continuations are safe, and examining the probability assigned to alternative responses is a well-motivated direction. The distinction between observed refusal and distributional vulnerability is relevant to both model auditing and the allocation of red-teaming effort.
- The tree-based approach is straightforward and well motivated, providing an intuitive way to explore alternative continuations and quantify their harmful probability mass.
Critical weaknesses
-
The advantage of BCA over direct sampling remains unclear. Could the authors compare it with batch generation under different temperature or top- settings, using matched computational budgets, to establish its practical benefit for jailbreak risk evaluation?
-
It is unclear whether eight-token prefixes reliably indicate harmful completed responses. Could the authors clarify the evaluator inputs and validate prefix judgments against completed rollouts, including sensitivity to the generation horizon?
-
The methodological novelty appears limited. More comprehensive sensitivity analyses of , , and , together with evaluation on an additional benchmark, would strengthen the empirical contribution.
Questions for authors
My main questions are incorporated into the weaknesses above. The most consequential clarifications are what the eight-token leaf labels represent, how much probability mass the bounded trees retain, and whether BCA improves coverage over repeated judge-guided search at the same total cost. Reconciled experimental counts and independently evaluated final selections would further strengthen confidence in the findings.
Response to R3
1. Comparison with direct sampling
We agree that direct sampling is an important baseline, but emphasize that BCA is primarily intended as a formal diagnostic tool for internal model safety evaluation rather than a more efficient sampling strategy. Unlike Monte Carlo estimation, BCA computes exact harmful reachability within a bounded continuation tree, providing a deterministic lower bound without sampling variance. This is particularly useful for identifying low-probability harmful continuations that may be missed by finite sampling. We acknowledge that matched-budget comparisons across decoding temperatures and top-p settings would further clarify its computational trade-offs, although these settings also change the underlying generation distribution being evaluated.
2. Reliability of eight-token prefix evaluations
We acknowledge that evaluating harmfulness from short prefixes introduces uncertainty, as an eight-token continuation may not fully capture the eventual behavior of the model. Our current approach evaluates bounded continuations using a semantic harm judge, but does not establish that these judgments always agree with completed responses. Nevertheless, Table 2 provides empirical validation against independently sampled full generations, demonstrating positive correlations of 0.534–0.733 between BCA scores and realized harmful outcomes. We will clarify this distinction and discuss the importance of evaluating longer horizons and prefix-to-completion consistency.
3. Methodological novelty and sensitivity analysis
While our work builds on the bounded probabilistic model-checking formulation introduced by LLMChecker, our contributions extend beyond applying an existing technique. Specifically, we introduce GPU-batched continuation analysis, extend model checking to semantic harmful reachability, and formulate GAS to characterize susceptibility under adaptive adversarial search. We further demonstrate that BCA reveals vulnerabilities hidden by saturated ASR measurements and identifies failures complementary to judge-guided search.