<!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>Enhancing Human-Machine Authorship Discrimination in Generative AI Verification Task with BERT and Augmented Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Haojie Cao</string-name>
          <email>caohaojie0322@163.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zhongyuan Han</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jingyan Ye</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Biao Liu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yong Han</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</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>Voight-Kampf Generative AI Authorship Verification, a task proposed jointly by PAN and the ELOQUENT Lab [1], aims to diferentiate between human and machine authors by analyzing text features, addressing the escalating text generation abilities of large language models. This paper uses the BERT pre-trained model for binary classification, fine-tuning it to identify distinctive features of human and machine writing. Additionally, we introduced an augmented dataset to enhance the model's recognition capabilities. Through comprehensive evaluation, we achieved a ranking score of 0.778 on all test sets and achieved 11th place.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;PAN 2024</kwd>
        <kwd>Voight-Kampf Generative AI Authorship Verification</kwd>
        <kwd>BERT</kwd>
        <kwd>Text classification</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Approach</title>
      <sec id="sec-2-1">
        <title>Input</title>
      </sec>
      <sec id="sec-2-2">
        <title>Balanced</title>
      </sec>
      <sec id="sec-2-3">
        <title>Dataset</title>
      </sec>
      <sec id="sec-2-4">
        <title>Augmented</title>
      </sec>
      <sec id="sec-2-5">
        <title>Dataset</title>
      </sec>
      <sec id="sec-2-6">
        <title>Generative AI Text</title>
        <p>alpaca-7b text
...</p>
        <p>gpt-3.5 text
gemini-pro text</p>
      </sec>
      <sec id="sec-2-7">
        <title>Bert</title>
        <p>...
...</p>
        <p>Deactivate Neurons in Dropout</p>
      </sec>
      <sec id="sec-2-8">
        <title>Output human machine</title>
      </sec>
      <sec id="sec-2-9">
        <title>Balanced Dataset</title>
      </sec>
      <sec id="sec-2-10">
        <title>One-thirteenth of the</title>
      </sec>
      <sec id="sec-2-11">
        <title>Data</title>
      </sec>
      <sec id="sec-2-12">
        <title>Human-written Texts</title>
      </sec>
      <sec id="sec-2-13">
        <title>Augmented Dataset</title>
      </sec>
      <sec id="sec-2-14">
        <title>The Remaining AI</title>
      </sec>
      <sec id="sec-2-15">
        <title>Generated Texts</title>
      </sec>
      <sec id="sec-2-16">
        <title>AuTexTification 2023</title>
      </sec>
      <sec id="sec-2-17">
        <title>Human-written Texts</title>
        <p>Input layer
Hidden layer
Output layer</p>
        <sec id="sec-2-17-1">
          <title>2.1. Building Dataset</title>
          <p>
            The dataset provided by PAN comprises over a thousand human-written texts, alongside texts generated
by 13 distinct AI models. Each AI model generated an equal number of texts as the human-written
ones. To create a balanced dataset, one-thirteenth of the texts were randomly sampled from each of
the 13 sets of generative AI texts. This approach allowed us to construct a dataset where the number
of human-written texts is equal to the number of generative AI texts, ensuring a 1:1 ratio between
human and machine-generated content. The remaining generative AI texts were not discarded. Instead,
they were supplemented with an equal number of human-written texts collected from Hugging Face’s
Dataset Card for AuTexTification 2023 [
            <xref ref-type="bibr" rid="ref4">4</xref>
            ]. These texts were combined to form an augmented dataset,
also referred to as the augmented dataset. This additional dataset ensures a broader representation of
language patterns and helps improve the model’s ability to generalize. Finally, the Balanced Dataset
and Augmented Dataset will be randomly divided into training and validation sets, respectively, with
the training set accounting for 70% of the data and the validation set accounting for 30%.
          </p>
        </sec>
        <sec id="sec-2-17-2">
          <title>2.2. Fine-tuning the BERT Model</title>
          <p>During fine-tuning, no parameters of the base BERT model were fixed. All parameters were updated to
adapt to the binary classification task. Upon acquiring the BERT model, a fully connected (Dense) layer
was added to map the model’s output to the label space of the binary classicfiation task. This Dense
layer has two output units.</p>
          <p>
            To prevent overfitting, Dropout was applied to this fully connected layer, randomly setting a portion
of the neurons’ outputs to zero during each training iteration. This step helps increase the model’s
generalization capability. The Dropout rate was set to 0.1, meaning that 10% of the neurons are dropped
out. Additionally, a softmax activation function was used to convert the model’s outputs into class
probabilities. To train the model, the loss function, optimizer, and evaluation metrics were configured.
Considering that the labels of the task are integer class identifiers, sparse categorical cross-entropy
was selected as the loss function. The optimizer chosen was Adam [
            <xref ref-type="bibr" rid="ref5">5</xref>
            ], with a learning rate set to
2e-5. This relatively small learning rate helps stabilize the training process and prevent gradient
explosion. The evaluation metric used was accuracy, which measures the model’s performance in the
classification task.To prevent catastrophic forgetting, the model was first trained on the augmented
dataset for ten epochs. After each epoch, its performance was evaluated on the validation set to select
the best-performing model. Subsequently, the model was trained using the balanced dataset.
          </p>
        </sec>
        <sec id="sec-2-17-3">
          <title>2.3. Build Classifier</title>
          <p>
            In TIRA [
            <xref ref-type="bibr" rid="ref6">6</xref>
            ], the prediction task involves evaluating pairs of sentences, where the model needs to
determine which sentence is written by a human. To address this task, a simple classifier was developed
to compare the probabilities of the two sentences being written by a human. The classifier outputs 0 if
the probability of the first sentence being human-written is greater, and outputs 1 if the probability of
the second sentence being human-written is greater. This straightforward approach enables the model
to make binary predictions based on the relative likelihood of human authorship for each sentence pair.
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Result</title>
      <p>Based on the aforementioned methods, we identified the texts in the competition and uploaded our
results. Table 1 presents the final scores of the Voight-Kampf Generative AI Authorship Verification
2024 shared task, where the individual validity score is an aggregate across all test datasets, corrected
by half a standard deviation to penalize unstable classification performance. Rankings are based on the
mean average of all individual scores. Our team secured the 11th position out of 30, achieving a score of
0.778 across all test datasets. Table 2 provides an overview of the accuracy in detecting whether a text
is written by a human in Task 4 of PAN 2024 (Voight-Kampf Generative AI Authorship Verification).
Our model achieved a mean score of 0.906, surpassing most of the published baselines. In addition to
the primary test dataset, the PAN organizers evaluated the "Voight-Kampf" Generative AI Authorship
Verification on nine additional variants. Table 3 showcases the overview of the mean accuracy across
these nine variants of the test set. Among the nine variant datasets, our model demonstrated its lowest
accuracy at 0.361, while achieving a 75th percentile score of 0.959, with the highest accuracy reaching 1.
Our model consistently outperformed the baselines across most of these variant datasets, underscoring
its robustness and efectiveness in diverse scenarios.
Baseline Binoculars (Falcon-7B)
Baseline DetectLLM-LRR (Mistral-7B)
Baseline Fast-DetectGPT (Mistral-7B)
Baseline Text Length</p>
      <p>SYSTEM</p>
      <p>ROC-AUC Brier C@1</p>
      <p>F1</p>
      <p>F0.5 Mean
canary-paint
4. Conclusion
In this study, we addressed the challenge of distinguishing between human and machine-generated texts
in the Voight-Kampf Generative AI Authorship Verification 2024 task. By leveraging a BERT-based
model and incorporating data augmentation techniques, we enhanced the model’s ability to accurately
classify texts. Our approach involved constructing a balanced dataset, fine-tuning the BERT model, and
implementing a simple classifier for binary predictions.</p>
      <p>The evaluation results demonstrated the feasibility and efectiveness of our approach, achieving
a mean score of 0.778 and an overall ranking of 11, which outperformed all baseline models. These
ifndings suggest that our approach is a promising solution for human-machine authorship discrimination,
contributing to the broader field of AI authorship verification.</p>
    </sec>
    <sec id="sec-4">
      <title>Acknowledgements</title>
      <p>This work is supported by The Natural Science Foundation of Guangdong Province, China
(No.2022A1515011544)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <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="ref2">
        <mixed-citation>
          [2]
          <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="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Fabien</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Villatoro-Tello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Motlicek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Parida</surname>
          </string-name>
          , Bertaa:
          <article-title>Bert fine-tuning for authorship attribution</article-title>
          ,
          <source>in: Proceedings of the 17th International Conference on Natural Language Processing (ICON)</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>127</fpage>
          -
          <lpage>137</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Sarvazyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. Á.</given-names>
            <surname>González</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Franco-Salvador</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chulvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          , Overview of autextification at iberlef 2023:
          <article-title>Detection and attribution of machine-generated text in multiple domains</article-title>
          ,
          <source>in: Procesamiento del Lenguaje Natural</source>
          , Jaén, Spain,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>D. P.</given-names>
            <surname>Kingma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ba</surname>
          </string-name>
          ,
          <article-title>Adam: A method for stochastic optimization</article-title>
          ,
          <source>arXiv preprint arXiv:1412.6980</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <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-list>
  </back>
</article>