<!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>Policy Parsing Panthers at Touché: Ideology and Power Identification in Parliamentary Debates⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Oscar Palmqvist</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Johan Jiremalm</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pablo Picazo-Sanchez</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Chalmers University of Technology</institution>
          ,
          <addr-line>Gothenburg</addr-line>
          ,
          <country country="SE">Sweden</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>School of Information Technology, Halmstad University</institution>
          ,
          <country country="SE">Sweden</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>0</volume>
      <fpage>9</fpage>
      <lpage>12</lpage>
      <abstract>
        <p>Political debates are vital in shaping public opinion and influencing policy decisions. However, understanding the complex linguistic structures used by politicians to ascertain their orientations and power dynamics can be challenging. In this paper we explore Natural Language Processing techniques for identifying political orientation and power structures in parliamentary debates. We introduce a Located Missing Labels-loss in order to train jointly to predict both power and ideology. Furthermore, our proposed method also trains to predict a third synthetically generated polarity label. Finally, we combine this training method with pre-processing steps including back-translation and meta data inclusion. Our results show that our method manages to improve upon conventional methods of fine-tuning.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Political Debates</kwd>
        <kwd>NLP</kwd>
        <kwd>CLEF</kwd>
        <kwd>Touché</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Parliamentary debates play a vital role in political communication and society [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. During these debates,
representatives from diverse parties and ideologies share their opinions, arguments, and stances on
issues impacting society. Making debates more accessible and easy to follow not only serves to inform
people but ofers a basis for seeking further information and engaging in the democratic process [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        The ability to detect and classify political motives from speech may also be utilised when the speaker
is not forthcoming with their political agenda. Detecting hidden political motives in media such as
news reporting and advertisements may benefit society by providing transparency [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        The complex nature of politics makes these debates challenging to understand [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. According to a
recent survey, 65% of Americans say they always or often feel exhausted when thinking about politics
[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. In addition, 42% of adults in the U.S. reported to have watched none, or very few, of the presidential
debates in 2020. Moreover, analysing political speeches and making classifications can be challenging
due to complex rhetorical strategies such as metaphors, parallelism, and suggesting answers [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Political
context and the speaker’s background influence how messages are conveyed and interpreted.
      </p>
      <p>
        The challenge of analysing and making classification on political speech may be approached from the
perspective of Natural Language Processing (NLP). NLP is a field in artificial intelligence that focuses on
analysing, understanding, and processing natural language data using computers [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Sub-tasks within
NLP involve, among others, text summarisation, machine translation, and sentiment analysis. More
recently, the field of NLP has surged in popularity with the development of chatbots such as ChatGPT.
Besides the massive Large Language Models (LLMs) such as GPT-4, there have also been multiple
other diferent approaches for NLP such as rule-based and probabilistic approaches [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The incredible
performance of these LLM can be applied to the complex political realm with great success [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>
        Conference and Labs of the Evaluation Forum (CLEF) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] hosts an open competition in 2024 called
Touché as part of one of their so called labs [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. The task, Ideology and Power Identification in
Parliamentary Debates, is one of the four competitions as part of Touché’s presence at CLEF 2024 [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. This
document is an entry to that competition. It will, therefore, investigate which NLP tools are best suited
for identifying ideology and power in parliamentary debate speeches.
      </p>
      <p>
        Research goals. The research goals1 for this project are inspired by and correspond to the two
sub-tasks of the Touché competition Ideology and Power Identification in Parliamentary Debates [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ].
RQ1 Investigate what the best methods and practices are for identifying the political orientation in a
parliamentary speech.
      </p>
      <p>RQ2 Investigate what the best methods and practices are for identifying whether a parliamentary
speech is made by a speaker in opposition or in power.</p>
      <p>
        Evaluation The results of both research questions are evaluated against a test set provided by Touché
using a macro-averaged F1-score [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], as it is the performance metric of the Touché competition [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
Paper structure The rest of this document is organised as follows. In Section 2 we discuss a selection
of related work which is closely related to our problem at hand and which influenced our method. We
outline and describe the datasets set in Section 3. We present our full proposed method in Section 4 and
share the results from its application in Section 5. Finally, we discuss and explain these findings in
Section 6 and conclude the document in Section 7.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>Here, we discuss previously explored techniques used for political classification within NLP and their
relevance to our project. We also examine a range of studies showcasing the performance of models
such as RoBERTa and Bidirectional Encoder Representations from Transformers (BERT) in tasks such as
multi-lingual political orientation classification and stance classification of political tweets. Additionally,
we explore domain-specific pre-training, back-translation, multi-label learning with missing labels, and
other methodologies relevant to our research objectives.</p>
      <sec id="sec-2-1">
        <title>2.1. Model and training method</title>
        <p>
          Fine-tuned RoBERTa has demonstrated significant superiority over zero- and few-shot GPT-3 for
multilingual political orientation classification [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. For the task of implicit ideology prediction, fine-tuned
RoBERTa has also been shown to outperform GPT-4, Llama-2-13B and Llama-2-70B using in-context
learning, as well as Llama-2-70B utilising Low Rank Adaptation (LoRA)-fine tuning [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. Furthermore, it
is noteworthy that in the same study, the only model which beat fine-tuned RoBERTa for Named-Entity
Recognition (NER) was the LoRA fine-tuned Llama-2-70B.
        </p>
        <p>
          It has been shown that even when only fine-tuning a classification head, BERT has approached the
performance of few-shot GPT-3 models for stance classification of political tweets [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ].
        </p>
        <p>
          In a similar manner, a comparison of the performance of “Small Language Models” and modern LLMs
for sentiment analysis tasks has been performed [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]. The study compares T5 (770M parameters)
to Flan-T5, Flan-UL2, text-davinci-003, GPT-3.5-turbo (11B, 20B, 175B, undisclosed, parameters
respectively) across 13 diferent sentiment analysis tasks and 26 datasets. For context, the base version of
BERT has 110M parameters whilst the large version totals 340M parameters. The T5-model was trained
on the entire training dataset whilst the other LLMs utilised zero- or few-shot classification. They divide
their sentiment analysis tasks into three categories, and find that the smaller fully trained T5-model
achieves the best results for all categories, outperforming zero-, one-, five-, and ten-shot classification
versions of the larger models. The authors conclude that whilst the larger LLMs perform adequately in
simpler tasks, they are outperformed in complex tasks which require structured sentiment information
or deeper understanding.
1Also referred to as sub-tasks.
        </p>
        <p>
          RoBERTa has been shown to be state-of-the-art for propaganda classification [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. The same
RoBERTamodel outperforms fine-tuned versions of GPT-3 and multiple in-context learning versions of GPT-4
[
          <xref ref-type="bibr" rid="ref19">19</xref>
          ], yielding a micro average F1-score of 63.4% as compared to that of the best GPT-model (base GPT-4)
of 58.11%.
        </p>
        <p>
          New and large decoder-only models have been compared to encoder-only models for the tasks of
intent classification and sentiment analysis [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]. The study reveals that, in general, encoder-only
models provide superior performance, at a fraction of the computational demand, for natural language
understanding tasks.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Domain-specific pre-training</title>
        <p>
          Domain-specific pre-training refers to the process of training a model on domain-specific texts before
ifne-tuning for a specific task within that domain [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]. Domain-specific pre-training has shown great
utility for domains with abundant unlabeled text, such as the biomedical field [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ].
        </p>
        <p>
          For the task of multi-lingual political orientation classification, however, some authors recently
showed that domain-specific pre-training does not greatly impact results [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. Also, after a threshold
of approximately 10,000 sentences, the general-domain pre-training seems to be suficient as to not
benefit from additional domain-specific pre-training.
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Back-translation</title>
        <p>
          Back-translation involves the process of translating one text into another language, and then translating
the new text back into the original language [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. In our case this technique will be used to create
artificial data that is similar to the original data, as further explained in Section 4.1.1. Back-translation
has shown widespread utility for machine translation tasks [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]. Furthermore, using back-translation
to artificially extend datasets has also shown promising results for hate speech detection tasks [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ].
Back-translation for classification tasks has also shown itself to be particularly useful when there is less
training data [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Multi-label learning with missing labels</title>
        <p>
          Multi-label Learning with Missing Labels (MLML) has shown great utility for image classification tasks
[
          <xref ref-type="bibr" rid="ref27">27</xref>
          ]. In these tasks, a “missing” label most often refers to a false negative, and the challenge is to
diferentiate between true negatives and false negatives caused by incomplete or faulty annotation.
Many methods have been proposed to handle these missing labels [
          <xref ref-type="bibr" rid="ref28 ref29 ref30">28, 29, 30</xref>
          ]. As will be shown in
Section 4, our two sub-tasks can be combined into a single multi-label classification problem with
located missing labels. Traditional MLML methods are, however, not suited for our task since the
locations of our missing labels are known and not hidden as false negatives. A study on MLML for
image and facial-expression classification from 2014 shares our definition of MLML where missing
labels are located but the technique is not appropriate for our project since it is tailored for a label-space
magnitudes larger than our own [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ].
        </p>
        <p>
          Our two sub-tasks can be combined into a single multi-label classification problem, as will be shown
in Section 4. Similar approaches of combining tasks have shown to be beneficial. For the task of
peer-assessment evaluation, multi-task learning BERT has been shown to outperform its single-task
counterparts [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ]. For the multi-task learning BERT, three separate classification heads were added to
the same base BERT model and the loss for fine-tuning was the sum of the Cross Entropy (CE)-loss
from each classification task.
        </p>
      </sec>
      <sec id="sec-2-5">
        <title>2.5. Performance of models in similar contemporary competitions</title>
        <p>
          In 2021, amongst other years, CLEF organised a competition called EXIST [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ]. The two task for the
competition were:
t
r
e
B
o
t
e
B
t
r
e
B
m
        </p>
        <p>R
M
L
X
a
T
R
E
B
o
R
• Task 1: Identifying Sexist Content In this task, the system is supposed to perform binary
classification. It must determine whether a given text (tweet or gab) exhibits sexism, whether
directly, by describing a sexist scenario, or by criticising sexist behaviour.
• Task 2: Categorising Sexist Content Following the identification of sexist content, the
subsequent task involves categorising the content based on the type of sexism present.</p>
        <p>The results, and techniques used in the two sub-tasks in the competition are compiled in Table 1.
Some takeaways from the approaches in the competition comes from the datasets including Spanish
and English text. When participants used Beto (Spanish version of BERT), it was exclusively used to
analyse the Spanish texts which means that it had to be combined with other models for English. The
same is true for BERT, almost all participants that used BERT for the English texts also ended up using
other models for the Spanish texts. Lastly, the most common and best performing LLMs for handling
multiple languages in this competition were mBERT and XLM-R.</p>
        <p># of speeches
% of task data</p>
        <p>% of all data</p>
        <sec id="sec-2-5-1">
          <title>Left</title>
        </sec>
        <sec id="sec-2-5-2">
          <title>Right</title>
        </sec>
        <sec id="sec-2-5-3">
          <title>Power</title>
          <p>Opposition</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Dataset</title>
      <p>
        Touché provides a dataset [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ] for our task which contains a selection of speeches from the ParlaMint
corpora [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ]. This dataset contains data from parliamentary speeches in multiple European parliaments—
we include the countries covered in the dataset in Appendix A. More precisely, the dataset consists of
two separate subsets, one for each sub-task. These subsets are also divided into multiple sub-subsets
each containing data from only one country.
      </p>
      <p>
        The organisers altered the dataset to provide less information than the original one, but also includes
an automatic translation to English for most non-English texts. The provided training dataset consists
of 6.5GB of text files [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ] divided among the orientation and power datasets and contains the following
ifelds:
id
      </p>
      <p>is a unique (arbitrary) ID for each text.
speaker is a unique (arbitrary) ID for each speaker. There may be multiple speeches from the same
speaker.
sex
text
is the (binary/biological) sex of the speaker. This information is collected from varying sources
(typically data published by the respective parliament), and in some cases it may be unspecified
or unknown.
is the transcribed text of the parliamentary speech. Real examples may include line breaks,
and other special sequences escaped or quoted.
text_en is an automatic English translation of the corresponding text. This field may be empty for
speeches in English. There might be missing translations for a small number of non-English
speeches.
label
is the binary/numeric label. For political orientation, 0 is left and 1 is right. For power
identification 0 indicates coalition (or governing party) and 1 indicates opposition.</p>
      <p>Data imbalance There is an uneven distribution of data where some countries have more data
than others. In addition, the label distribution among the countries is also skewed. For instance, in
Figure 1 we can see that Serbia has more data for speeches connected to right wing parties while for the
power dataset Serbia has more speeches from speakers in power. Table 2 represents the overall label
distribution of the dataset.</p>
      <p>The text lengths of each country also vary and are displayed in Figures 2 and 3 for the orientation
dataset. Shorter texts may contain less helpful information for the predictions and thus, decrease the
performance. Moreover, the limited context length of the models may not be able to capture all relevant
information in the longer texts. For instance, BERT has a context length of 512 tokens which means
that it can not process the entirety of most texts at once.</p>
      <p>15000
10000
5000</p>
      <p>0
15000
10000
5000</p>
      <p>0
Croatia</p>
      <p>Czechia</p>
      <p>Denmark</p>
      <p>Estonia</p>
      <p>Finland</p>
      <p>France
Galicia</p>
      <p>Great Britain</p>
      <p>Greece</p>
      <p>Hungary</p>
      <p>Iceland</p>
      <p>Italy
Latvia
Spain</p>
      <p>Norway</p>
      <p>Poland</p>
      <p>Portugal</p>
      <p>Serbia</p>
      <p>Slovenia
Sweden</p>
      <p>The Netherlands</p>
      <p>Turkey</p>
      <p>Ukraine
Power</p>
      <p>Opposition</p>
      <p>Left</p>
      <p>Right</p>
      <p>Shared information Even though the datasets are split, 47.5% of the speakers that appear in one of
the datasets appear in both datasets, as shown in Figure 4. Moreover, 51.4% of speeches in the power
dataset are made by a speaker who also appears in the orientation dataset. This amount equates to
72.2% of the total number of speeches in the orientation dataset.</p>
      <p>Isolated speeches The dataset does not include the date of when the parliamentary speeches occurred.
This means that modelling changes in party ideas over time or fully encapsulate how politics shift is
infeasible. Moreover, simply connecting a speech to a certain ideology will not be as useful when it
comes to predicting whether the speaker is currently in a governing position or opposition. This is
because a country with a left leaning government one year could have a right leaning government the
next.</p>
      <p>Even though speeches are originally part of debates and exchanges in parliament, the dataset contains
no data for connecting multiple speeches to a single conversation or exchange. This prevents approaches
which would model an entire debate and label the participants in the debate rather than the individual
speeches themselves.</p>
      <p>Privacy in the dataset The dataset uses arbitrary codes for people’s names. This makes it dificult to
check if our results match up with real-world politicians. Additionally, the test set for the orientation
task does not contain any speakers in the original orientation dataset. As a result, a solution which
attempts to connect specific speeches to the correct political parties using the speakers identity is
infeasible.</p>
      <p>Test set The test set for the orientation sub-task contains randomly sampled speeches by speakers
who do not appear in the training set. The test set for the power sub-task does, to a large extent, contain
speakers that also appear in the training set. However, speakers recurring in the test set will tend to</p>
      <p>BasaqAnuudesHCtreioaruznetgryovBinealgBiuumlgCaartiaalonCiaroaCtziaeDcheinamaErsktonFiianlanFdranGcGreeaalitcBiaritaGinreHecuengaIcryelandItalLyatNvioarwaPyolPanodrtugSalerbiaSpSaTwihneeSdNleoenvtehneiralandTsurkUekyraine
osnia
B</p>
      <p>Country
have a diferent label distribution compared to the training set. For both sub-tasks, the test set contains
approximately 2,000 speeches for each parliament, whose general label distributions resemble those in
the training set. The test data follows a similar structure to the training data apart from the speaker_id
and label field being hidden.</p>
    </sec>
    <sec id="sec-4">
      <title>4. System Overview</title>
      <p>In the following, we describe how we processed and prepared the data as well as how we selected and
trained models. An overarching view of our method is illustrated in Figure 5.</p>
      <sec id="sec-4-1">
        <title>4.1. Dataset and Preprocessing</title>
        <p>We decided not to extend the dataset using external sources. This was partly due to other parliamentary
debates in our selection of countries either being unavailable or already in the original ParlaMint
corpora. It would also require a lot of work in order to create properly labelled datasets in the same
format as our base dataset. Finally, the amount of available data is of substantial size and a larger
amount would put further pressure on the need for computational resources.</p>
        <p>
          We generated the training dataset for each task by sampling 70% of the provided datasets, leaving
the remaining 30% of the datasets for the validation set. Note that the 70/30 split is a commonly used
rule-of-thumb which has shown some empirical optimality [
          <xref ref-type="bibr" rid="ref36 ref37">36, 37</xref>
          ].
        </p>
        <p>We used this split for evaluating the individual and combined parts of our model. Once we got the
most efective techniques, we switched to a diferent split for our final ensemble model as explained in
Section 4.6.</p>
        <p>Missing translations Firstly, some English translations were missing in the provided Finnish dataset.
Specifically, there were 271 translations missing in the training dataset and 88 in the test set. These
0.004
0.003
y
it
s
n
e
D0.002
0.001
0.000
Finland
Estonia
Ukraine
Spain
Greece
Galicia
500
0
500
1000
texts had to be manually machine translated. For the translations we used a Python package called
mrTranslate.
4.1.1. Back-translation
To address country distribution imbalance, we applied back-translation to the data from countries with
fewer than 15,000 entries in the power and orientation datasets combined. We chose this threshold in
order to strike a balance between improving the amount of speeches available for parliaments with less
representation in the dataset and not increasing the training time excessively. The back-translation
process involved translating English text to the original language and back, followed by translating the
original text to English and back to the original language. We also used mrTranslate for the translations
and appended the resulting data to the dataset, keeping all other fields unchanged from the original
entry. Sometimes, however, the translations would fail. In these cases, we manually translated the texts
using Google Translate.
4.1.2. Meta data inclusion
By prepending each text with the corresponding country and gender of the speaker, i.e., “Germany,
Female”, models got access to the available contextual information not included in the speeches
themselves. We hypothesise that since parliaments and contexts of debates vary, so should their
analyses. By giving the model access to all available metadata, i.e., all available context, we suspect
that models might be able to better adapt their predictions. An example of adapting to such a context
might be adapting the prediction of someone advocating for a certain law depending on what the law
is currently in a given country. There might also be useful information in the meta data itself, such
as gender making a politician more likely of belonging to a certain ideology in some countries. These
examples are of course purely speculative and therefore part of the reason why we chose to include all
meta data instead of selecting fields based only on our own speculations.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Combined training</title>
        <p>We merged the datasets by combining them where the label column was split into orientation and
power labels. Despite being separate, both datasets contain shared elements, allowing the extraction of
some data in the power dataset data into the orientation dataset, as explained in Section 3. We first
verified that each speaker in the orientation dataset consistently had the same label. Once a speaker
was confirmed as label  in the orientation dataset, all texts by that speaker in the power dataset were
also classified as label  for orientation. When the datasets shared a text, the text from the orientation
dataset was removed (since the text from the power dataset already had received the orientation label).
This increased the number of orientation entries by 72.2% which equates to 51.4% of the original power
dataset.
4.2.1. Located missing labels loss function
Since the combined dataset has many missing labels, we needed to create a custom loss function. We
calculated a filter tensor for each batch and label, marking rows with true labels as one and rows
without true labels as zero. Then, we used this filter tensor as weights for the entries in the batch when
computing the CE-loss. To account for the number of incomplete labels, we divided each label-specific
loss by the sum of its filter tensor. By summing the loss for our two labels, we had created a multi-label
loss function which could account for Located Missing Labels (LML).</p>
        <p>
          Let us consider this loss function for a single label, i.e., orientation. Formally, let  be the set of
classes (i.e., left and right) and  the output predictions for all classes  ∈  for entry  in the batch.
, is then the predicted probability of class  for entry  in the input batch such that , ∈ [
          <xref ref-type="bibr" rid="ref1">0, 1</xref>
          ] and
∑︀ , = 1, ∀. Also let  be the true labels such that  ∈ {− 1} ∪  (where − 1 corresponds to a
missing label) represents the true label of entry . Then our custom LML-Loss can be expressed as
Equation (1).
        </p>
        <p>1</p>
        <p>∑︁ CELoss(, )
LMLLoss(, ) = ∑︀  
 =
{︃1,  ∈ {}
0,  = − 1
(1)</p>
        <p>As each label-specific loss is divided by the sum of its filter tensor, the resulting loss maintains a
consistent size regardless of the number of samples with a true label in the batch. Consequently, the
ifnal summed loss represents the combined loss for each task, regardless of its prevalence in the batch.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Polarity label extension</title>
        <p>If training to predict both the power and orientation labels at the same time yields increased performance,
then training to predict a third label might yield further improvements. We chose polarity as the label
to add to our dataset, i.e., whether a text carries a positive, negative or neutral sentiment. We chose
polarity since it is an efective metric for identifying trends in parliamentary speeches.</p>
        <p>
          To obtain polarity labels for our dataset, we used version 0.2 of the instruction fine-tuned Mistral-7B,
as available under mistralai/Mistral-7B-Instruct-v0.2 on Hugging Face. We chose this model since it
outperforms other open source LLMs of similar or larger size, such as 7- and 13-billion parameter
versions of Llama-2 [
          <xref ref-type="bibr" rid="ref38">38</xref>
          ]. We chose one example text for each polarity label and had GPT-3.5 explain why
it assigned that label to that text. With these examples, we constructed our in-context learning prompt
using 3-shot classification. The base textual prompt, which we then formatted into the instruction chat
format of the model, can be found in Appendix B.
        </p>
        <p>We double-quantised the Mistral model to a 4-bit normal float with a 16-bit float compute type to
ift the model in memory and for faster inference. To fit the entire base prompt along with the text to
label, we defined a context length of 4,096. To generate from the model, we used sampling beam search
with 3 beams along with forcing the output to contain “Positive”, “Negative”, or “Neutral”. Finally, we
assigned the polarity label as 0, 1 or 2 depending on whether the first word of the output was “Negative”,
“Positive” or “Neutral” respectively, assigning − 1 otherwise.</p>
        <p>To perform the polarity classification, we added three output nodes to our classification head,
corresponding to each polarity class. To account for holes in the polarity data caused by failed generations,
we also used our LML-loss to calculate the loss from the polarity predictions. We only added half of the
polarity LML-loss to the base LML-loss in order to prioritise our two core tasks.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Models</title>
        <p>
          We restricted the models to those we could efectively train. Therefore, we excluded more extensive
and capable models, such as the 70-billion parameter version of Llama-2 [
          <xref ref-type="bibr" rid="ref39">39</xref>
          ]. Furthermore, we were
forced to limit hyperparameters, such as batch size and learning rate, to less-than-ideal values to
comply with our limited computational resources. Our selection of models was also influenced by the
notion that encoder only models outperform modern large decoder models for similar tasks, at a lower
computational demand [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ].
        </p>
        <p>We compared diferent modern transformer-based models to find which models performed the best
for our task. Diferent models necessitated diferent hyperparameter values due to their difering sizes
and designs. For all models, any implemented classification heads took the place of the last layer of the
model as provided by their Hugging Face sequence classification implementation, leaving the method
of pooling as implemented in the base model.</p>
        <p>
          BERT and mBERT We evaluated the uncased version of BERT [
          <xref ref-type="bibr" rid="ref40">40</xref>
          ], available under bert-base-uncased,
using the provided English translations. We chose this model since it is competent while being much
smaller than other modern models (see Section 2.1) and since it had previously shown outstanding
performance in similar competitions (see Section 2.5).
        </p>
        <p>We also evaluated the uncased version of multilingual BERT, available under
bert-base-multilingualuncased, on the speeches in their original languages. We chose this model because it is a multilingual
version of BERT and because it demonstrated excellent results for multilingual tasks in similar
competitions (see Section 2.5).</p>
        <p>
          RoBERTa and XLM-RoBERTa We evaluated the large version of RoBERTa, available under
FacebookAI/roberta-large, since it has been shown to be state-of-the-art for similar tasks (see
Section 2.1). We also evaluated XLM-RoBERTa, available under FacebookAI/xlm-roberta-large, which is
RoBERTa pre-trained for multi-lingual tasks [
          <xref ref-type="bibr" rid="ref41">41</xref>
          ].
        </p>
        <p>
          DeBERTa V3 DeBERTa V3 is an improvement upon the original DeBERTa model [
          <xref ref-type="bibr" rid="ref42">42</xref>
          ]. The original
DeBERTa model outperforms the large version of RoBERTa using less training data on a wide range of
NLP tasks [
          <xref ref-type="bibr" rid="ref43">43</xref>
          ]. The DeBERTa family of models also utilise distangled attention and relative position
embeddings which allow it to process longer sequences than BERT and RoBERTa. Due to these factors,
we chose to evaluate DeBERTa V3, as available under microsoft/deberta-v3-large.
        </p>
        <p>
          Gemma The 7-billion parameter version of Gemma outperforms similar models of equal size such
as Mistral-7B and Llama-2-7B [
          <xref ref-type="bibr" rid="ref44">44</xref>
          ]. Limited by our computational resources, we evaluated the smaller
2-billion parameter version of Gemma, as available under google/gemma-2b. This smaller version still
necessitated using techniques such as LoRA and double quantising the model to 4-bit normal float. We
applied LoRA to all matrices in the self attention- and mlp-layers of Gemma.
        </p>
      </sec>
      <sec id="sec-4-5">
        <title>4.5. Hyperparameters</title>
        <p>Due to our limited computational resources, unfortunately, no experiments could be exhaustive. When
we discovered that a certain hyperparameter value worked well, for instance using a warm-up period,
we could not then aford to repeat experiments for all previous models to include this choice. Eforts
where instead directed as to for each model balance the necessity to fit to the data in a manageable time
frame with the desire not to cause excessive unlearning in the base model.</p>
        <p>The main parameters which had to be adapted depending on the size of the models was the learning
rate and the warm-up ratio. For instance, if a large model was trending downwards by the second epoch,
then the learning rate might be lowered and/or a warm-up period added, in this way experiments where
exploratory.</p>
        <p>We set specific hyperparameters to increase training speed and reduce memory consumption to
accommodate larger models. For instance, all models except BERT and mBERT used 16-bit floating
point mixed-precision training to accelerate the training process. BERT and mBERT used regular
full-precision training. Additionally, Gemma required LoRA and 4-bit quantisation to make fine-tuning
feasible for us.</p>
        <p>All models trained using a maximum sequence length of 512 tokens. Whilst we would have preferred
to train with longer sequence length for the models which can handle it (DeBERTa-V3 and Gemma),
this was not computationally feasible. However, to still utilise the longer context lengths DeBERTa-V3
can handle, it was re-evaluated using a maximum sequence length of 4096 tokens after training was
complete. In this way we could train and evaluate the models more eficiently with 512 tokens and
then afterwards leverage longer context lengths for only the final version of the model. We would
have preferred to also re-evaluate Gemma using a longer context length, however, due to unforeseen
limitations on computational resources, only DeBERTa could be re-evaluated using a longer sequence
length.</p>
        <p>Test data for orientation task:
id, text, text_en, sex
se1, txt1, txt1_en, M
id,
se6,
se5,
se8,</p>
        <p>Training data for power task:
speaker, text, text_en, sex
sp1, txt1, txt1_en, M
sp1, txt4, txt4_en, M
sp1, txt3, txt3_en, M</p>
        <p>Prediction:</p>
      </sec>
      <sec id="sec-4-6">
        <title>4.6. Ensemble modelling</title>
        <p>After identifying the best performing models and training methods using our validation set, we created
new training and validation sets which we used to re-train the selected models for ensemble modelling.
These new validation sets contained disjoint selections of 10% of the available data, with a minimum of
5 samples for each country and label.</p>
        <p>We chose this approach to increase the amount of data available to our models. By each model in the
ensemble having a separate validation set, each model could be monitored for over-fitting whilst the
ensemble as a whole had still trained on the entire dataset. We speculate that by using this approach,
our ensemble will be able to leverage the entire training set. This is since if a single model has not been
able to learn something useful due to the required data being in its validation set, the other models of
the ensemble will have had access to that data.</p>
        <p>We also chose to decrease the ratio of the validation set as we deemed the necessity of it being
representative and reliable to be diminished once we had already determined and validated our method.</p>
        <p>We created the ensemble by selecting the best performing multilingual and English-only models. We
then trained two instances of the best performing of the two models as well as once instance of the
other model using our newly created ensemble training and validation sets. For a given prediction, we
ran each of these models and averaged their output logits before applying the sigmoid function and
rounding to receive a final prediction.</p>
      </sec>
      <sec id="sec-4-7">
        <title>4.7. Additional data extraction for test set</title>
        <p>Roughly 23% of the texts appearing in the provided test data for the orientation task also appear in the
training data for the power task. Using this information we can extract the speaker id for the overlapping
texts. Then, since the orientation label is always the same for each speaker, we can use these additional
speeches to influence our prediction on the test set. For a given speech in the orientation test set, we
averaged the logits of the examined model on that speech and the logits of our best performing model
on all other speeches by the same speaker. In other words, predictions on the test data were averaged
with those produced by our best model on speeches by the same speaker. This way if the text in the
test data lacks clear ideological signals, we can instead rely on other texts by that speaker to make our
prediction. The process is visualised in Figure 6.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results</title>
      <p>In the following, we present the results of our method application to the provided dataset and evaluated
models.</p>
      <p>Sub-task</p>
      <sec id="sec-5-1">
        <title>Orientation</title>
      </sec>
      <sec id="sec-5-2">
        <title>Power</title>
        <p>Macro-average F1-score</p>
        <p>We fine-tuned the models using the transformers library for Python as provided by Hugging Face,
running on a NVIDIA V100 with 32GB of memory. Also, if not mentioned, we set the hyper-parameter
values to their default values as provided by the library.</p>
        <p>The competition organisers provided a baseline of a simple linear logistic regression model. When
we fitted this model to our training set and then applied this model to our validation set, we achieved
the macro-average F1-scores as shown in Table 3.</p>
        <sec id="sec-5-2-1">
          <title>5.1. Method components</title>
          <p>To understand the efects of each component of our method, we fine-tuned BERT multiple times with
diferent combinations of the components in our base method. These components, as presented in
Section 4, were combined training, back-translation, polarity label extension and meta data inclusion.
All runs used the same hyper-parameters, which can be found in Appendix C.1. Results are illustrated
over the training epochs in Figure 7 and summarised in Table 4.</p>
          <p>The results as a whole show that the combined training beats both the conventionally trained BERT
and the baseline. The other components all individually improve performance of the combined training
further. Finally, all components together yielded the best performance.</p>
          <p>Combined training (CT) Training to predict both labels at once using our LML-loss showed
significant improvements in comparison to when only training for a single label at a time.
Back-translation (BT) Our results indicate that back-translation yielded an improvement in the
orientation task over all epochs whilst only yielding an non-marginal improvement in the first epochs
of the power task when training for both tasks using CT. To further investigate if back-translation
helped improve the performance of countries with less data, we also visualised the results for each
baseline</p>
        </sec>
      </sec>
      <sec id="sec-5-3">
        <title>BERT</title>
        <p>+CT
+CT+BT
+CT+PLE
+CT+MDI
+(all)
parliament individually. Results can be found in Appendix D.2 and show that, on average, parliaments
with back-translation saw a significant improvement whilst the remaining parliaments did not.
Polarity label extension (PLE) Extending the combined training by adding a third label yielded an
increase in performance over all epochs.</p>
        <p>Meta data inclusion (MDI) Including the available meta data by prepending it to each text resulted
in a improvement by the second epoch and onwards for both tasks. However, for the first epoch it
caused a decrease in performance for the power task whilst not impacting the orientation task.
Method components conclusions The examination of the components in our method seems to
indicate that all components of our method are beneficial for BERT. This is especially clear due to the
combination of two factors. The first factor is that the conventionally trained model had seemingly
started to stagnate or over-fit whilst our proposed method was still improving through out all training
epochs. The second factor is that our method exceeds the conventional fine-tuning already by the first
epoch. In combination then, we may reason that our method provides an intrinsic advantage since it
both converges faster, by the second factor, and does seems to cause less over-fitting or unlearning, by
the first factor. These factors may also be reasoned as to guaranteeing that we actually make better
update steps instead of just smaller (by the second factor) or larger (by the first factor).</p>
        <p>In order to to validate that the improvement in performance on the orientation task from our method
is not only due to the increased amount of data, we conventionally fine-tuned RoBERTa on the full set
of available orientation data. We compare this to RoBERTa fine-tuned using the same hyperparameters,
as found in Appendix C.2, but using our full method. Results are illustrated in Figure 8 and show
that even when using the same training data, our method exceeds conventional fine-tuning over all
epochs for orientation classification. As discussed in Section 2.1, fine-tuned RoBERTa has been shown
to outperform very capable models and to be state-of-the-art for similar tasks. It is therefore very
encouraging to note that our method managed to significantly improve upon the performance of
ifne-tuned RoBERTa for political orientation classification.</p>
        <sec id="sec-5-3-1">
          <title>5.2. Models</title>
          <p>The highest attained scores resulting from the application of our method on various models are shown in
Table 5. Corresponding hyperparameters can be found in Appendix C.2. Results indicate that
DeBERTaV3 was the best performing model, with XLM-RoBERTa being the best performing multilingual model.
Gemma, which trained using LoRA and quantisation, manages to exceed the performance of BERT and
mBERT but falls short of the other models.</p>
          <p>To investigate the impact of re-evaluating DeBERTa-V3 using a longer sequence length, we also
evaluated diferent sequence lengths. The results are shown in Table 6 and indicate that there was a
significant improvement in performance from increasing the sequence length initially but that these
increases diminish. The improvement by going from 512 to 1024 tokens was noticeable (+0.0059 and
+0.0084) whilst the improvement by going from 2048 to 4096 tokens was minor (+0.0001 and +0.0003).
These findings are not surprising, after all, successive increases in maximum sequence length add fewer
and fewer tokens since more speeches become fully covered.</p>
        </sec>
        <sec id="sec-5-3-2">
          <title>5.3. Translated vs. multilingual</title>
          <p>To investigate whether models pre-trained for multilingual tasks outperform their mainly
Englishcomprehending base models, we compared BERT and mBERT as well as RoBERTa and XLM-RoBERTA.
Each pair used the same hyperparameters internally (see Appendix C.2). The multilingual models
processed the original texts whilst their counterparts processed the automatic translations. Results
indicate that the multilingual models lag behind by a consistent amount. The macro-average F1-scores
over the training epochs can be found in Appendix D.1.</p>
        </sec>
      </sec>
      <sec id="sec-5-4">
        <title>XLM-RoBERTa</title>
      </sec>
      <sec id="sec-5-5">
        <title>DeBERTa-V3</title>
        <p>Ensemble</p>
        <sec id="sec-5-5-1">
          <title>5.4. Ensemble modelling</title>
          <p>In order to validate that ensemble modelling was a beneficial approach, we averaged the output logits
of DeBERTa-V3 and XLM-RoBERTa, fine-tuned on our base training set, on our base validation set. The
macro-average F1-scores of the yielded predictions, as seen in Table 7, show that the predictions of
our best performing stand-alone model could be improved by also considering the outputs of our best
performing multilingual model.</p>
        </sec>
        <sec id="sec-5-5-2">
          <title>5.5. Test set results</title>
          <p>Baseline The macro-average F1-scores attained by the baseline model on the competition test set
are shown in Table 8. This baseline model was fitted to the entirety of the original provided datasets.
When comparing this baseline to the baseline on our validation set, we see a decrease in macro-average
F1-score of 0.1152 and 0.0748 for the orientation and power task respectively. This indicates that the
test set is much more challenging, which is not surprising due to the nature of its construction. For
the orientation task the test set contains speakers that do not appear in the training set, and for the
power task it contains speakers which appear with a diferent role than they do in the training data.
The test set also does not share the same distributions in parliament representation, for further details
see Section 3.</p>
          <p>Final ensemble model Our final ensemble consisted of two DeBERTa-V3 models and one
XLMRoBERTa model, fine-tuned using disjoint selected validation sets, as detailed in Section 4.6. We
have made these models available on Hugging Face under oscpalML/DeBERTa-political-classification ,
oscpalML/DeBERTa-political-classification-alternative and oscpalML/XLM-RoBERTa-political-classification .
Our final ensemble, averaging the logits of these models, yields macro-average F1-scores as seen in
Table 8.</p>
          <p>Additional data extraction The additional data extraction improved the performance on the
orientation task. Our ensemble, without considering the other available speeches by a speaker, yielded a
macro-average F1-score for the orientation task of 0.7854 whilst when utilising the other speeches the
score increased to 0.7945.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Discussion</title>
      <p>In the following chapter, we discuss and reason about the efectiveness of the proposed solution. We
further discuss the task itself and the limitations of our project.</p>
      <p>Method efectiveness We show that our method improves performance for BERT and RoBERTa.
Whether or not these findings translate to other models and tasks is, of course, a prudent question. The
limitations of this project, enforced upon us by our limited computational resources, prevent us from
examining this quandary fully. However, due to the relatively similar architectures of our examined
models and the nature of our method, we hypothesise that the benefits of our method does translate.
This is because our method does not closely depend on the internals of a model, instead aiming to
provide a more representative loss function and better input data. We leave more extensive empirical
confirmation for future research.</p>
      <p>Multi-task training The combined training yields an increase in performance for the orientation
task, which is not surprising since we extract additional orientation labels and therefore provide the
model with more data. On the other hand, the fact that there is also a significant improvement for the
power task is very intriguing. We speculate that this improvement is due to our LML-loss providing a
more representative loss, which incentivises extracting features which are useful for both tasks and
discourages over-fitting. This seems to be supported by the additional increase in performance provided
by also adding the prediction of a polarity label. This increase in performance is even more impressive
when considering that the polarity label was synthetically generated and likely to add at least some
amount of noise. Since polarity likely shares some important similarities with features useful for our
tasks, we speculate that our LML-loss was improved as to further incentivise cross-task useful features.
Data preprocessing The observed impact of prepending available meta data to each speech, as
shown in Figure 7, is not inexplicable. We suspect that the prepended sentence is very diferent from
the pre-training material of the base model, since it is simply two words and does not follow the form
of a regular phrase or sentence. This disruption, we speculate, might essentially confuse the model until
it is able to learn it in later epochs. Once the model has understood how to interact with the prepended
sentence however, it is able to leverage it into making better predictions.</p>
      <p>It would be interesting for future research to compare the diference between adding new tokens
representing the meta data and prepending the meta data in English, as we did. It might be the case
that base models are able to leverage prior understanding of countries, be it their general political
environment or some other aspect. On the other hand, it might also be the case that prior bias hurts the
models ability to predict accurately and fairly.</p>
      <p>Nature of tasks On the validation set, it is interesting to note that the linear baseline performed
better on the power task than the orientation task given that the models utilising our method show the
opposite behaviour. We may also note that whilst the diference is small, the power task benefited more
from a longer sequence length. It is therefore not entirely unreasonable to suggest that the power task
might rely more on specific words and phrases, as the linear baseline does. In other words, it might be
the case that specific words are more important for predicting political power whilst how you speak in
general is more indicative for predicting political orientation.</p>
      <p>Diference between validation and test scores Another notable aspect is the discrepancy between
the achieved scores on the validation and test sets. Without using additional data extraction, our
top-performing single model achieved a macro-average F1-score on the validation set that was 10.1
percentage points higher than that of our best ensemble model on the test set. In contrast, the gap for
the power task was just 3.6 percentage points. We attribute the majority of this gap to two factors:
the diference in the distribution of the amount of parliamentary data and the nature of the test sets’
construction.</p>
      <p>Since all parliaments have the same amount of data in the test sets whilst having greatly difering
amounts of data in the training and validation sets, it is not surprising that the achieved scores difer.
In the likely case that the models perform better on parliaments with more data, then the test set
represents an increased presence of the harder-to-predict parliaments and a decreased presence of the
easier parliaments. Regardless of this factor, just the diference in distribution itself likely also introduces
a challenging condition. In other words, that there is a drift in label and parliament distributions is
likely detrimental, even if the nature of that drift was not suspected to be particularly damaging. This
is because the model likely to some extent relies on the statistical trends, such as favouring to predict
the more common label when a speech is ambiguous.</p>
      <p>The nature of the test sets’ construction may also account for the diference in discrepancy between
our two tasks. The power test set largely contains the same speakers as our training data, just with a
diferent power label. Given that we saw a relatively small decrease in performance, it seems that our
models have been able to avoid over-fitting to a specific speakers power label. Such a case was likely
aided by speakers exhibiting multiple power labels in the training data.</p>
      <p>This behaviour is not shared with the orientation task. Since the orientation test set largely consists
of speakers who do not appear in the training data, the gap in performance may indicate that our
models have overfit to specific speakers. An additional factor is that the new speakers may cover topics
our models have previously not encountered. If a speaker is mainly exhibiting a political idea which the
model has not previously learnt the ideological connotations of, then the classification likely becomes
much more challenging. It would therefore be interesting to investigate whether these previously not
encountered speakers are contemporary to and covering the same topics as the speakers in the training
set.</p>
      <p>Weak ideological signals Some parliamentary speeches might not indicate strong political beliefs.
They could solely cover practical proceedings, not expressing any opinions or making any arguments.
These types of speeches are likely more challenging to classify, especially if the provided dataset does
not exhibit clear rhetorical or linguistic diferences for labels within a given class. This likely introduces
an upper limit on the performance of any model performing this task with similar data.
Limitations As previously discussed, our limited access to computational resources determined what
methods and models we could examine. This prevented us from examining large models such as the
70-billion parameter version Llama-3 or even the the 7-billion parameter version of Gemma. Not only
were we limited in the selection of models, but also in the number of experiments which we could
perform. More time and computational resources would have allowed us to attempt more techniques
and further search for optimal hyperparameters. Techniques which could not be examined include
using diferent learning rates for diferent layers and balancing the loss-function.</p>
      <p>We were also limited by the data which we had access to. In real life, these speeches are not
standalone but most often parts of exchanges and debates. The problem of weak ideological signals could
likely be mitigated by considering all the speeches a speaker makes in an exchange together. By
representing speeches as parts of a larger debate, not only could a model base its prediction on all of
the speakers speeches, but also on the speeches made by the other participants in the debate.</p>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusion</title>
      <p>In this study, we proposed a method for improved fine-tuning of LLMs for ideology and power
identification. Our research questions where as stated below.</p>
      <p>RQ1 Investigate what the best methods and practices are for identifying the political orientation in a
parliamentary speech.</p>
      <p>RQ2 Investigate what the best methods and practices are for identifying whether a parliamentary
speech is made by a speaker in opposition or in power.</p>
      <p>In answering our research questions, we found that modern LLMs are an efective approach for
identifying both ideology and power in parliamentary debates. We further found that ideology and
power likely share useful features and therefore fine-tuning to predict them jointly yields improved
performance for both tasks. This improvement also extends to fine-tuning to predict synthetic labels, in
our case polarity.</p>
      <p>We also note that performance can be improved by making the context of the speech, as available by
meta data, available to the models. Furthermore, back-translation can be utilised to boost performance
of countries with a smaller presence in a given dataset. Finally, we found that English models predicting
on automatic translations tend to outperform multilingual models predicting on the original languages
but that an ensemble of both types of models is the best approach.</p>
      <sec id="sec-7-1">
        <title>Acknowledgments</title>
        <p>We would like to acknowledge our supervisor, Pablo Picazo-Sanchez, for his continuous guidance,
feedback and assistance in this project. Furthermore, we want to express our gratitude for the computational
resources provided by the Data Science and AI division at Chalmers University of Technology and
University of Gothenburg. Finally, we would like to thank our examiner Moa Johansson for providing
feedback on early and intermediary versions of this paper.</p>
        <p>A. List of countries in the dataset</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>B. Polarity base prompt</title>
      <p>Label the polarity of the following text, similarly to the provided examples. Your answer needs to
start with “positive”, “negative” or “neutral”, followed by a short justification for your answer. It is
important that you only assign a positive or negative label if you are sure of your answer. Here is your
ifrst example.</p>
      <p>Text: The south-west was cut of from the UK last winter and Network Rail performed miracles in
getting that line back up and running. I therefore find it extraordinary that reasons such as the weather
have been used to excuse the chaos and incompetence of this debacle, particularly out of King’s Cross.
Why did the Secretary of State feel that it was not necessary for Ministers to ask for a basic reassurance
that an overrun on any of the big programmes could be managed? Why were contingency plans not in
place, and why was the rail regulator warning not adhered to?</p>
      <p>Negative. The text expresses frustration and criticism towards the handling of infrastructure issues,
particularly the failure to address problems with the rail system despite previous incidents. It highlights
perceived incompetence and lack of planning, suggesting a negative sentiment towards the situation.</p>
      <p>Here is your second example.</p>
      <p>Text: We are committed to ensuring that claimants receive high-quality, objective, fair and accurate
assessments. The Department monitors assessment quality through independent audit. Assessments
deemed unacceptable are returned to the provider for reworking. A range of measures, including
provider improvement plans, address performance falling below expected standards. &lt;p&gt; I do agree
with the hon. Lady, which is why we have been trying to work more strategically with Motability,
thrashing through the issues I am very aware of on appeals and on matters such as when an individual
leaves the country. We are looking to reduce the amount of time that appeals take and at what we can
do with the running of the scheme so that the precise scenario she outlines does not happen.</p>
      <p>Neutral. The text describes the commitment to ensuring quality assessments for claimants and
outlines measures taken to monitor and address assessment quality. Additionally, it mentions eforts
to work with Motability to improve processes and reduce appeal times. The tone is informative and
focused on addressing issues, without expressing overt positivity or negativity.</p>
      <p>Here is your third example.</p>
      <p>Text: I congratulate the hon. Gentleman on bringing this much needed debate to the Floor of the
House. Will he join me in paying tribute to local MND associations across the United Kingdom for the
invaluable support they provide? I know of the excellent work of my local Leicestershire and Rutland
association, having heard at first hand from a constituent and friend of mine, Ruth Morrison, about
her tragic personal experience. The support that is available is of immense value and I hope the hon.
Gentleman will join me in paying tribute to the work of those associations.</p>
      <p>Positive. The text expresses gratitude and admiration for the eforts of local Motor Neurone Disease
(MND) associations, highlighting the invaluable support they provide. It also encourages
acknowledgment of their work, suggesting a positive sentiment towards their contributions.</p>
      <p>Now here is your text to label:</p>
    </sec>
    <sec id="sec-9">
      <title>C. Hyperparameters</title>
      <sec id="sec-9-1">
        <title>C.1. BERT method components</title>
        <p>The hyperparameters which where not left to their default values as provided by the transformers
library are shown in table 9.</p>
        <p>Hyperparameter</p>
        <p>Value</p>
        <sec id="sec-9-1-1">
          <title>Learning rate</title>
        </sec>
        <sec id="sec-9-1-2">
          <title>Epochs</title>
        </sec>
        <sec id="sec-9-1-3">
          <title>Batch size</title>
        </sec>
        <sec id="sec-9-1-4">
          <title>Weight decay</title>
        </sec>
        <sec id="sec-9-1-5">
          <title>Input length</title>
          <p>3e-5
5
40
0.001
512</p>
        </sec>
        <sec id="sec-9-1-6">
          <title>Learning rate</title>
        </sec>
        <sec id="sec-9-1-7">
          <title>Epochs</title>
        </sec>
        <sec id="sec-9-1-8">
          <title>Warm-up ratio</title>
        </sec>
        <sec id="sec-9-1-9">
          <title>Batch size</title>
        </sec>
        <sec id="sec-9-1-10">
          <title>Weight decay</title>
        </sec>
        <sec id="sec-9-1-11">
          <title>Train input length</title>
          <p>Eval. input length
*Gradients where accumulated for 2 steps to simulate batch size 20 for DeBERTa-V3</p>
        </sec>
      </sec>
      <sec id="sec-9-2">
        <title>C.2. Model hyperparameters</title>
        <p>The best performing hyperparameters used for models which did not utilise LoRA can be found in
table 10, and the ones for models which did utilise LoRA in table 11. Not mentioned hyperparameter
values where left to their defaults as provided by the transformers library.</p>
      </sec>
    </sec>
    <sec id="sec-10">
      <title>D. Figures and illustrations</title>
      <sec id="sec-10-1">
        <title>D.1. Multilingual model performance figures</title>
        <p>The comparison of models and their multilingual counterparts is illustrated in fig. 9.</p>
      </sec>
      <sec id="sec-10-2">
        <title>D.2. Back-translation impact on specific parliaments</title>
        <p>The diference in macro-average F1-score when fine-tuning combined training BERT with and without
back-translation is visualised for each parliament in fig. 10.</p>
      </sec>
      <sec id="sec-10-3">
        <title>D.3. Power dataset illustrations</title>
        <p>The power dataset is illustrated inf fig. 11 and fig. 12.</p>
        <p>BERT vs. mBERT, Power</p>
        <p>BERT vs. mBERT, Orientation
1
f
0.02
0.020
0.015
0.010
e
r
o
c
s
e
g
a
r
e
v
o
r
c
a
f10.005
-a0.000
m
e
h
T
e
h</p>
        <p>T
IcelandGalicia LatviaEstoniaCataloneirazegovinaHungaryBelgiumFinlandSwedenDenmarkBulgariaCzechiaNorwayPortugal ItalySlovenia SpainGreeceFranceetherlandsUkrainePolandCroatiaAustria SerbiaTurkreeyatBritain</p>
        <p>N</p>
        <p>G</p>
        <p>Country
(a) Orientation</p>
        <p>Delta macro-average f1 score from backtranslation on the power dataset
H
d
n
a
ia
n
s
o
B</p>
        <p>Back-translated data
Non back-translated data
e
u
q
s
a
B</p>
        <p>H
d
n
a
ia
n
s
o</p>
        <p>B
translation on the orientation task. The countries are ordered by the number of speeches before back-translation,
from left to right in increasing order.</p>
        <p>AuesCtreioaruznetgryovBinealgBiuumlgCaartiaalonCiaroaCtziaeDcheinamaErsktonFiianlanFdranGcGreeaalitcBiaritaGinreHecuengaIcryelandItalLyatNvioarwaPyolPanodrtugSalerbiaSpSaTwihneeSdNleoenvtehneiralandTsurkUekyraine
asqnudH
B a</p>
        <p>Country</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Coleman</surname>
          </string-name>
          ,
          <article-title>Meaningful political debate in the age of the soundbite</article-title>
          , in: Televised election debates: International perspectives, Springer,
          <year>2000</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>24</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>H.</given-names>
            <surname>Wasmuth</surname>
          </string-name>
          ,
          <string-name>
            <surname>E. Nitecki,</surname>
          </string-name>
          (
          <article-title>Un)intended consequences in current ECEC policies: Revealing and examining hidden agendas</article-title>
          ,
          <source>Policy futures in education 18</source>
          (
          <year>2020</year>
          )
          <fpage>686</fpage>
          -
          <lpage>699</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Hinich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. C.</given-names>
            <surname>Munger</surname>
          </string-name>
          , Analytical politics, Cambridge University Press,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Pew</given-names>
            <surname>Research</surname>
          </string-name>
          <string-name>
            <surname>Center</surname>
          </string-name>
          ,
          <article-title>Americans' Dismal Views of the Nation's Politics</article-title>
          , https://www.pewresea rch.org/politics/2023/09/19/americans-dismal
          <article-title>-views-of-the-nations-</article-title>
          <string-name>
            <surname>politics</surname>
            <given-names>/</given-names>
          </string-name>
          ,
          <source>2023. Accessed on November 29</source>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M. K.</given-names>
            <surname>David</surname>
          </string-name>
          ,
          <article-title>Language, power and manipulation: The use of rhetoric in maintaining political influence</article-title>
          ,
          <source>Frontiers of Language and Teaching</source>
          <volume>5</volume>
          (
          <year>2014</year>
          )
          <fpage>164</fpage>
          -
          <lpage>170</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Ö.</given-names>
            <surname>Sahin</surname>
          </string-name>
          , Ö. Sahin,
          <article-title>A gentle introduction to ML and NLP, Develop Intelligent iOS Apps with Swift: Understand Texts, Classify Sentiments, and Autodetect Answers in Text Using NLP (</article-title>
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>W.</given-names>
            <surname>Medhat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hassan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Korashy</surname>
          </string-name>
          ,
          <article-title>Sentiment analysis algorithms and applications: A survey</article-title>
          ,
          <source>Ain Shams engineering journal 5</source>
          (
          <year>2014</year>
          )
          <fpage>1093</fpage>
          -
          <lpage>1113</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>P.</given-names>
            <surname>Törnberg</surname>
          </string-name>
          , ChatGPT-4
          <string-name>
            <given-names>Outperforms</given-names>
            <surname>Experts</surname>
          </string-name>
          and
          <article-title>Crowd Workers in Annotating Political Twitter Messages with Zero-Shot Learning</article-title>
          ,
          <source>arXiv preprint arXiv:2304.06588</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9] Université Grenoble Alpes, CLEF 2024 -
          <article-title>conference and labs of the evaluation forum</article-title>
          , https: //clef2024.imag.fr/,
          <source>2024. Accessed on January 17</source>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Webis</surname>
            <given-names>Group</given-names>
          </string-name>
          , Touche, https://touche.webis.de/, ????.
          <source>Accessed on January 17</source>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Webis</surname>
            <given-names>Group</given-names>
          </string-name>
          ,
          <source>Ideology and Power Identification in Parliamentary Debates</source>
          <year>2024</year>
          , https://touche.web is.de/clef24/touche24-web/ideology-and
          <article-title>-power-identification-in-parliamentary-debates</article-title>
          .html, ????.
          <source>Accessed on January 17</source>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kiesel</surname>
          </string-name>
          , Ç. Çöltekin,
          <string-name>
            <given-names>M.</given-names>
            <surname>Heinrich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Alshomary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. D.</given-names>
            <surname>Longueville</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Erjavec</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Handke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kopp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ljubešić</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Meden</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Mirzakhmedova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Morkevičius</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Reitis-Münstermann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Scharfbillig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Stefanovitch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wachsmuth</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>
          , Overview of Touché 2024:
          <article-title>Argumentation Systems</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="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>L.</given-names>
            <surname>Derczynski</surname>
          </string-name>
          ,
          <string-name>
            <surname>Complementarity</surname>
          </string-name>
          , F-score,
          <source>and NLP Evaluation, in: Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC'16)</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>261</fpage>
          -
          <lpage>266</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Bosley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jacobs-Harukawa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Licht</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hoyle</surname>
          </string-name>
          ,
          <article-title>Do we still need BERT in the age of GPT? Comparing the benefits of domain-adaptation and in-context-learning approaches to using LLMs for Political Science Research (</article-title>
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>H.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Pelrine</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. F.</given-names>
            <surname>Godbout</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Rabbany</surname>
          </string-name>
          , Open, closed, or
          <article-title>small language models for text classification?</article-title>
          ,
          <source>arXiv preprint arXiv:2308.10092</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chae</surname>
          </string-name>
          , T. Davidson,
          <article-title>Large Language Models for Text Classification: From Zero-Shot Learning to Fine-Tuning, Open Science Foundation (</article-title>
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. J.</given-names>
            <surname>Pan</surname>
          </string-name>
          , L. Bing,
          <article-title>Sentiment analysis in the era of large language models: A reality check</article-title>
          ,
          <source>arXiv preprint arXiv:2305.15005</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Abdullah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Altiti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Obiedat</surname>
          </string-name>
          ,
          <article-title>Detecting propaganda techniques in English news articles using pre-trained transformers</article-title>
          ,
          <source>in: 2022 13th International Conference on Information and Communication Systems (ICICS)</source>
          , IEEE,
          <year>2022</year>
          , pp.
          <fpage>301</fpage>
          -
          <lpage>308</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>K.</given-names>
            <surname>Sprenkamp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. G.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zavolokina</surname>
          </string-name>
          ,
          <article-title>Large language models for propaganda detection</article-title>
          ,
          <source>arXiv preprint arXiv:2310.06422</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>A.</given-names>
            <surname>Benayas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Sicilia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mora-Cantallops</surname>
          </string-name>
          ,
          <article-title>A comparative analysis of encoder only and decoder only models in intent classification and sentiment analysis: Navigating the trade-ofs in model size and performance (</article-title>
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>C.</given-names>
            <surname>Sung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Dhamecha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Saha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Reddy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Arora</surname>
          </string-name>
          ,
          <article-title>Pre-training BERT on domain resources for short answer grading</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>6071</fpage>
          -
          <lpage>6075</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Tinn</surname>
          </string-name>
          , H. Cheng, M. Lucas,
          <string-name>
            <given-names>N.</given-names>
            <surname>Usuyama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Naumann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Poon</surname>
          </string-name>
          ,
          <article-title>Domainspecific language model pretraining for biomedical natural language processing</article-title>
          ,
          <source>ACM Transactions on Computing for Healthcare (HEALTH) 3</source>
          (
          <issue>2021</issue>
          )
          <fpage>1</fpage>
          -
          <lpage>23</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Smartling</surname>
          </string-name>
          ,
          <article-title>What is back translation and why is it important</article-title>
          ?,
          <year>2023</year>
          . URL: https://www.smartling. com/resources/101/what-is
          <article-title>-back-translation-and-why-is-it-important/.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>S.</given-names>
            <surname>Edunov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ranzato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Auli</surname>
          </string-name>
          ,
          <article-title>On the evaluation of machine translation systems trained with back-translation</article-title>
          , arXiv preprint arXiv:
          <year>1908</year>
          .
          <volume>05204</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Beddiar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Jahan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Oussalah</surname>
          </string-name>
          ,
          <article-title>Data expansion using back translation and paraphrasing for hate speech detection</article-title>
          ,
          <source>Online Social Networks and Media</source>
          <volume>24</volume>
          (
          <year>2021</year>
          )
          <fpage>100153</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>S.</given-names>
            <surname>Shleifer</surname>
          </string-name>
          ,
          <article-title>Low resource text classification with ulmfit and backtranslation</article-title>
          , arXiv preprint arXiv:
          <year>1903</year>
          .
          <volume>09244</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Ou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <article-title>Enhancing label correlations in multi-label classification through global-local label specific feature learning to fill missing labels</article-title>
          ,
          <source>Computers and Electrical Engineering</source>
          <volume>113</volume>
          (
          <year>2024</year>
          )
          <fpage>109037</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Y. Cheng,
          <string-name>
            <given-names>X.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <article-title>Simple and robust loss design for multi-label learning with missing labels</article-title>
          ,
          <source>arXiv preprint arXiv:2112.07368</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Abdelfattah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>An efective approach for multi-label classification with missing labels</article-title>
          ,
          <source>in: 2022 IEEE 24th Int Conf on High Performance Computing &amp; Communications; 8th Int Conf on Data Science &amp; Systems; 20th Int Conf on Smart City; 8th Int Conf on Dependability in Sensor, Cloud &amp; Big Data Systems &amp; Application</source>
          (HPCC/DSS/SmartCity/DependSys), IEEE,
          <year>2022</year>
          , pp.
          <fpage>1713</fpage>
          -
          <lpage>1720</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ma</surname>
          </string-name>
          , S. Chen,
          <article-title>Expand globally, shrink locally: Discriminant multi-label learning with missing labels</article-title>
          ,
          <source>Pattern Recognition</source>
          <volume>111</volume>
          (
          <year>2021</year>
          )
          <fpage>107675</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>B.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.-G.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <surname>Q.</surname>
          </string-name>
          <article-title>Ji, Multi-label learning with missing labels</article-title>
          ,
          <source>in: 2014 22nd International conference on pattern recognition, IEEE</source>
          ,
          <year>2014</year>
          , pp.
          <fpage>1964</fpage>
          -
          <lpage>1968</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Jia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xiao</surname>
          </string-name>
          , C. Liu,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rashid</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. F.</given-names>
            <surname>Gehringer</surname>
          </string-name>
          ,
          <article-title>All-in-one: Multi-task learning bert models for evaluating peer assessments</article-title>
          ,
          <source>arXiv preprint arXiv:2110.03895</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>U. N.</given-names>
            <surname>Group</surname>
          </string-name>
          , EXIST: sEXism Identification in Social neTworks,
          <year>2021</year>
          . URL: http://nlp.uned.es/exis t2021/,
          <source>accessed on January 28</source>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <surname>Çöltekin</surname>
            , Ç.,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Kopp</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Morkevičius</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ljubešić</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Meden</surname>
          </string-name>
          , T. Erjavec,
          <article-title>Training data for the shared task Ideology and Power Identification in Parliamentary Debates</article-title>
          , https://doi.org/10.5281/ zenodo.10450641,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <surname>CLARIN</surname>
            <given-names>ERIC</given-names>
          </string-name>
          , ParlaMint: Harmonised Parliamentary Corpora,
          <year>2021</year>
          . URL: https://www.clarin.eu/ parlamint, accessed
          <source>on November 24</source>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <surname>K. K. Dobbin</surname>
            ,
            <given-names>R. M.</given-names>
          </string-name>
          <string-name>
            <surname>Simon</surname>
          </string-name>
          ,
          <article-title>Optimally splitting cases for training and testing high dimensional classifiers</article-title>
          ,
          <source>BMC medical genomics 4</source>
          (
          <year>2011</year>
          )
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>Q. H.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          , H.
          <string-name>
            <surname>-B. Ly</surname>
            ,
            <given-names>L. S.</given-names>
          </string-name>
          <string-name>
            <surname>Ho</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Al-Ansari</surname>
            ,
            <given-names>H. V.</given-names>
          </string-name>
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>V. Q.</given-names>
          </string-name>
          <string-name>
            <surname>Tran</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Prakash</surname>
            ,
            <given-names>B. T.</given-names>
          </string-name>
          <string-name>
            <surname>Pham</surname>
          </string-name>
          ,
          <article-title>Influence of data splitting on performance of machine learning models in prediction of shear strength of soil</article-title>
          ,
          <source>Mathematical Problems in Engineering</source>
          <year>2021</year>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>A. Q.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sablayrolles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mensch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bamford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. S.</given-names>
            <surname>Chaplot</surname>
          </string-name>
          , D. d. l. Casas,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bressand</surname>
          </string-name>
          , G. Lengyel,
          <string-name>
            <given-names>G.</given-names>
            <surname>Lample</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Saulnier</surname>
          </string-name>
          , et al.,
          <source>Mistral 7b, arXiv preprint arXiv:2310.06825</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>H.</given-names>
            <surname>Touvron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Albert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Almahairi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Babaei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Bashlykov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Batra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bhargava</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhosale</surname>
          </string-name>
          , et al.,
          <source>Llama</source>
          <volume>2</volume>
          :
          <article-title>Open foundation and fine-tuned chat models</article-title>
          ,
          <source>arXiv preprint arXiv:2307.09288</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <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>
          ,
          <source>in: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers),
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <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</article-title>
          , arXiv preprint arXiv:
          <year>1911</year>
          .
          <volume>02116</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [42]
          <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>
          ,
          <source>arXiv preprint arXiv:2111.09543</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          [43]
          <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,
          <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="ref44">
        <mixed-citation>
          [44]
          <string-name>
            <given-names>G.</given-names>
            <surname>Team</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mesnard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hardin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Dadashi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhupatiraju</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pathak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Sifre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rivière</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Kale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Love</surname>
          </string-name>
          , et al.,
          <source>Gemma: Open models based on gemini research and technology, arXiv preprint arXiv:2403.08295</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>