<!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>Gpachov at CheckThat! 2023: A Diverse Multi-Approach Ensemble for Subjectivity Detection in News Articles</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Georgi Pachov</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dimitar Dimitrov</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ivan Koychev</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Preslav Nakov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Mohamed bin Zayed University of Artificial Intelligence</institution>
          ,
          <addr-line>UAE</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Sofia University “St. Kliment Ohridski”</institution>
          ,
          <country country="BG">Bulgaria</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <abstract>
        <p>The wide-spread use of social networks has given rise to subjective, misleading, and even false information on the Internet. Thus, subjectivity detection can play an important role in ensuring the objectiveness and the quality of a piece of information. This paper presents the solution built by the Gpachov team for the CLEF-2023 CheckThat! lab Task 2 on subjectivity detection. Three diferent research directions are explored. The first one is based on fine-tuning a sentence embeddings encoder model and dimensionality reduction. The second one explores a sample-eficient few-shot learning model. The third one evaluates ifne-tuning a multilingual transformer on an altered dataset, using data from multiple languages. Finally, the three approaches are combined in a simple majority voting ensemble, resulting in 0.77 macro F1 on the test set and achieving 2nd place on the English subtask.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Subjectivity detection</kwd>
        <kwd>Sentence Embeddings</kwd>
        <kwd>Few-shot learning</kwd>
        <kwd>Transformer</kwd>
        <kwd>Ensemble</kwd>
        <kwd>Natural Language Processing</kwd>
        <kwd>Deep Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Subjectivity is a feature of language and a form of bias, in which whenever a person is sharing
information, it comes out skewed by the speaker’s own personal preferences, beliefs and views.
In today’s interconnected world, where opinions and biases travel fast and far, subjectivity
detection can be a very important piece in order to ensure information reporting is done in a
clear, objective and unbiased fashion.</p>
      <p>Specifically, subjectivity in news and media articles can be nuanced, subtle and dificult
to identify. Detection of subjectivity in such texts can play an important role in identifying
potentially misleading or malicious texts and in detecting fake news online.</p>
      <p>
        In Task 2 of CheckThat! Lab at CLEF 2023 [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ], systems are required to distinguish whether a
sentence from a news article expresses the subjective view of the author or presents an objective
view on the covered topic instead. This is a binary classification task in which systems have to
identify whether a text (a sentence or a paragraph) is subjective or objective.
      </p>
      <p>This paper explores the efects of fine-tuning a large pre-trained language model on the
subjectivity task. Additionally, we have examined the angles of few-shot-learning and
finetuning a sentence embedding model. Finally, an ensemble method is proposed to unify all three
into one solution.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        While sentiment analysis can be regarded as a classic NLP task with lots of research already
available on the subject, subjectivity classification is deemed to be a slightly less popular research
topic. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] looks at the subjectivity detection task as a way to improve sentiment analysis
classifiers by excluding neutral (objective) sentences. They ofer a broad survey on published
subjectivity detection methods, categorizing them into syntactic (keyword-spotting, lexical
afinity, statistical methods), semantic (parse trees, convolutional neural networks, extreme
learning machines) and multi-modal (BiLSTM, multiple-kernel learning).
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], authors explore multi-task learning with hard parameter sharing via Neural Tensor
Network. They demonstrate that using a single network with shared layers while learning on
two semantically related datasets can improve performance on both datasets.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], authors compare Word2Vec and BERT embedding models in the context of subjectivity
detection. With additional classification models to process the embedding outputs, authors
demonstrate the superiority of BERT embeddings in high-resource settings, while showing
Word2Vec embeddings can be more eficient in low-resource settings. In the current challenge,
pairing an embedding encoder with various classification models is also explored.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], authors compare the performance of pure transformer models against a variety of
more specialized methods for short text classification. Their results show superior performance
of the transformer models and part of the research performed in this paper is influenced by
their findings.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Data and Baseline Solution</title>
      <p>For the subjectivity detection task, datasets in 6 diferent languages were provided - Arabic,
Dutch, English, German, Italian and Turkish. A total of 7 datasets were available - one for each
language, and one for the multilingual version of the task. The English dataset contained a
total of 1019 examples. 800 of the provided examples were labeled as training, the other 219
as validation. A baseline solution1 is provided by competition organizers, which consists of
a sentence encoder model, producing sentence embeddings, which are then classified with
Logistic Regression.</p>
      <p>An interesting insight was that most of the sequences were relatively short. For the English
dataset, the average number of words in a sequence was 23, while 90% of sequences consisted
of 40 words or less.
1https://gitlab.com/checkthat_lab/clef2023-checkthat-lab/-/tree/main/task2/baseline</p>
      <p>The English training set is imbalanced, with 64% of samples labeled objective and 36%
subjective. This imbalance is not present in the validation set.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments and Evaluation</title>
      <p>Three research directions were explored, each of them resulting in a separate solution. The final
program used for submission is a simple majority voting ensemble of the three solutions. The
ifrst research direction explores what is achievable using sentence embeddings. The second one
looks at a few-shot-learning model and dual-stage fine-tuning. The third is based on fine-tuning
a pre-trained transformer model, also utilizing training data from the other languages available
for the task.</p>
      <p>All evaluations of experiments are done on the English validation set, provided by the
organizers. All research directions will be described in more detail in the next subsections.</p>
      <sec id="sec-4-1">
        <title>4.1. Sentence Embeddings</title>
        <p>
          Multiple experiments with sentence embeddings were conducted. All of them were based on
using a pre-trained sentence embedding encoder model [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] . The following ideas were explored:
• Using more powerful classifiers on top of sentence embeddings output
• Using dimensionality reduction
• Fine-tuning the sentence embeddings encoder in the context of subjectivity detection
Initially, the baseline solution provided by organizers used sentence embeddings and a simple
Logistic Regression on top to produce classification outputs. More complex classifiers were
tested. Multiple diferent classifiers yielded improvements, measured on the validation set. The
most performant was LogisticRegression (from sklearn), using ElasticNet penalty, balanced
class weights, ‘saga’ solver and 0.5 as regularization constant.
        </p>
        <p>A potential place for improvement was related to sentence embeddings dimensionality. Due
to only having 800 training examples, embeddings of dimensionality 384 could prove challenging
for a classifier. Using dimensionality reduction, information from embedding vectors can be
further compressed in a way that could make it easier for classifiers to find a proper decision
boundary.</p>
        <p>Best performance was achieved using PCA with 110 remaining components (out of 384), which
explained 92.5% of total variance. Experiments with diferent classifiers and dimensionality
reduction are summarized in the first column of Table 1.</p>
        <p>While dimensionality reduction can help classifiers, the sentence embeddings themselves
were generally created for a very broad category of NLP tasks. Fine-tuning the embeddings
encoder for subjectivity detection proved to be helpful for all of the tested classifiers.</p>
        <p>Embeddings were fine-tuned using cosine similarity loss in a contrastive learning manner.
The new similarity label of a pair of sentences consisted of two equally weighted components
their original similarity and their label-based similarity. Label-based similarity is defined as 1 if
the two sentences are from the same class and 0 otherwise. This can be summarized with the
following equation:</p>
        <p>Classifier∖Embedding
Baseline (SBERT + LR)</p>
        <p>SVM</p>
        <p>ElasticNet</p>
        <p>PCA + ElasticNet
 __(, ) = 0.5 * (, ) + 0.5 * (() == ())
(1)</p>
        <p>To generate training samples, N objective and N subjective sentences were randomly selected.
Training pairs were generated - each sentence was paired with every other sentence and a
similarity label was generated using Formula 1. In total, 2N*(2N-1) training pairs were generated.</p>
        <p>All of the tested classifiers performed better using the fine-tuned embeddings (with N=100)
instead of original embeddings. All experiments with classifiers, dimensionality reduction and
ifne-tuned sentence embeddings are summarized in Table 1. For both the original and the
ifne-tuned embeddings, best performance was achieved through PCA and Linear Regression
with elastic net penalty. All macro F1 scores are measured on the (English) validation set.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Few-Shot Learning</title>
        <p>
          The second research direction explored what can be achieved with few-shot learning.
Experiments are based on the SetFit model from HuggingFace [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. While conceptually similar to the
idea of fine-tuning sentence embeddings, the SetFit model has numerous advantages, including
faster training, better sample eficiency and a dual-stage fine-tuning mechanism. In the first
stage, the classification head is frozen and embeddings are fine-tuned. Vice versa in the second
stage.
        </p>
        <p>Experiments and results for this approach are outlined in Table 2. Results are similar to
finetuning sentence embeddings encoder, but achieved while using a lot less information (samples)
from the task-specific dataset, which showed promise of low variance and good generalization
capabilities.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Transformer Fine-Tuning</title>
        <p>
          The third research direction was based on the idea of fine-tuning a transformer model to the
dataset provided. Lots of transformer models are available in the HuggingFace hub [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. BERT
[
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], RoBERTa [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] and DeBERTa [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] were used throughout the experiments. Limitations in
hardware capabilities restricted the experiments to only ’base’ and ’large’ variants of the models.
Xlarge and xxlarge models were not tested. Initially, experiments were performed using the
English dataset only. Later on, additional experiments were performed including data from
other languages.
        </p>
        <p>Table 3 summarizes the experiments and results when using the English dataset. Fine-tuning
a DeBERTa-v2-large achieved the best performance on the validation set.</p>
        <p>
          Additional experiments were performed using data from other languages. Multiple training
datasets were created. The first one consisted of all the available data for all languages. The
second one consisted of English, Arabic and Turkish - the languages who had published baseline
solutions with higher F1 than English. The third one contained training samples from English
and German translated to English using a neural model [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. While creating the datasets, English
validation samples were always manually excluded as a final step to prevent data leakage.
        </p>
        <p>
          For all three datasets, multilingual transformer models were used - bert-base-multilingual
[
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], mDeBERTa [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] and xlm-roberta-base [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ].
        </p>
        <p>Table 4 summarizes the results. An xlm-roberta-base model was fine-tuned using all available
data, achieving a macro F1 score of 0.83, which showed slight improvement over using
Englishonly dataset. The best results were obtained by using English and German translated to English,
iftted to xlm-roberta-base model.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Ensemble</title>
        <p>Best performing solutions from all three research directions were chosen and formed into
an ensemble (Figure 1). The final solution was a simple majority voting ensemble from the
following solutions:
• A fine-tuned sentence embeddings encoder, producing improved sentence embeddings
(in the context of this task). The encoder output passes through dimensionality reduction
(384 dimensions reduced to 110). The reduced embeddings are then classified through
LogisticRegression with equally weighted L1 and L2 penalties, ‘saga’ solver, balanced
class weights and 0.5 regularization constant.
• A few-shot learning SetFit model trained using dual-stage fine-tuning procedure with</p>
        <p>N=20 sentence pairs.</p>
        <p>• An xlm-roberta-base model, fine-tuned on English and German translated to English.</p>
        <p>The final submitted ensemble was able to achieve 0.85 macro F1 on English validation set.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>The final solution achieved macro F1 of 0.85 on validation set and 0.77 on test set. This indicates
generalization issues, likely stemming from overfitting the solution to the validation set.</p>
      <p>Each of the three separate methods was analyzed on the test set, to identify possible causes
for the significantly lower performance on the test set. All components of the solution perform
worse on the test set than on the validation set, indicating a more dificult test set. The first
method however incurs a bigger loss of performance than the others. This is likely caused
by an issue in the fine-tuning procedure, resulting in the encoder model producing highly
specialized embeddings, which lose a bigger part of their pretrained semantics than optimal
and thus generalize poorly. Less examples used for contrastive learning, smaller learning rate,
or using a holdout set to check for generalization issues could have mitigated this problem.</p>
      <p>Results also indicate that the best performer is an xlm-roberta-base model trained on English
and translated German. All test and validation F1 scores are summarized in Table 5.</p>
      <p>Table 6 indicates that the solution is biased to expect more frequent ‘objective’ examples,
hence the higher recall but lowered precision. This is likely stemming from the initial class
imbalance in the English training set, where 64% of examples are labeled objective. While this
imbalance doesn’t seem to have a major impact on final F1 scores, a more balanced solution
could have been achieved by using any of the well-known class-imbalance techniques, e.g.
sample weighing or choosing a diferent threshold.</p>
      <p>Overall, xlm-roberta model trained on English and translated German seem to be the best
performer. The few-shot-learning approach yielded decent test results. The fine-tuned SBERT
encoder method seems to not be general enough and is reducing the performance of the full
solution. Submitting predictions from only the transformer model would have resulted in 0.79
macro F1, which could have won the English subtask challenge.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Future Work</title>
      <p>
        As indicated by Table 5, the transformer-based solution proved to be the most efective and
robust out of the ones used in the ensemble. Further experiments can be conducted with newer
and more promising versions of existing transformer models. For example, DeBERTa-V3 [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]
is reported to improve performance of the original DeBERTa model with 1.37% on the GLUE
benchmark. This can prove relevant to the task of subjectivity classification as well.
      </p>
      <p>Additionally, due to resource constraints, transformer models with ’xlarge’ and ’xxlarge’
architectures were not used for this research. For the same reason, very little hyperparameter
tuning was performed. Using a larger model and exploring bigger hyperparameter space can
potentially improve the results.</p>
      <p>Finally, the transformed-based approach used for subtask 2A (English) can also be attempted
and used for the other 5 languages in the task - Arabic, Dutch, German, Italian and Turkish.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>This research is partially funded by Project UNITe BG05M2OP001-1.001-0004 funded by the OP
"Science and Education for Smart Growth", co-funded by the EU through the ESI Funds, and
partially financed by the European Union-NextGenerationEU, through the National Recovery
and Resilience Plan of the Republic of Bulgaria, project No BG-RRP-2.004-0008.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Barrón-Cedeño</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Alam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Galassi</surname>
          </string-name>
          , G. Da San Martino, P. Nakov, ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Elsayed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Azizov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Caselli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Cheema</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Haouari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hasanain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kutlu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ruggeri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Struß</surname>
          </string-name>
          , W. Zaghouani,
          <article-title>Overview of the CLEF-2023 CheckThat! Lab checkworthiness, subjectivity, political bias, factuality, and authority of news articles and their source</article-title>
          , in: A.
          <string-name>
            <surname>Arampatzis</surname>
            , E. Kanoulas,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Tsikrika</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Vrochidis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Giachanou</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Aliannejadi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Vlachos</surname>
          </string-name>
          , G. Faggioli, N. Ferro (Eds.),
          <source>Experimental IR Meets Multilinguality, Multimodality, and Interaction. Proceedings of the Fourteenth International Conference of the CLEF Association (CLEF</source>
          <year>2023</year>
          ),
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Galassi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ruggeri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Barrón-Cedeño</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Alam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Caselli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kutlu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Struss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Antici</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hasanain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Köhler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Korre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Leistra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Muti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Siegel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. Mehmet</given-names>
            <surname>Deniz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegand</surname>
          </string-name>
          , W. Zaghouani,
          <article-title>Overview of the CLEF-2023 CheckThat! lab task 2 on subjectivity in news articles</article-title>
          , in: M.
          <string-name>
            <surname>Aliannejadi</surname>
            , G. Faggioli,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ferro</surname>
          </string-name>
          , Vlachos, Michalis (Eds.), Working Notes of CLEF 2023-
          <article-title>Conference and Labs of the Evaluation Forum</article-title>
          ,
          <string-name>
            <surname>CLEF</surname>
          </string-name>
          <year>2023</year>
          , Thessaloniki, Greece,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>I.</given-names>
            <surname>Chaturvedi</surname>
          </string-name>
          , E. Cambria,
          <string-name>
            <given-names>R. E.</given-names>
            <surname>Welsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Herrera</surname>
          </string-name>
          ,
          <article-title>Distinguishing between facts and opinions for sentiment analysis: Survey and challenges</article-title>
          ,
          <source>Information Fusion</source>
          <volume>44</volume>
          (
          <year>2018</year>
          )
          <fpage>65</fpage>
          -
          <lpage>77</lpage>
          . doi:https://doi.org/10.1016/j.inffus.
          <year>2017</year>
          .
          <volume>12</volume>
          .006.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>R.</given-names>
            <surname>Satapathy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pardeshi</surname>
          </string-name>
          , E. Cambria,
          <article-title>Polarity and subjectivity detection with multitask learning and bert embedding</article-title>
          ,
          <year>2022</year>
          . arXiv:
          <volume>2201</volume>
          .
          <fpage>05363</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>W.</given-names>
            <surname>Chong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. T. V.</given-names>
            <surname>Yap</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Soo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. T.</given-names>
            <surname>Goh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cher</surname>
          </string-name>
          ,
          <article-title>Objectivity and Subjectivity Classification with BERT for Bahasa Melayu</article-title>
          ,
          <year>2022</year>
          , pp.
          <fpage>246</fpage>
          -
          <lpage>257</lpage>
          . doi:
          <volume>10</volume>
          .2991/
          <fpage>978</fpage>
          -94-6463-094-7_
          <fpage>20</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>F.</given-names>
            <surname>Karl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Scherp</surname>
          </string-name>
          ,
          <article-title>Transformers are short text classifiers: A study of inductive short text classifiers on benchmarks and real-world datasets</article-title>
          ,
          <year>2022</year>
          . arXiv:
          <volume>2211</volume>
          .
          <fpage>16878</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Sentence-bert: Sentence embeddings using siamese bert-networks</article-title>
          ,
          <year>2019</year>
          . arXiv:
          <year>1908</year>
          .10084.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>L.</given-names>
            <surname>Tunstall</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U. E. S.</given-names>
            <surname>Jo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bates</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Korat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wasserblat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Pereg</surname>
          </string-name>
          ,
          <article-title>Eficient few-shot learning without prompts</article-title>
          ,
          <year>2022</year>
          . arXiv:
          <volume>2209</volume>
          .
          <fpage>11055</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>T.</given-names>
            <surname>Wolf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Debut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sanh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chaumond</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Delangue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Moi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cistac</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Rault</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Louf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Funtowicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Davison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shleifer</surname>
          </string-name>
          , P. von Platen, C. Ma,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jernite</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Plu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. Le</given-names>
            <surname>Scao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gugger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Drame</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Lhoest</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rush</surname>
          </string-name>
          , Transformers:
          <article-title>State-of-the-art natural language processing</article-title>
          ,
          <source>in: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>38</fpage>
          -
          <lpage>45</lpage>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .emnlp-demos.
          <volume>6</volume>
          .
        </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 id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          ,
          <article-title>Roberta: A robustly optimized bert pretraining approach</article-title>
          ,
          <year>2019</year>
          . arXiv:
          <year>1907</year>
          .11692.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <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>
          ,
          <year>2021</year>
          . arXiv:
          <year>2006</year>
          .03654.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Tran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.-J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Chaudhary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <article-title>Multilingual translation with extensible multilingual pretraining</article-title>
          and finetuning,
          <year>2020</year>
          . arXiv:
          <year>2008</year>
          .00401.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <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 gradient-disentangled embedding sharing</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2111</volume>
          .
          <fpage>09543</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Conneau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Khandelwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Chaudhary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Wenzek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Guzmán</surname>
          </string-name>
          , E. Grave,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          ,
          <article-title>Unsupervised cross-lingual representation learning at scale, in: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>8440</fpage>
          -
          <lpage>8451</lpage>
          . doi:
          <volume>10</volume>
          . 18653/v1/
          <year>2020</year>
          .acl-main.
          <volume>747</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>