acceptodds
Under review as a conference paper at ICLR 2027

Detection of Machine-Generated Text Using Fine-Tuned Transformers and a Compact Classifier Based on Token-Level Probabilistic Features

Abstract

The widespread adoption of large language models (LLMs) has intensified the need for reliable detection of machine-generated content from human-written text. This work proposes and evaluates two complementary detection strategies: (1) fine-tuned pretrained transformers (RoBERTa, Llama 3.2 3B, and Qwen2.5-1.5B) for text classification, and (2) a compact sequence classifier based on token-level probabilistic features. Both approaches are trained on an extensive corpus combining the M4 and CUDRT datasets, which contain human-written and machine-generated texts. We evaluate the models on a diverse set of challenging benchmarks, including outputs from multiple LLMs and texts edited by humans or LLMs. Across five held-out benchmarks, detector performance was strongly dataset-dependent, and no single approach dominated across all evaluation settings. The Feature Model achieved the strongest performance among our individual models on selected benchmarks, while fine-tuned transformers performed better on others. A hard-voting ensemble combining the Feature Model with two fine-tuned transformers achieved the strongest result on BUST among the evaluated detectors. Ablation experiments show how feature types and feature-generating models affect detection performance. Using the same probabilistic inputs, the Feature Model achieves higher Macro-F1 than Logistic Regression and XGBoost baselines on all five held-out benchmarks. The Feature Model itself contains approximately 100k trainable parameters, although the computational cost of end-to-end inference is dominated by the four LLM feature generators. Overall, the results demonstrate the complementary strengths of fine-tuned and probabilistic-feature detectors rather than the universal superiority of either approach.

Primary area:
unsupervised, self-supervised, semi-supervised, and supervised representation learning
Keywords:
machine-generated text detection, AI-generated text detection, large language models, text classification, fine-tuned transformers, probabilistic features, token-level features, sequence classification

Reviews

Among:
Shape:
1234this paper, Bottom 27%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 2.00 over 3 reviews, above 27% of the others.
Reviewer_3Kw9OpenReview ↗
Rating
1
Confidence
3
Informativeness
1
Presentation
2
Soundness
1
Read review
Paper summary

This paper investigates the detection of machine-generated text through two approaches: fine-tuning pre-trained Transformer models (RoBERTa, Llama 3.2 3B and Qwen2.5-1.5B) for binary text classification and the use of a compact sequence classifier, known as the Feature Model, which uses probabilistic features extracted from multiple language models at the token level. The authors also explore a hard-voting ensemble that combines these two approaches.

The models were trained using M4 and CUDRT, and were evaluated using five held-out benchmarks, including scenarios involving texts edited by humans and LLMs. The results demonstrate significant variation across the evaluation datasets, indicating that no single detection approach consistently outperforms the others.

Critical strengths

Evaluation across different scenarios. The paper compares several detection approaches on five held-out benchmarks, including edited texts. This provides a useful insight into how they behave under different evaluation conditions.

It also compares complementary detection strategies. The study considers fine-tuned Transformer classifiers and lightweight models based on token-level probabilistic features, offering a comparison between approaches with different computational and modelling characteristics.

Critical weaknesses

1. Limited methodological novelty. My main concern is that the proposed approaches make only a limited methodological contribution. Fine-tuning pre-trained transformers for binary classification is a well-established NLP strategy, as is the use of token-level probabilistic features for detecting machine-generated text. Similarly, combining classifiers through hard voting is a conventional ensemble technique. In this sense, while the paper does evaluate these approaches in different settings, it does not make it sufficiently clear what the methodological contribution of the proposed Feature Model is beyond that of existing probability-based detectors. The paper would benefit from a clearer justification of the novelty of the proposed approach and a more explicit discussion of its differences from prior work.

2. Limited experimental insights and interpretation. I find that the analysis does not sufficiently detail the behaviour of the different detection strategies. The main finding is that performance varies considerably depending on the dataset, with no single approach consistently dominating. While this observation is relevant, the paper does not investigate the underlying factors of these differences sufficiently.

A more detailed analysis of the datasets' characteristics, the effects of human or LLM editing and the types of errors made by the detectors would help to explain why particular approaches perform better under certain conditions. Without such an analysis, it is difficult to identify what new insights the study provides beyond a comparison of established classification techniques.

Furthermore, the evaluation is restricted to English. While this is a valid experimental choice, it limits the scope of the conclusions, particularly since the underlying datasets contain multilingual data.

Overall, while the paper provides an empirical comparison of different detection strategies, I find the methodological novelty and the insights derived from the experiments insufficiently developed to constitute a substantial contribution.

Questions for authors
  1. How does the proposed Feature Model differ from existing machine-generated text detectors based on token-level probabilities and lightweight classifiers in terms of its specific methodological contribution?

  2. Have the authors investigated which dataset characteristics or types of text modification explain the differences in performance across the five evaluation settings? Such an analysis could help to establish whether the study provides insights that can be generalised beyond the reported benchmark results.

2 comments

We thank the reviewer for the detailed assessment. We revised the paper and added analyses that address both concerns.

Summary of the revision. We retrained the Feature Model with five random seeds and now select the epoch and seed only by macro-F1 on the in-distribution validation split; Table 3 reports this model and Appendix C reports the mean ± sd over seeds. The ensembles (Table 3) and the ablation (Table 5) were recomputed with the same protocol. The main conclusions of the paper are unchanged.

W1/Q1 – Methodological contribution and difference from existing probability-based detectors. Our contribution is not a new family of token-level probability features, but a learned aggregation of token-aligned predictability signals extracted from multiple variants of the same language model. Unlike approaches based on document-level statistics or independently computed detection scores, our Feature Model operates directly on the sequence of aligned token-level feature representations and uses self-attention to learn their interactions before aggregating them into a document-level prediction. The experiments systematically investigate whether this learned aggregation provides benefits over conventional classifiers trained on the same features, particularly under cross-dataset and cross-generator distribution shifts.

The revised Background (Section 2) positions the Feature Model with respect to the closest prior work:

  • Ghostbuster searches over combinations of token-level probability features from weaker language models and trains a linear classifier on the selected document-level aggregates; BiScope trains a classifier on statistics derived from forward and backward cross-entropy losses, whereas Telescope, Fast-DetectGPT and Binoculars are zero-shot detection scores based on token repetition probability, conditional probability curvature, and the ratio of perplexity to cross-perplexity between two language models, respectively.
  • Appendix F shows that this sequence model outperforms Logistic Regression and XGBoost trained on the same features on GRiD, MAGE, Beemo and BUST (all three are close to chance on Mixset), i.e. the learned aggregation contributes beyond the features themselves.

W2/Q2 – Which dataset characteristics explain the differences across benchmarks? The revised Sections 4.2, 4.5 and 4.6 and Appendices D–E identify three factors:

  1. Generator families seen vs. unseen in training (Section 4.2, Appendix D, Figure 1). On MAGE, accuracy on machine-generated text drops from 92–97% for families present in the training corpus (GPT-3.5/4, text-davinci, LLaMA, GLM) to 49–73% for absent families (OPT, FLAN-T5, T0, BLOOM, GPT-J, GPT-NeoX), for all developed detectors. The Feature Model is most affected by older open models (e.g. GPT-NeoX, OPT, GPT-J), whose outputs have a higher per-token perplexity under Llama 3.2 3B than human-written texts (19–30 vs. 17, compared with 7–8 for GPT-3.5/GPT-4) and are therefore scored as human-like. Recent unseen chat models in Beemo (Mistral, Mixtral, Zephyr, Gemma) cause much smaller drops.
  2. Decision threshold under distribution shift (Section 4.2, Appendix D). On GRiD all developed detectors separate the classes almost perfectly (ROC-AUC ≥ 0.99), yet their macro-F1 at the default threshold ranges from 68 to 95; the errors are mostly false positives on human text. We now report bootstrap confidence intervals, ROC-AUC and TPR at 1% FPR for all developed detectors.
  3. Labelling policy for edited text (Sections 4.5–4.6, Figure 2). Figure 2 now shows the category-level accuracy of all developed detectors on Mixset: every detector, including the fine-tuned transformers that recognise the other operations almost perfectly, fails on LLM-humanised texts labelled as human-written. On Beemo, where edited machine text keeps the machine label, the Feature Model is the strongest detector.

The results suggest that learned aggregation can improve cross-dataset generalisation over conventional classifiers using the same token-level features. However, this benefit does not eliminate limitations in the underlying feature representation. In particular, generalisation remains challenging for older unseen generator families, whose outputs exhibit predictability patterns that resemble human-written text under our feature extractors. Thus, our findings highlight both the potential of learned aggregation and the importance of the feature representation and its coverage of generator families.

English only. We agree. The feature generators are predominantly English models; we now state this explicitly as a limitation and list multilingual evaluation as future work (Section 4.6).

Reviewer_3Kw9OpenReview ↗

Assessment after author rebuttal

I have reviewed the revisions to the paper, which address several of my concerns about the experimental analysis. However, I still have concerns about the limited methodological novelty. While these new experiments provide useful evidence for the effectiveness of the proposed Feature Model, they do not change my assessment of its contribution to existing approaches substantially. Therefore, while I acknowledge that the revised manuscript is stronger, I have decided to maintain my original rating.

Reviewer_ZftAOpenReview ↗
Rating
3
Confidence
3
Informativeness
3
Presentation
3
Soundness
3
Read review
Paper summary

This paper presents two complementary approaches for detecting machine-generated text: fine-tuned transformer-based detectors and a compact classifier trained on token-level probabilistic features extracted from multiple LLMs. It conducts a series of comprehensive and extensive evaluations across five out-of-distribution benchmarks, including ablation studies, efficiency analysis, and robustness analysis on edited and humanized texts.

The paper shows three main findings: (1) no single detection approach consistently outperforms others across different datasets and generation models; (2) the proposed probabilistic feature-based classifier outperforms traditional classifiers using the same features, demonstrating the benefits of sequence modeling; and (3) fine-tuned and feature-based detectors provide complementary detection signals, although the effectiveness of their ensemble varies across datasets.

Critical strengths
  • The paper is well-written and easy to follow. The proposed method is clearly described.
  • The paper provides a wide range of evaluations to study multiple aspects of the AI-generated text detection problem, including different datasets, different types of detectors, and different types of text transformations. The evaluation is quite comprehensive and meaningful.
  • The paper provides a detailed analysis of the evaluation results, which helps us better understand the strengths and weaknesses of different approaches. The analysis is insightful and provides useful guidance for future research in this area.
Critical weaknesses
  • Lack of discussion on feature design and generalization
  • Lack of discussion on adaptive adversarial robustness
  • Lack of discussion on text granularity and length
Questions for authors

Overall, I don't have major concerns about this paper. I think the authors have put a lot of effort into the experiments, and the evaluation across different datasets is quite extensive and meaningful. I just have three points that I think would be interesting to discuss further.

  1. Feature design and generalization

My first point is about the feature design. I feel the current approach is a little bit brute-force. It basically extracts a bunch of probabilistic features from multiple models, feeds them into another model, and then combines different detectors through voting.

I wonder whether a more carefully designed set of features could actually work better. For example, some existing papers[1] look at token repetition patterns, while others[2] study how the surrounding token context affects the loss or predictability of a sequence. These more manually designed features may capture certain characteristics of machine-generated text more directly.

My concern is that when we simply let a model learn from a large collection of features, there could be a lot of redundancy, and the model might overfit to patterns that don't generalize well across datasets.

So I think it would be interesting to compare against some of these more carefully designed features on the same datasets. It might help us better understand whether the gains come from the specific features, the learned representations, or just combining more models.

  1. Adversarial robustness

My second point is about adversarial robustness. I noticed that the paper already evaluates edited and humanized texts, which is quite useful.

But I'm wondering whether these transformations are sufficient to evaluate adversarial robustness, especially when an attacker deliberately tries to evade the detector.

For example, could an attacker make small changes to the text specifically to disrupt the probabilistic features used by the Feature Model?

I think it would be interesting to see whether the feature-based approach and the fine-tuned models behave differently under these more targeted attacks. This might also help us better understand how much the models rely on dataset-specific patterns rather than more generalizable signals.

  1. Text granularity and length

My third point is about text granularity. I'm not sure whether the datasets already cover different text lengths, but I think this is worth discussing.

Intuitively, detecting short AI-generated text is often harder than detecting longer text, simply because there is less information available for the detector.

Since the paper compares several different approaches, I think it would be interesting to see how their performance changes with text length. For example, does the probabilistic feature-based model degrade more quickly on short texts? Or are the fine-tuned transformer models more sensitive to text length?

I think a length-based breakdown could provide some useful insights into when each approach works well and where its limitations are.

Reference

[1] Nassif, Christopher, and Josh F. Cooper. "Telescope: Improving Zero Shot Detection of LLM Generated Content By Measuring Token Repetition Probability." ICML 2026.

[2] Guo, Hanxi, et al. "Biscope: Ai-generated text detection by checking memorization of preceding tokens." NeurIPS 2024.

2 comments

We thank the reviewer for the positive assessment and the suggestions, which we addressed as follows.

Summary of the revision. We retrained the Feature Model with five random seeds and now select the epoch and seed only by macro-F1 on the in-distribution validation split; Table 3 reports this model and Appendix C reports the mean ± sd over seeds. The ensembles (Table 3) and the ablation (Table 5) were recomputed with the same protocol. The main conclusions of the paper are unchanged.

1. Feature design and generalisation. The input is deliberately small rather than a large collection of features: three standard predictability statistics per token (log-probability of the observed token, log-probability of the most likely token, and entropy; Przybyła et al., 2023), computed by four generators that share a tokenizer, i.e. twelve values per token. The revised paper analyses redundancy and dataset-specific behaviour of these features as follows:

  • Redundancy of feature types and generators (Table 5, Section 4.4). Every configuration restricted to one or two feature types reaches a lower mean macro-F1 than the full set, and no subset of generators exceeds the full configuration on average, so the features are complementary rather than redundant on average. However, some subsets score higher on individual benchmarks, which indicates partly dataset-specific contributions; we report this explicitly and note that two or three generators retain most of the performance at a lower cost.
  • Generalisation of the features across datasets (Section 4.2, Appendix D). The probabilistic features transfer well to generators whose text is similar to the training generators, but poorly to older open models such as GPT-NeoX, OPT and GPT-J. Under Llama 3.2 3B, texts from these models have a per-token perplexity of 19–30, higher than human-written MAGE texts (17), whereas GPT-3.5/GPT-4 texts have 7–8; in feature space they therefore resemble human text. This is a case where the features themselves, rather than the classifier, limit generalisation.
  • Features vs. learned aggregation (Appendix F). Logistic Regression and XGBoost trained on the same features perform clearly worse on four of the five benchmarks, so the gains are not explained by combining more models alone.

We agree that more carefully designed features may capture machine-generated text more directly, and we added Telescope and BiScope to the Background (Section 2). A direct comparison with such hand-designed features on the same benchmarks would separate the contribution of the features from that of the learned aggregation; we could not complete it within the rebuttal period and list it as future work (Section 4.6).

2. Adaptive adversarial robustness. We agree that edited and humanised texts do not replace an adaptive attack. The Mixset humanisation results show that this type of text transformation substantially reduces the accuracy of all evaluated detector families (2–24%). However, these experiments do not constitute an adaptive attack specifically targeting the Feature Model, nor do they establish which individual feature signals are responsible for the observed errors. We therefore identify systematic evaluation against adaptive attacks as an important direction for future work (Section 4.6).

3. Text granularity and length. Appendix D reports macro-F1 by text length for all developed detectors:

  • On MAGE and Beemo all detectors improve with length.
  • The Feature Model does not degrade faster on short texts: on Beemo it is the strongest detector below 64 tokens.
  • On GRiD, which consists mostly of short Reddit answers, all detectors are weakest on the shortest texts, the Feature Model most so.

We also trained the Feature Model on 512-token inputs, the same context as the fine-tuned detectors (Appendix C). Longer context helps on MAGE, whose texts are long, but not on the other benchmarks, so the 128-token limit does not explain the differences between the Feature Model and the fine-tuned detectors.

I appreciate the authors' response and additional discussion, which are helpful. I would appreciate a direct comparison with some baseline's carefully designed features, and an experiment of a more adaptive attacks, but I agree that they may be valuable future works. Overall, I find merits in this submission and would keep my current score.

Reviewer_mv8yOpenReview ↗
Rating
2
Confidence
2
Informativeness
2
Presentation
3
Soundness
3
Read review
Paper summary

This paper studies the detection of text generated by large language models. The authors explore two main approaches: efficient fine-tuning of pretrained Transformers and training a classifier using token-level probability features extracted from multiple LLMs. They conduct experiments on several benchmarks and analyze the detection results.

Critical strengths

The paper evaluates different detection methods on multiple independent benchmark datasets, providing a useful comparison of their performance across different data distributions. The ablation studies examine the contributions of different probability features and feature extraction models, helping to clarify the role of each component. The authors discuss the computational cost of feature extraction and the impact of different annotation strategies across datasets, addressing several practical considerations.

Critical weaknesses

The paper combines efficient fine-tuning with token-level probability features, but the differences between the proposed approaches and existing methods need to be clarified. In particular, the authors should explain why Transformer-based methods are necessary and why different variants of the same model are used for feature extraction. It would also be helpful to discuss whether this design could limit generalization to unseen models. Although the evaluation covers multiple independent benchmarks, the authors acknowledge that some datasets may share overlapping families of generative models. This overlap could affect the assessment of generalization. A more detailed analysis of generator overlap, together with results on genuinely unseen model families, would provide stronger evidence for the claimed generalization ability. Although the classifier itself contains only around 100,000 trainable parameters, feature extraction requires running four language models, which may introduce considerable computational overhead. The authors should report the inference cost of the entire pipeline, including runtime and computational requirements, and discuss the trade-off between detection performance and efficiency. The ensemble combining multiple features does not consistently outperform its best-performing individual component across the evaluated datasets. The authors should further analyze whether the different features provide complementary information and explain under what conditions the ensemble can deliver reliable performance gains. The benchmark datasets use different annotation rules for human-edited text and machine-generated text that has been polished by humans. These differences may affect the comparability of the results and the practical scope of the detection task. The authors should discuss how the annotation strategies influence the findings and clarify the types of text for which the proposed method is most applicable.

Questions for authors

Please refer to the weaknesses mentioned above and address these concerns in the revised manuscript.

2 comments

We thank the reviewer for the constructive comments.

Summary of the revision. We retrained the Feature Model with five random seeds and now select the epoch and seed only by macro-F1 on the in-distribution validation split; Table 3 reports this model and Appendix C reports the mean ± sd over seeds. The ensembles (Table 3) and the ablation (Table 5) were recomputed with the same protocol. The main conclusions of the paper are unchanged.

Differences from existing methods. The revised Background (Section 2) positions both approaches. Fine-tuned transformers learn directly from text; we apply LoRA/QLoRA to recent decoder models. Among probability-based detectors, Ghostbuster trains a linear classifier on selected document-level aggregates of token probabilities from weaker language models, BiScope trains a classifier on forward and backward cross-entropy statistics, and Telescope, Fast-DetectGPT and Binoculars are zero-shot scores. The Feature Model instead learns the aggregation over the token sequence of predictability features from several generators that share a tokenizer, and Appendix F shows that this outperforms Logistic Regression and XGBoost on the same features on four of the five benchmarks.

Why Transformer-based detectors, and why several variants of the same model as feature generators. Fine-tuned transformers are the standard supervised reference in machine-generated text detection (e.g. SemEval-2024), so we use them as the point of comparison. The Llama 3.2 variants share a tokenizer, which makes the twelve features aligned token by token. Base vs. instruct and 1B vs. 3B give different predictability profiles: in Table 5, single generators reach a mean macro-F1 of 61.1–64.3 over the five benchmarks, the best two- and three-generator subsets 66.5 and 66.9, and the full set 67.2; no subset exceeds the full configuration on average. We discuss the use of heterogeneous generator families as a limitation (Section 4.6).

Generalisation to unseen models and generator overlap. Generator families in the training corpus and in each benchmark:

BenchmarkGeneratorsOverlap with training families
Training (M4 + CUDRT)Baichuan, Qwen, Llama 2/3, ChatGLM, GPT-3.5/ChatGPT, text-davinci, Cohere, Dolly–
GRiDGPT-3.5-turbofull
MAGEGPT-3.5/4, text-davinci, LLaMA, GLM-130B; OPT, FLAN-T5, T0, BLOOM, GPT-J, GPT-NeoXpartial (18 of 27 generators unseen)
MixsetChatGLM, ChatGPT, Dolly, GPT-4, StableLM; editing by GPT-4 and Llama 2mostly seen
BeemoLlama 2/3.1, GPT-4o, Tulu 2; Mistral, Mixtral, Zephyr, Gemmamostly seen
BUSTFalcon, Llama 2, Guanaco, GPT-3.5/4, …partial

Results for seen and unseen families are in Section 4.2 and Appendix D: on MAGE, accuracy on machine-generated text drops from 92–97% to 49–73% for all developed detectors, mainly on older base and instruction-tuned models; on Beemo, recent unseen chat models cause drops of at most 2 points for the fine-tuned detectors and about 7 points for the Feature Model.

Inference cost of the full pipeline. Table 4 reports the complete pipeline (four generators and the classifier): 8.90B parameters, 1146.6 GMACs and 281 ms for 128 tokens. Section 4.3 now states that this latency was measured with the generators executed sequentially on one GPU; with one generator per GPU the latency is bounded by the slowest generator (about 95 ms). The pipeline is more expensive than any single fine-tuned detector at 128 tokens, but its cost does not grow beyond 128 tokens and two or three generators retain most of the performance (Table 5).

Ensembles. We removed the claim of synergy. Section 4.2 and Appendix E show that the errors of the Feature Model agree much less with those of the fine-tuned detectors (Cohen's κ of error indicators 0.10–0.40) than the fine-tuned detectors agree with each other (0.33–0.90), and the oracle accuracy is higher with the Feature Model than with RoBERTa. Hard and soft voting exploit this only on BUST, where the feature-inclusive ensemble is the best detector (Table 3): when the Feature Model is the only correct member it is out-voted. A learned combination calibrated on held-out in-domain data would be needed to benefit consistently; we list it as future work (Section 4.6).

Annotation policies. Section 4.6 discusses the labelling policies, and the revised Section 4.5 and Figure 2 quantify them: all detectors fail on Mixset's LLM-humanised texts labelled as human-written, while the Feature Model is the strongest detector on Beemo, where edited machine text keeps the machine label. The method is therefore most applicable when the goal is provenance (was the text produced by an LLM, possibly edited afterwards).

Thank you for the thoughtful and detailed responses. I appreciate the authors' efforts in addressing my concerns and clarifying the key points. The responses have resolved most of my questions, and I have no further major concerns. Considering the contributions and overall quality of the work, I have decided to maintain my original score.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.