<!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>T. Li);</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Fine-Grained Human-AI Collaborative Text Classification Using DeBERTa</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tao Li</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Guo Niu</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>2025</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>In this PAN-CLEF 2025 Subtask 2: Human-AI Collaborative Text Classification challenge, our objective is to categorize documents co-authored by humans and Large Language Models (LLMs). Specifically, we aim to classify texts into six distinct categories based on the nature of human and machine contributions. Utilizing the pre-trained language model DeBERTa-v3-large, we fine-tuned it for this specific classification task. Our experimental results demonstrate that this approach efectively distinguishes between diferent types of texts, contributing significantly to the understanding of human-AI collaboration and mitigating risks associated with synthetic text.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;PAN 2025</kwd>
        <kwd>Generated Content Analysis</kwd>
        <kwd>Human-AI Collaborative Text Classification</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>
        In recent years, research on human-AI collaborative writing has gradually increased. Early work mainly
focused on determining whether a text was generated by AI, such as the GPT-2 Detector developed
by OpenAI [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. However, as generation technology has advanced, simply distinguishing between
"AI-generated vs. human-written" has become insuficient. Therefore, more granular classification
tasks have emerged. Some studies have attempted to introduce multimodal features (e.g., syntactic
structures, sentiment tendencies) to assist classification, but due to the high cost of data annotation,
most research still relies primarily on plain text input. Additionally, some scholars have proposed
staged classification strategies—first determining whether a text contains AI components, then further
classifying its type. Regarding model selection, Transformer-based models (such as BERT, RoBERTa,
DeBERTa) have been widely applied to text classification tasks [
        <xref ref-type="bibr" rid="ref3 ref6">6, 7, 3</xref>
        ]. Among them, the DeBERTa
series, owing to its unique design for contextual awareness and position modeling, has demonstrated
excellent performance across various NLP tasks. DeBERTa-v3-Large [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], in particular, exhibits stronger
capabilities in long-text understanding and complex semantic modeling through improved relative
positional encoding and discriminative pre-training approaches.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology</title>
      <sec id="sec-3-1">
        <title>3.1. Data Preparation and Preprocessing</title>
        <p>We utilize the oficially provided training, validation, and test sets, which collectively contain six types
of text samples corresponding to diferent human-AI collaborative writing styles. Each sample includes
the original text content (text) and its associated class label (label). Data preprocessing mainly
involves the following steps:
• Uniform Formatting: The raw text is directly fed into the model to preserve potentially
styledistinguishing linguistic features.
• Text Encoding and Alignment: The text is tokenized using the tokenizer corresponding to
DeBERTa-v3-large, and all sequences are truncated or padded to a maximum length of 512 tokens
to meet the model’s input requirements.
• Label Mapping: A bidirectional mapping between category names and integer IDs (id2label /
label2id) is established to support multi-class classification.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Model Architecture and Training Strategy</title>
        <sec id="sec-3-2-1">
          <title>3.2.1. Model Selection</title>
          <p>
            Recently, advances in Natural Language Processing (NLP) have benefited significantly from progress
in pre-trained language models, with DeBERTa standing out among them [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ]. It has shown
outstanding performance across multiple benchmark tasks. First, the core architectural characteristics of
DeBERTa lay the foundation for its performance in complex text classification tasks. The model adopts
an ELECTRA-style pre-training method, efectively improving training eficiency and performance
through a generator-discriminator framework. At the same time, gradient-decoupled embedding
sharing significantly reduces computational resource requirements. DeBERTa not only possesses strong
semantic understanding capabilities but can also adapt well to multi-class text classification tasks.
Moreover, its large vocabulary (128K tokens) and flexible input-output structure further expand its
applicability.
          </p>
          <p>
            DeBERTa-v3-Large is the third-generation DeBERTa model proposed by Microsoft, with 178 million
parameters [
            <xref ref-type="bibr" rid="ref4">4</xref>
            ]. Its advantages include: first, the use of a mechanism that separates content and position
representations, enhancing the model’s ability to understand context; second, the introduction of a
hybrid of absolute and relative positional encoding, strengthening modeling of long-range dependencies;
and finally, an improved Masked Language Modeling (MLM) objective function that boosts pre-training
eficiency.
          </p>
        </sec>
        <sec id="sec-3-2-2">
          <title>3.2.2. Fine-Tuning Strategy</title>
          <p>During actual training, we employed the standard full-parameter fine-tuning strategy. Specifically, we
loaded a pre-trained language model and added a classification head on top of it. Then, all parameters
of the entire model were updated without freezing any layers. This strategy is suitable when the target
task dataset is moderately sized and suficient computing resources are available. In this case, the
dataset meets these conditions.</p>
          <p>Throughout the training process, the AdamW optimizer and a relatively small learning rate were
used to ensure that the language representations already learned by the pre-trained model would not
be disrupted during fine-tuning. Meanwhile, weight decay was implemented to prevent overfitting.
The model was trained for three epochs in total. Additionally, an early stopping mechanism was
utilized to both prevent overfitting, verifying promptly at per epoch and stopping early on the dev set,
which improve model performance. Micro F1 score was used as the primary evaluation metric to guide
the optimization process. To enhance training eficiency and save GPU memory, all input texts were
uniformly truncated or padded to a maximum length of 512 tokens.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments</title>
      <sec id="sec-4-1">
        <title>4.1. Experimental Setup</title>
        <p>We firstly conducted tests on the oficial dev set. Evaluation metrics included macro-averaged recall,
macro-averaged F1 score and macro-averaged precision.</p>
        <p>Finally, we conducted tests on the oficial test set. Evaluation metrics included accuracy,
macroaveraged recall (Macro-Recall), and macro-averaged F1 score (Macro-F1).</p>
        <p>Recall</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Result Analysis</title>
        <p>In the PAN-CLEF 2025 Subtask 2, the Recall performance of the DeBERTa-v3-large model became a key
evaluation criterion. From the results on the dev set (Table 1), it is evident that the model performs
exceptionally well in classifying "human-written, then machine-polished" and "deeply-mixed text"
categories but faces challenges in identifying "machine-written, then machine-humanized" texts. On
the test set, experimental results (Table 2) showed that compared to the baseline model
RoBERTabase, DeBERTa-v3-large achieved a Macro Recall value of 56.74% on the same task, representing
an improvement of 8.42%, indicating its superiority in complex multi-category classification tasks.
Nevertheless, despite overall performance improvements, the significance of the Recall metric and
potential optimization paths warrant deeper exploration.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>This study leverages the DeBERTa-v3-Large model to achieve eficient classification of six types of
Human-AI collaborative texts. Experimental results demonstrate that this model outperforms baseline
pre-trained models in terms of Recall and accuracy, especially excelling in handling texts with complex
semantic structures and ambiguous category boundaries.</p>
      <p>Future research directions include:
• Exploring multimodal feature fusion, such as integrating syntactic, semantic, and emotional
information;
• Introducing contrastive learning or self-supervised learning strategies to enhance the model’s
sensitivity to subtle diferences;
• Constructing more representative datasets covering a broader range of real-world applications;
• Developing lightweight versions of the model suitable for deployment on low-resource devices.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This work is supported by the Research Projects of OrdinaryUniversities in Guangdong Province
under Grant2023KTSCX133, the Guangdong Basic and Applied Basic Research Foundation under Grant
2022A1515140103.</p>
    </sec>
    <sec id="sec-7">
      <title>Declaration on Generative AI</title>
      <p>The authors declare that the Qwen3 large language model was used during the preparation of this
paper for text translation and language polishing. The final responsibility for the content, accuracy, and
scientific integrity of the paper lies solely with the authors.
[7] Y. Liu, M. Ott, N. Goyal, J. Du, M. Joshi, D. Chen, O. Levy, M. Lewis, L. Zettlemoyer, V. Stoyanov,
Roberta: A robustly optimized BERT pretraining approach, CoRR abs/1907.11692 (2019). URL:
http://arxiv.org/abs/1907.11692. arXiv:1907.11692.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <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>
          . URL: https://link. springer.com/chapter/10.1007/978-3-
          <fpage>031</fpage>
          -28241-6_
          <fpage>20</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -28241-6_
          <fpage>20</fpage>
          .
        </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>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Karlgren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tsivgun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Abassy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mansurov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Xing</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. N.</given-names>
            <surname>Ta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. A.</given-names>
            <surname>Elozeiri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. V.</given-names>
            <surname>Tomar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Geng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Artemova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shelmanov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Habash</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Stamatatos</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nakov</surname>
          </string-name>
          ,
          <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 “VoightKampf” Generative AI Authorship Vericfiation Task at PAN</article-title>
          and
          <article-title>ELOQUENT 2025</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>Rosso</surname>
          </string-name>
          , D. Spina (Eds.),
          <source>Working Notes of CLEF 2025 - Conference and Labs of the Evaluation Forum, CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <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>
          , W. Chen, Deberta:
          <article-title>Decoding-enhanced bert with disentangled attention</article-title>
          ,
          <source>in: International Conference on Learning Representations</source>
          ,
          <year>2021</year>
          . URL: https://openreview.net/forum? id=XPZIaotutsD.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>P.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          , W. Chen,
          <article-title>Debertav3: Improving deberta using electra-style pre-training with gradientdisentangled embedding sharing</article-title>
          ,
          <year>2021</year>
          . arXiv:
          <volume>2111</volume>
          .
          <fpage>09543</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>I.</given-names>
            <surname>Solaiman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brundage</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Clark</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Herbert-Voss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          , G. Krueger,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kreps</surname>
          </string-name>
          , et al.,
          <article-title>Release strategies and the social impacts of language models</article-title>
          , arXiv preprint arXiv:
          <year>1908</year>
          .
          <volume>09203</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</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>
          ,
          <article-title>BERT: pre-training of deep bidirectional transformers for language understanding</article-title>
          , CoRR abs/
          <year>1810</year>
          .04805 (
          <year>2018</year>
          ). URL: http://arxiv.org/abs/
          <year>1810</year>
          .04805. arXiv:
          <year>1810</year>
          .04805.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>