- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper is centered on the zero-shot text detection problem. It finds that the influence of decoding settings can be even larger than that of model identity. The authors decompose the expected score of a family of likelihood-based detectors and show that the score is influenced by both the entropy term and the KL term. In experiments, the authors find that changing decoding settings, such as truncation, can substantially affect detection performance, while changing model identity has a smaller effect. Overall, this paper provides an interesting perspective on the high sensitivity of these detection methods to decoding settings and provides insights for related research.
Critical strengths
I summarize the core strengths of the paper as follows.
-
The research topic is practical and meaningful. Decoding is a normal setting of large language model generation. The paper evaluates whether the detector judgment would change explicitly while the decoding settings change, which would be beneficial for understanding whether the evaluation results of the generation setting are generalizable.
-
The theoretical analysis and controlled experiments are clear. The authors decompose the expected score into entropy and KL terms and execute different controlled experiments. This would make the analysis not only stay at the performance change, but also explain where the change comes from.
-
The paper provides validation beyond a single method and contains different types of comparisons. Besides liketropy, the authors also test some other methods, such as rank-based and supervised detectors. The supervised detectors retain some distinguishability on the same text, which would help explain that the observed failure mode is related to the detector methods and cannot be attributed to the text itself.
Critical weaknesses
I summarize the core weaknesses of the paper as follows.
-
This paper is more like an expansion of known phenomena and theory, with incremental contributions. As acknowledged by the authors, the fact that changing decoding settings can influence detection has been pointed out by prior works [1, 2]. Meanwhile, the entropy–KL decomposition underlying liketropy also appears in prior work [3]. The core contribution of this paper is to extend the decomposition to a family of likelihood-based detectors and empirically test the influence of decoding settings and generator differences on the scores. Thus, the novelty of the paper may be relatively limited, though the authors have stated the differences from prior work. Further clarification of which conclusions come from prior work and what the new conclusions imply would make the contribution of the current work clearer.
-
The generalizability and applicability are relatively limited. The paper mainly covers a family of likelihood-based zero-shot detectors. Meanwhile, there are other zero-shot methods, such as the black-box version of DNA-GPT [4] and DetectGPT [5], which are not evaluated in the paper. Though the authors conduct experiments on rank-based methods, these methods are not covered by the theoretical analysis of the paper. Thus, it is still unclear whether the mechanism described in the paper is also applicable to a broader range of zero-shot detectors.
-
It is unclear whether the failure persists as model size increases. The authors clearly state in the limitations that hardware constraints limit model size to around 8 billion parameters. However, due to this constraint, the current evidence is still insufficient to judge whether the failure mode reported in the paper would persist, become weaker, or become stronger as model size increases.
[1] https://arxiv.org/abs/1911.00650
[2] https://proceedings.mlr.press/v258/kempton25a.html
[3] https://arxiv.org/abs/2501.02406
Questions for authors
- Is the conclusion of this paper also applicable to the other zero-shot detector methods?
- Could the authors provide some small-scale experiments on models with larger sizes?
2 comments
Gentle Follow-up
Dear Reviewer MSzG,
Thank you again for your time and constructive review. We wanted to gently follow up to let you know that we have uploaded a revised version of the paper incorporating our responses, with all changes highlighted in blue.
In response to your comments, the revision adds experiments with two larger language models, Gemma-2-27B and Qwen2.5-32B (Appendix O), and clarifies our positioning relative to prior work and the scope of the theory.
We would be grateful to hear whether our response and the revision address your concerns, and we are happy to clarify anything further before the discussion period closes.
Best regards, The authors
We thank you for the careful reading. We begin with the new experiment on larger models.
Experiments on Larger Models. We followed your suggestion and reran the full protocol with Gemma-2-27B and Qwen2.5-32B as evaluators, which are significantly larger than the six original ones. Both large evaluators reproduce the failure of zero-shot detection, and every statistic falls within or close to the range of the six original evaluators. The results are summarized below.
As can be seen, the qualitative findings remain unchanged. The five conditions keep the same order by distance from zero (A < Human < B’’ < B < A’’). The identity term still makes up only about 16% of the combined size of the two terms. Finally, changing the decoding still moves the score further than changing the generator. We will add these results as a new appendix.
Positioning of our contributions. The paper exposes an intrinsic limitation of likelihood-based zero-shot detection: it is so sensitive to what are usually regarded as minor implementation details (e.g., the difference between a language model and a mildly truncated version of it, which are routinely treated as the same model) that detection itself can fail. In this sense, the paper does more than report that “decoding setting influences the score.” Instead, it shows (i) that the effect is large enough to break the detector and (ii) why this happens.
Failure of the detectors. Under raw sampling, the test accepts 88% of human text as the model’s own. In comparison, truncation alone (top-k 40, top-p 0.96, as configured in [3]’s pipeline) pushes the score of the model’s own text far from zero, so the test rejects 77% of it as not self-generated. (Note that [3]’s Theorem 1(a) covers only full-vocabulary sampling, yet [3] evaluates on truncated text and labels it as the model’s own.) The separation [3] reports (with AUROC up to 0.99) therefore comes mainly from the decoding difference, not from recognizing who wrote the text since under raw sampling, AUROC falls drastically to 0.36–0.56.
The mechanism. We decompose the expected score of every detector in the log-likelihood family into a configuration term and an identity term (Proposition 1). The configuration term, which [3] folds into an error term, becomes 3.7× to 7.4× the identity term on the evaluator’s own truncated text. Hence it is the sensitivity of this term on model decoding configuration that ultimately leads to the failure of the detector.
Scope. We agree that our theory focuses on likelihood-based tests, and the paper states these boundaries explicitly; see Equation 2 and Table 2. DetectGPT’s T5 perturbation step falls outside that form, but its analytic successor Fast-DetectGPT is inside it and falls from 0.99 to 0.53; see Table 3. Rank scores, the second half of GLTR, are reported in Appendix J as a robustness check outside the theory, and fail in the same way. Black-box methods such as DNA-GPT do not use token probabilities and lie outside the scope of this paper. In the camera-ready version, we will further clarify those points.
We hope these results and clarifications address your concerns. If so, we would be grateful if you would take them into account in your assessment.