<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Verifying Generative Text Authorship Model With Regularized Dropout</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Zijie Lin</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zhongyuan Han</string-name>
          <email>hanzhongyuan@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Leilei Kong</string-name>
          <email>kongleilei@fosu.edu.cn</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Miaoling Chen</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Shuyi Zhang</string-name>
          <email>shuyipro@foxmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jiangao Peng</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kaiyin Sun</string-name>
          <email>sunkaiyin123@163.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Foshan Huaying School</institution>
          ,
          <addr-line>Foshan</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Foshan University</institution>
          ,
          <addr-line>Foshan</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <abstract>
        <p>Generative AI authorship verification aims to identify the text authored by a human within a given pair of texts. This paper presents our method for the PAN 2024 Generative AI Authorship Authentication Task. We framed this task as a binary classification problem for individual texts. Initially, we utilized data augmentation techniques to balance the originally imbalanced dataset and trained the model on single texts. Additionally, we employed the Regularized Dropout method to optimize model training further. For a given pair of texts, the model processed each text individually for inference. Finally, a fully connected layer was used for classification, selecting the text with the higher human-authorship score as the answer. Our method achieved a mean score of 0.99 on the oficial test set.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;PAN 2024</kwd>
        <kwd>Generative AI Authorship Verification</kwd>
        <kwd>Data Augmentation</kwd>
        <kwd>Regularized Dropout</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Due to the rapid development of large language models (LLMs), their text generation capabilities have
reached a level comparable to human writing [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] . Developing efective methods to verify the authorship
of generated texts is crucial for mitigating the misuse of LLMs and reducing the harmful impact of
their content. In recent years, numerous studies have focused on machine text detection. For instance,
Hans [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] proposed a method called Binoculars, which compares the scores of two related language
models to determine whether a text is human-generated or machine-generated. Bao [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] introduced
"Fast-DetectGPT," a zero-shot detection method for machine-generated text that leverages conditional
probability curvature. Although these methods do not require training data and rely solely on analyzing
specific textual features for detection, they may be inefective when the characteristics distinguishing
human and machine-generated texts are not prominent. Therefore, we adopted the R-Drop method to
ensure consistency in the distribution of samples across diferent categories. The core idea of the R-Drop
method is to regularize the consistency between the outputs of two diferent sub-models generated
through dropout, thereby enhancing the model’s generalization ability and robustness. This method
constrains the results of two forward passes obtained by applying dropout to the same input data,
ensuring they remain consistent.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Method</title>
      <p>
        This section explains how to incorporate R-Drop to optimize our model during the training process. We
use the pre-trained language model Bert [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] for training. We consider this task a binary classification
problem for single text samples, thus employing the binary cross-entropy loss function as the foundation.
On top of this, we incorporate the R-drop method to construct the final loss function. This final loss
function is then used to train the model. The final loss function is expressed as follows:
ℒ = (ℒ(1, y) + ℒ(2, y)) +  (ℒ(1 ‖ 2) + ℒ(2 ‖ 1))
(1)
Where  is a hyperparameter that controls the contribution of the KL divergence in the total loss. In this
way, we consider the model’s prediction accuracy and enhance the consistency of the model’s results
from diferent forward passes, thereby improving the model’s stability and robustness.The specific steps
for creating the loss function are as follows:
      </p>
      <p>First, we input the data through the network and apply dropout to obtain two diferent forward
propagation results 1 and 2. Then, we calculate the binary cross-entropy loss ℒ for these two
results. The formula for binary cross-entropy loss ℒ is as follows:
ℒ(p, y) = − ∑︁ [ log  + (1 − ) log(1 − )] (2)</p>
      <p>where p is the predicted probability distribution of the model, and y is the actual label distribution.
Binary cross-entropy loss measures the inconsistency between the actual labels and the predicted
distribution and is a common loss function for binary classification problems.</p>
      <p>Next, we calculate the Kullback-Leibler (KL) divergence between the two results 1 and 2; the
formula is:
1
ℒ(1 ‖ 2) = ∑︁ 1 log 2 (3)</p>
      <p>Finally, the above KL divergence is added as a regularization term to the loss function. The final
loss function includes the weighted sum of binary cross-entropy loss and KL divergence loss. The
application of R-drop in the training process is shown in Figure 1.</p>
      <p>We selected the BERT model as the baseline model. We trained BERT using the training data that
will be mentioned below and optimized the model using R-Drop. During the inference phase, we
ifrst split the input text pair into two separate texts. Each text is then individually fed into the BERT
model for classification prediction. Finally, we select the text with the higher probability of being
human-generated as the final answer.</p>
      <p>label</p>
      <sec id="sec-3-1">
        <title>P!loss</title>
        <p>P!
softmax
loss
Dℒ =（ ! || " ）
label</p>
      </sec>
      <sec id="sec-3-2">
        <title>P"loss</title>
        <p>P"
softmax
units
dropped units
text
Self-Attention
Feed-Forward</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experiment</title>
      <sec id="sec-4-1">
        <title>4.1. Data Preprocessing</title>
        <p>In this task, we utilized two datasets. The first dataset is the guiding dataset provided by the organizers
for the Generative AI Authorship Verification task, known as pan24-generative-authorship-news. The
second dataset is sourced from the Kaggle platform, named DAIGT-V4-TRAIN-DATASET1(hereinafter
referred to as DAIGT-V4). The guiding dataset encompasses various genuine and fabricated news articles
from American headlines in 2021. It comprises 14 JSONL files, with one containing text generated by
human authors and the remaining 13 files containing text generated by diferent machine authors. The
DAIGT-V4 comprises a collection of CSV files containing text generated by one human author and 11
machine authors, covering topics such as mobile phones and automobiles, with 27370 texts generated
by humans and 46203 by machines. The minimum, maximum, and average lengths of texts in both
pan24-generative-authorship-news and DAIGT-V4 are presented in Table 1.</p>
        <p>Due to the proportion of human authors to machine authors being 1:13 in the dataset provided by
the organizers, namely "pan24-generative-authorship-news," to expand the data volume and balance
the ratio between human authors and machine authors, we utilized the DAIGT-V4 dataset to augment
the original data. The preprocessing of the data involved extracting 1000 texts generated by human
1You can find this dataset at https://www.kaggle.com/datasets/thedrcat/daigt-v4-train-dataset.
authors from the pan24-generative-authorship-news dataset while retaining their respective topics. We
randomly selected authors based on the same topics for the machine-generated texts. Subsequently, we
extracted 20000 texts generated by both human and machine authors from the DAIGT-V4 dataset in
a 1:1 ratio. We then combined these two sets of data and divided them into training and test sets at
a ratio of 9:1. In the training set, a label of 1 denotes texts generated by human authors; In contrast,
a label of 0 denotes texts generated by machine authors. All text will be truncated according to the
maximum input length of the model.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Experimental setting</title>
        <p>We conducted the entire experiment using the Pytorch framework. The optimizer used was the Adam
optimizer. During training, the loss function was a weighted sum of binary cross-entropy loss and
KL divergence, with a weight of 4 for the KL divergence. Dropout was set to 0.3, the maximum text
length was 512, the batch size was 32, the learning rate was 3e-5, and the number of epochs was 10.
The composition of the dataset used in the experiment is shown in Table 2.</p>
        <p>After dividing the dataset, we send a single text to the model for training. We used the same indicators
as the oficial PAN 2024 to evaluate our model and took the mean value as the final selection criterion
for the model. We obtained the best model in the second epoch.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Other method</title>
        <p>We also employed an ensemble learning approach to complete this task. In addition to the previously
mentioned dataset, we expanded our dataset using the SemEval subTask A dataset [11] . We utilized
three pre-trained language models: Bert-base-uncased, Roberta-base-uncased [12] , and
Deberta-baseuncased [13] . The training process was mainly similar to the method described above. During the
inference phase, we split each text pair into two separate texts and input them into the three models.
Each model predicts the text separately and obtains two scores; we choose the average score as the
ifnal score for a single text and select the one with the higher score as the human-generated text.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Results</title>
        <p>This subsection introduces the experimental results. Our team, Team lam in Table 3, submitted two
systems: system −  and system −  . Table 3 shows an overview of the
accuracy of our method and baseline methods in detecting whether humans write text in PAN 2024
(Voight-Kampf Generative AI Authorship Verification) Task 4. Among them, system − 
is our primary method, and the system −   is briefly introduced in Section 4.3.
Compared to baseline methods, our methods demonstrate significant improvements across most metrics.
For instance, the system −  achieves an  −   of 0.989, markedly higher than
the highest value of 0.972 attained by all baseline methods ( ). Additionally, the
system −  achieves scores of 0.989 or higher in , @1,  1,  0.5, and the average
value, indicating exceptionally high classification performance.</p>
        <p>Although the system −   slightly lags behind the the system − ,
it maintains all metrics around 0.865, still surpassing most baseline methods. Notably, it performs
comparably to the   −   ( ) method in the  1 and  0.5 metrics (both
0.883).
5. Conclusion
blistering-moss
acute-wireframe
To solve the task of generative artificial intelligence author authentication proposed by PAN 2024, we
propose two methods in this article. One is to use data augmentation and R-Drop to train the BERT
model. The other is to use the Ensemble learning voting method for author verification.</p>
        <p>The method of combining data augmentation with R-Drop yielded promising results. Despite the
integrated model’s overall performance potentially being inferior to the former, it demonstrated superior
efectiveness on certain test data subsets.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>This work is supported by the Social Science Foundation of Guangdong Province, China (No.GD24CZY02)
[11] Y. Wang, J. Mansurov, P. Ivanov, J. Su, A. Shelmanov, A. Tsvigun, O. M. Afzal, T. Mahmoud,
G. Puccetti, T. Arnold, et al., Semeval-2024 task 8: Multidomain, multimodel and multilingual
machine-generated text detection, arXiv preprint arXiv:2404.14183 (2024).
[12] Y. Liu, M. Ott, N. Goyal, J. Du, M. Joshi, D. Chen, O. Levy, M. Lewis, L. Zettlemoyer, V. Stoyanov,</p>
      <p>Roberta: A robustly optimized bert pretraining approach, 2019. arXiv:1907.11692.
[13] P. He, X. Liu, J. Gao, W. Chen, Deberta: Decoding-enhanced bert with disentangled attention, 2021.
arXiv:2006.03654.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Achiam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Adler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ahmad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Akkaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. L.</given-names>
            <surname>Aleman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Almeida</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Altenschmidt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Altman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Anadkat</surname>
          </string-name>
          , et al.,
          <source>Gpt-4 technical report, arXiv preprint arXiv:2303.08774</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>E.</given-names>
            <surname>Mitchell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Khazatsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Finn</surname>
          </string-name>
          , Detectgpt:
          <article-title>Zero-shot machine-generated text detection using probability curvature</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>24950</fpage>
          -
          <lpage>24962</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Ayele</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Babakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bevendorf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. B.</given-names>
            <surname>Casals</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chulvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dementieva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Elnagar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Freitag</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Korenčić</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mayerl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Moskovskiy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mukherjee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Panchenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Rizwan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Schneider</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Smirnova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Stamatatos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Stakovskii</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Taulé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ustalov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Yimam</surname>
          </string-name>
          , E. Zangerle,
          <article-title>Overview of PAN 2024: Multi-Author Writing Style Analysis, Multilingual Text Detoxification, Oppositional Thinking Analysis, and Generative AI Authorship Verification</article-title>
          , in: L.
          <string-name>
            <surname>Goeuriot</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Mulhem</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Quénot</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Schwab</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Soulier</surname>
          </string-name>
          ,
          <string-name>
            <surname>G. M. D. Nunzio</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Galuščáková</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. G. S. de Herrera</surname>
          </string-name>
          , G. Faggioli, N. Ferro (Eds.),
          <source>Experimental IR Meets Multilinguality, Multimodality, and Interaction. Proceedings of the Fifteenth International Conference of the CLEF Association (CLEF</source>
          <year>2024</year>
          ), Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bevendorf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Karlgren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Dürlich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Gogoulou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Talman</surname>
          </string-name>
          , E. Stamatatos,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <article-title>Overview of the “Voight-Kampf” Generative AI Authorship Verification Task at PAN</article-title>
          and
          <article-title>ELOQUENT 2024</article-title>
          , in: G. Faggioli,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Galuščáková</surname>
          </string-name>
          , A. G. S. de Herrera (Eds.),
          <source>Working Notes of CLEF 2024 - Conference and Labs of the Evaluation Forum, CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kolyada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Grahm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Elstner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Loebe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hagen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <article-title>Continuous Integration for Reproducible Shared Tasks with TIRA.io</article-title>
          , in: J.
          <string-name>
            <surname>Kamps</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Goeuriot</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Crestani</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Maistro</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Joho</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Davis</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Gurrin</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          <string-name>
            <surname>Kruschwitz</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Caputo (Eds.),
          <source>Advances in Information Retrieval. 45th European Conference on IR Research (ECIR</source>
          <year>2023</year>
          ), Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York,
          <year>2023</year>
          , pp.
          <fpage>236</fpage>
          -
          <lpage>241</lpage>
          . doi:
          <volume>10</volume>
          .1007/ 978-3-
          <fpage>031</fpage>
          -28241-6_
          <fpage>20</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>L.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Meng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , T.-Y. Liu, et al., R-drop:
          <article-title>Regularized dropout for neural networks</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>34</volume>
          (
          <year>2021</year>
          )
          <fpage>10890</fpage>
          -
          <lpage>10905</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chao</surname>
          </string-name>
          ,
          <article-title>A survey on llm-gernerated text detection: Necessity, methods, and future directions (</article-title>
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Hans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Schwarzschild</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Cherepanova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kazemi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Saha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Goldblum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Geiping</surname>
          </string-name>
          , T. Goldstein,
          <article-title>Spotting llms with binoculars: Zero-shot detection of machine-generated text</article-title>
          ,
          <year>2024</year>
          . arXiv:
          <volume>2401</volume>
          .
          <fpage>12070</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>G.</given-names>
            <surname>Bao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Teng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Fast-detectgpt:
          <article-title>Eficient zero-shot detection of machine-generated text via conditional probability curvature</article-title>
          ,
          <source>in: The Twelfth International Conference on Learning Representations</source>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          ,
          <year>2019</year>
          . arXiv:
          <year>1810</year>
          .04805.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>