<!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>
      <journal-title-group>
        <journal-title>Conference and Labs of the Evaluation Forum, September</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>AI Authorship Verification Based On Deberta Model</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ye Zhu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Leilei Kong</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Foshan University</institution>
          ,
          <addr-line>Foshan, Guangdong</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>0</volume>
      <fpage>9</fpage>
      <lpage>12</lpage>
      <abstract>
        <p>Generative AI Authorship Verification is the task of distinguishing between human-authored and machinegenerated texts. This paper explores the application of the pre-trained language model Deberta to address this problem. Our approach involves fine-tuning the Deberta model on a curated dataset comprising both human and machine-generated texts. To manage the imbalance in our dataset, we employed a random sampling to ensure a balanced representation of both types of texts during training. Preliminary experiments show that while our method performs comparably with existing approaches, there is significant potential for further optimization and improvement in identifying human-authored texts. Future work will explore advanced techniques and larger datasets to enhance model.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Authorship Verification</kwd>
        <kwd>Machine-generated Texts</kwd>
        <kwd>Deberta</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        With Large Language Models (LLMs) improving at breakneck speed and seeing more widespread
adoption every day, it is getting increasingly hard to discern whether a given text was authored by a
human being or a machine. These models, such as GPT-3[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], GPT-4[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], and others, generate text that
is often indistinguishable from human writing, posing significant challenges for various applications,
including academic integrity, content verification, and online misinformation.
      </p>
      <p>
        Many classification approaches have been devised to help humans distinguish between human and
machine-authored text. Traditional methods rely on surface-level features such as word frequency,
syntactic patterns, and stylistic elements, but these features can be easily mimicked by advanced
LLMs[
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ]. Thus, the task of authorship verification in the context of human vs. machine text remains
a critical and challenging problem.
      </p>
      <p>
        Recently, PAN 2024[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] posed a task: given two texts, one written by a human and the other by
a machine, identify the human-authored text[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. We approached this as a binary classification task,
which simplifies the challenge and allows us to focus on identifying the most distinctive features of
human-authored texts.
      </p>
      <p>
        To address this task, we use the Deberta[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] model as the pre-trained model, an improved version
derived from Bert[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], known for its efective text feature encoding. Deberta’s architecture enhances
the attention mechanism, making it more adept at capturing intricate patterns in the text. However,
sometimes the data we get is not as perfect as we expected.Therefore, in situations where datasets are
limited and imbalanced, we adopted a random sampling method that eficiently and economically trains
the model by selectively sampling portions of the text data. This approach involves randomly selecting
a subset of machine-generated samples for each training epoch while including all human-generated
samples. By retaining the most relevant features and reducing the computational load, our method
optimizes the training process. Previous studies have shown that specific sampling techniques can
significantly improve model performance in imbalanced data scenarios[
        <xref ref-type="bibr" rid="ref10 ref11 ref9">9, 10, 11</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Data Analysis</title>
      <p>PAN 2024 provides a guided dataset covering both real and fake news articles from multiple 2021 US
news headlines. Each file contains a list of articles, written either by (any number of) human authors or
a single machine. Machine text is generated by some large language models such as Gemini Pro[12].</p>
      <p>The dataset comprises human-authored text and machine-generated text, with a significant
imbalance in the ratio between the two categories (1:13). To address this challenge, we adopted a random
sampling approach during model training. Due to the limited data availability and the need to balance
computational resources, we trained the classification model for two epochs.</p>
      <p>In the first epoch, we randomly selected 1200 samples from the combined machine-generated text to
ensure representation from diferent sources and topics. For the second epoch, we increased the sample
size to 3000 to further enrich the training data. All human-authored samples were included in both
epochs to maintain a balanced representation of human and machine texts.</p>
      <p>Subsequently, in each epoch, we combined these two sets of data into a format where a label
corresponds a type of text, classifying the two types of texts separately. We then split the data into
training, validation, and test sets in a ratio of 0.95, 0.05, and 0.05, respectively. This partitioning strategy
ensured that the model was trained on a diverse range of samples while maintaining suficient data
for evaluation and testing. Finally, we utilized the Deberta-large model architecture for AI authorship
verification on the combined dataset.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Experiments and Results</title>
      <sec id="sec-3-1">
        <title>3.1. Experiment setup</title>
        <p>We utilized the Deberta-large model, which is characterized by a vocabulary size of 50,000, a hidden size
of 1024, 24 layers, and a total of 3.03 billion parameters. This model was selected for its disentangled
attention mechanism and enhanced masked decoder. The classification model was built using PyTorch,
with training conducted using a batch size of 2. We did not set a maximum encoder length, fully
leveraging the model’s capacity to handle long texts. The AdamW[13] optimizer, with a learning rate of
1e-6, was employed to update the model weights, while cross-entropy[14] was used as the loss function
to measure prediction error. The network was trained over 2 epochs to ensure thorough learning
without overfitting.</p>
        <p>In this study, we just utilized the [CLS] token, which is a standard practice in BERT and its derivative
models. The [CLS] token is positioned at the onset of the sequence, serving to aggregate information
from the entire input sequence, which is crucial for classification tasks. We employed the [CLS]
token based on the default settings as per the model’s pre-training, without any modifications to its
functionality.</p>
        <p>All experiments were conducted on an NVIDIA A800 GPU with 80GB of memory, providing the
necessary computational power to handle the large model and extensive dataset. Additionally, data
augmentation techniques such as random sampling were applied to enhance the training data diversity,
thereby improving the model’s generalization ability. Performance metrics, including accuracy, precision,
recall, and F1-score, were used to evaluate the model’s efectiveness on the test dataset.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Results</title>
        <p>To process each sample, we compare the confidence scores of Text 1 and Text 2. If Text 1’s confidence
score is higher, the final confidence score is 1 minus Text 1’s confidence score; if Text 2’s confidence
score is higher, the final confidence score is Text 2’s confidence score.</p>
        <p>Table 1 summarizes the performance of the validation and test sets in this experiment, highlighting
high accuracy, precision, recall, and F1 scores.Table 2 shows the summarized results averaged (arithmetic
mean) over 10 variants of the test dataset. Each variant uses a diferent technique to test the robustness
of authorship verification approaches, such as switching text encoding, translating text, changing
the domain, and manual obfuscation. Table 3 shows the results, initially pre-filled with the oficial
baselines provided by the PAN organizers and summary statistics of all submissions to the task (i.e., the
maximum, median, minimum, and 95-th, 75-th, and 25-th percentiles over all submissions to the task).
The evaluations for Table 2 and Table 3 were conducted on the PAN 2024 Generative AI Authorship
Verification task training dataset using the TIRA[ 15] platform. Our method, referred to as "beige-limit"
in the tables, is compared against various baselines.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>This paper addresses Generative AI authorship verification using the Deberta model. The goal was to
distinguish between human and machine-authored texts. By employing a pre-trained Deberta-large
model and random sampling to manage data imbalance, we conducted a series of experiments to evaluate
the model’s performance.We ranked 23rd in this task using this method.</p>
      <p>Our study indicates that advanced pre-trained language models like Deberta have potential for
authorship verification tasks. Future research could explore more eficient training strategies and extend
this approach to other domains and languages.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>This research was supported by the Natural Science Platforms and Projects of Guangdong Province
Ordinary Universities (Key Field Special Projects) (No. 2023ZDZX1023)
[12] T. G, R. Anil, S. Borgeaud, et al., Gemini: a family of highly capable multimodal models, arXiv
preprint arXiv:2312.11805 (2023).
[13] I. Loshchilov, F. Hutter, Decoupled weight decay regularization, arXiv preprint arXiv:1711.05101
(2017).
[14] R. Rubinstein, The cross-entropy method for combinatorial and continuous optimization,
Methodology and computing in applied probability 1 (1999) 127–190.
[15] M. Fröbe, M. Wiegmann, N. Kolyada, B. Grahm, T. Elstner, F. Loebe, M. Hagen, B. Stein, M. Potthast,
Continuous Integration for Reproducible Shared Tasks with TIRA.io, in: J. Kamps, L. Goeuriot,
F. Crestani, M. Maistro, H. Joho, B. Davis, C. Gurrin, U. Kruschwitz, A. Caputo (Eds.), Advances
in Information Retrieval. 45th European Conference on IR Research (ECIR 2023), Lecture Notes
in Computer Science, Springer, Berlin Heidelberg New York, 2023, pp. 236–241. doi:10.1007/
978-3-031-28241-6_20.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>L.</given-names>
            <surname>Floridi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chiriatti</surname>
          </string-name>
          , Gpt-3
          <article-title>: Its nature, scope, limits, and consequences</article-title>
          ,
          <source>Minds and Machines</source>
          <volume>30</volume>
          (
          <year>2020</year>
          )
          <fpage>681</fpage>
          -
          <lpage>694</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <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>
          , et al.,
          <source>Gpt-4 technical report, arXiv preprint arXiv:2303.08774</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Ippolito</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Duckworth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Callison-Burch</surname>
          </string-name>
          , et al.,
          <article-title>Automatic detection of generated text is easiest when humans are fooled</article-title>
          , arXiv preprint arXiv:
          <year>1911</year>
          .
          <volume>00650</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>R.</given-names>
            <surname>Zellers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Holtzman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Rashkin</surname>
          </string-name>
          , et al.,
          <source>Defending against neural fake news, Advances in neural information processing systems</source>
          <volume>32</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <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="ref6">
        <mixed-citation>
          [6]
          <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="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          , et al.,
          <article-title>Deberta: Decoding-enhanced bert with disentangled attention</article-title>
          , arXiv preprint arXiv:
          <year>2006</year>
          .
          <volume>03654</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          , et al.,
          <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding</article-title>
          , arXiv preprint arXiv:
          <year>1810</year>
          .
          <volume>04805</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>N. V.</given-names>
            <surname>Chawla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. W.</given-names>
            <surname>Bowyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. O.</given-names>
            <surname>Hall</surname>
          </string-name>
          , et al.,
          <article-title>Smote: synthetic minority over-sampling technique</article-title>
          ,
          <source>Journal of artificial intelligence research 16</source>
          (
          <year>2002</year>
          )
          <fpage>321</fpage>
          -
          <lpage>357</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>N.</given-names>
            <surname>Japkowicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Stephen</surname>
          </string-name>
          ,
          <article-title>The class imbalance problem: A systematic study</article-title>
          ,
          <source>Intelligent data analysis 6</source>
          (
          <year>2002</year>
          )
          <fpage>429</fpage>
          -
          <lpage>449</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M.</given-names>
            <surname>Buda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Maki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Mazurowski</surname>
          </string-name>
          ,
          <article-title>A systematic study of the class imbalance problem in convolutional neural networks</article-title>
          ,
          <source>Neural networks 106</source>
          (
          <year>2018</year>
          )
          <fpage>249</fpage>
          -
          <lpage>259</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>