<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Ensemble of ELECTRA for Profiling Fake News Spreaders</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Kaushik Amar Das</string-name>
          <email>kaushikamardas@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Arup Baruah</string-name>
          <email>arup.baruah@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ferdous Ahmed Barbhuiya</string-name>
          <email>ferdous@iiitg.ac.in</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kuntal Dey</string-name>
          <email>kuntal.dey@accenture.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Accenture Tech Labs</institution>
          ,
          <addr-line>Bangalore</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Indian Institute of Information Technology</institution>
          ,
          <addr-line>Guwahati</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <abstract>
        <p>This paper presents an ensemble classifier that uses ELECTRA models for the task of identifying possible Fake News Spreaders on Twitter in PAN at CLEF 2020 lab. Our ensemble is created using 15 models which have been finetuned on the task dataset. Our approach scored an accuracy of 0:70 and 0:69 on the English and Spanish test sets respectively. Copyright c 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0). CLEF 2020, 22-25 September 2020, Thessaloniki, Greece.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>Fake news is a form of news that is circulated with the aim of deceiving users and
manipulating them into formulating specific opinions. With the growth of social media
platforms such as Facebook and Twitter, it is now easier than ever to spread fake news.
This problem is aggravated further when users knowingly or unknowingly share articles
that contain false or misleading information.</p>
      <p>
        There exist numerous sites that use expert analysis to fact check and debunk fake
articles, such as snopes.com, politifact.com etc. The problem of fake news has also been
actively tackled by the research community. To list a few, the works in [
        <xref ref-type="bibr" rid="ref5 ref6">5,6</xref>
        ] studied the
incorporation of emotional features into Long Short Term Memory (LSTM) network
for detecting fake news. The authors in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] introduced a system called DeClarE which
combines evidence collected from the web, language style and trustworthiness of the
sources for analysing the credibility of claims in textual form. The work in [17]
investigated the use of user profiles as potential features for improving fake news detection
systems.
      </p>
      <p>
        With an aim to further investigate this problem, PAN at CLEF’20 introduced the
task of Profiling Fake News Spreaders on Twitter [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. The objective of this task is to
identify whether a Twitter user is a possible fake news spreader given a collection of
his tweets. This task is available in English and Spanish. We participated in this task in
both languages.
      </p>
      <p>The rest of this paper is organised as follows. First, the dataset for the task is
discussed in §2. Our approach is described in §3. The performance of our classifier is
analysed in §4 before concluding in §5.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Dataset</title>
      <p>The dataset [15] for the task of Profiling Fake News Spreaders is featured in two
languages: English and Spanish. The number of data samples in each of these two datasets
are the same. Each contains 300 authors out of which 150 are labelled as possible
fake news spreaders while the rest are labelled as not spreaders. A collection of 100
tweets is given for each of these authors in which we trained our classification systems.
The dataset is perfectly balanced as illustrated in Figure 1. Additionally, the dataset
is anonymized [14] to protect the tweet author’s privacy. As such, identifiers like user
handles and URLs have been replaced with‘#USER#’ and ‘#URL#’ tokens respectively.
Some examples of the data are given in Figure 2. Some other noteworthy features of the
dataset are listed below.</p>
      <p>– By counting the number of unique tweets within the collection of 100 tweets given
for each author, we found that overall, only 343 authors have all unique tweets. For
each language, about half of the authors had some duplicates.
– In the entire dataset, the shortest tweet has 1 word while the longest tweet has 86
words. The tweets contained an average of around 15 words.
– While many authors did not use any emojis, 284 to be exact, the rest used emojis
in at least one of their tweets.</p>
      <p>
        We do not know anything about the test set since our models were evaluated using
the TIRA system [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. TIRA uses blind evaluation, a paradigm in which it runs our
models on a hidden test set without exposing any information about it to the participants.
We submitted our models adhering to the guidelines given by the organizers.
150
125
t100
oun 75
c
50
25
0
150
150
150
150
      </p>
      <p>English</p>
      <p>Spanish
Fake News Spreader
label</p>
      <p>
        Not Spreader
English: ‘Journaling Benefit: How Journaling Can Help Create Mental Calmness and
Clarity #URL# #HASHTAG#. . . #URL#’
Spanish: ‘Abuelito pagará 2 mil pesos por daños al vehículo que lo atropelló #URL#’
Our approach involves an ensemble classifier built using the ELECTRA model [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. We
chose this model because of it’s small size, fast training speed and promising
benchmark scores. This made it possible for us to experiment with ensembles using modest
computing resources. In this section, we briefly describe the ELECTRA model before
moving on to the details about the classifier. In the rest of this section, author and data
sample are used interchangeably, since each data sample in the dataset is an author. The
code used in this work is available in GitHub3.
At present, the current state-of-the-art in natural language processing is held by large
Transformer-based [18] models which have been trained using the BERT technique [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ],
for example, RoBERTa [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], T5 [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], etc. These models are trained in an unsupervised
manner on a vast amount of text data and can be fine-tuned for other downstream tasks
such as text classification, question answering, etc. The unsupervised task often used for
training such models is the prediction of masked tokens. In this task, a small percentage,
typically 15%, of tokens in the input data is corrupted with a [MASK] token. The model
is trained to correctly predict these masked tokens. This task (also called as a
pretraining task) has the disadvantage of only learning from a small portion of the text
sequence which is largely computationally inefficient.
      </p>
      <p>
        The ELECTRA training method [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], which stands for Efficiently Learning an
Encoder that Classifies Token Replacements Accurately, aims to address this inefficiency
while retaining all the same capabilities of BERT. This is done by using a novel
pretraining task, called as replaced token detection, in which a model is trained to
distinguish between real input tokens from synthetic but plausible replacements. The model
is required to predict over each of the input tokens whether it is the real input token or a
replaced one thereby learning from the entire sequence instead just a small percentage
of it. This results in ELECTRA performing competitively with other
state-of-the-artmodels while using only about 25% of their computing requirements.
3 https://github.com/cozek/profiling-fake-news-spreaders
i.e for each data sample, a collection of 100 tweets is given, whose tokens altogether
cross the token limit.
      </p>
      <p>An obvious method would be to truncate and reduce the number of tokens. But we
avoid doing so due to two reasons. Firstly, in the entire set of an author’s tweets, not
all of them might be fake and vice versa. Secondly, doing so will result in the loss of a
lot of information. Hence, to address these issues, in this work, we randomly sample n
tweets from an author’s set of tweets. The exact implementation details and intuition is
explained in §3.3.
3.3</p>
      <p>Random Sampling of an Author’s Tweets
Intuition The intuition behind random sampling is that we do not know which of the
tweets from an author’s set of tweets are relevant for the classification task. So, at each
training epoch, if we randomly sample an author’s tweets to feed into the model, the
model will have the chance to look at enough of an author’s tweets to learn if the author
is a fake news spreader or not.</p>
      <p>Implementation While constructing a batch of samples to feed into the model, from
each author, randomly n tweets from the collection of 100 are selected. These are then
concatenated with special classification tokens as given in Figure 3. This chosen
collection of random tweets for each author is not fixed and is randomly chosen again at every
epoch. Therefore, tweets chosen in a previous epoch might get chosen again. We use
n = 14 so that the token limit is never exceeded even in edge cases where the tweets
might be longer.</p>
      <p>If T a is the set of tweets of an author a, t is a subset of randomly selected n tweets
from T a at the ith training epoch such that n jT aj, then Cia is the concatenation of
the tweets in t, where Cia is defined as</p>
      <p>Cia = &lt;S&gt; t1 &lt;\S&gt; t2::: &lt;\S&gt; tn 1 &lt;\S&gt; tn
(1)
Here is &lt;S&gt; and &lt;\S&gt; are special tokens defined in ELECTRA’s vocabulary as
CLS_TOKEN and SEP_TOKEN respectively. CLS_TOKEN marks sentences for
classification. SEP_TOKEN separates each tweet.
One obvious drawback of random sampling described in §3.2 is that looking at only a
small random portion of an author’s tweets may not enough to make a correct decision.
To mitigate this problem, we use an ensemble. Our proposed ensemble is built using 15
fine-tuned models each of which is built on top of a pre-trained ELECTRA model.</p>
      <p>Each model of the ensemble looks at a different random sample of an author’s tweets
and makes a prediction. The final prediction is determined by majority voting where the
label with the highest frequency is chosen as the final label for the task. This ensures that
a wide range of an author’s tweets is looked at before coming to a decision. Ensembling
also has the effect of lowering the variance of the model [16]. The architecture of the
models in the ensemble and the training routine is described below.</p>
      <p>Random Sampled and
Concateneted Tweets of an</p>
      <p>Author </p>
      <p>Pre-trained
ELECTRA</p>
      <p>Dense
Layer</p>
      <p>Softmax
Layer</p>
      <p>Model Architecture The ensemble is made of 15 fine-tuned models each of which is of
the architecture given in Figure 4. We use only 15 models because adding more does not
improve the ensemble [16]. In each model, 256-dimensional embeddings produced by
pre-trained ELECTRA are fed into a tanh-activated dense layer having 256 in-features
and 256 out-features. After applying a dropout of 0:1 on the output of the dense layer,
the output representation is fed into a sof tmax layer which makes the prediction. The
weights of the dense layer and sof tmax layer are randomly initialized in each of the
models of the ensemble.</p>
      <p>Separate ensembles were built for the two languages in the dataset, one
ensemble for English and one ensemble for Spanish. For English, we used the pre-trained
model called google/electra-small-discriminator from the HuggingFace Transformers
Library 4 [19]. Since no official pre-trained model was available for Spanish, we used
a pre-trained model called skimai/electra-small-spanish from HuggingFace community
models hub.</p>
      <p>
        Model Training and Inference The same training routine is applied to each of the
models in the ensemble. Each model is fine-tuned with a small learning rate of 1e 3
using a cross-entropy loss function for 20 epochs. 90% of the data is used as the train
set and the remaining 10% is used as the validation set. The percentage of each class is
preserved in both of these. Early stopping was used to stop training if validation
accuracy did not improve for 4 consecutive epochs. The model is optimized using Ranger
optimizer, which is a combination of LookAhead [20] and RAdam [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The ( ; k)
parameters of the optimizer are set to (0:5; 5). During both training and inference, the
random sampling approach described in §3.3 is used to feed data into the model. Data
4 https://huggingface.co
is fed into the models in batches of 50. As mentioned in §3.4, the final label is
determined by majority voting.
4
      </p>
    </sec>
    <sec id="sec-3">
      <title>Results</title>
      <p>1 2 3 4 5 6 7 8 9 10 11 12 13 14 15</p>
      <p>model</p>
      <p>
        The accuracy on the validation set of each model in the ensemble is plotted in
Figure 5. As apparent from the plot, the accuracy of each model in the ensemble varies
widely. This is expected since each model started off with different randomly
initialized weights and trained on randomly sampled data. The results obtained by running
the ELECTRA ensembles on the validation set and test set is given in Table 4. The
ensembles scored an accuracy of 0:70 and 0:69 on the English and Spanish test sets
respectively as given in Table 4. Both of the ensembles had almost the same accuracy
on the test set. The ensemble for English had a validation set accuracy of 0:87 while
the ensemble for Spanish had a validation set accuracy of 0:77. This suggests that the
ensembles suffered from over-fitting since there is a notable difference between the
validation and test set accuracy. Another explanation could be that random sampling did
not sample the relevant tweets for the classifier to be able to differentiate correctly.
This paper explored the application of ensembled ELECTRA models for the task of
Profiling Fake News Spreaders in Twitter. Random sampling was used in an attempt to
overcome the limitation of the max number of tokens supported by transformer models.
In future work, it would be interesting to explore transformer models that do no have
such limitations, for example the Longformer [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Also, the study did not make use of
the many features of the data. We found that the data had duplicates (see §2) that could
have been removed during preprocessing. This perhaps might have improved the
classifier’s performance by preventing duplicates from being sampled. Another promising
avenue for future work would to enhance the proposed classifier with emotional signals
from the text using lexicons such as EmoLex [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and SentiSense [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
14. Rangel, F., Rosso, P.: On the implications of the general data protection regulation on the
organisation of evaluation tasks. Language and Law= Linguagem e Direito 5(2), 95–117
(2019)
15. Rangel, F., Rosso, P., Ghanem, B., Giachanou, A.: Profiling fake news spreaders on twitter
(Feb 2020), https://doi.org/10.5281/zenodo.3692319
16. Risch, J., Krestel, R.: Bagging BERT models for robust aggression identification. In:
Proceedings of the Second Workshop on Trolling, Aggression and Cyberbullying. pp.
55–61. European Language Resources Association (ELRA), Marseille, France (May 2020),
https://www.aclweb.org/anthology/2020.trac-1.9
17. Shu, K., Wang, S., Liu, H.: Understanding user profiles on social media for fake news
detection. 2018 IEEE Conference on Multimedia Information Processing and Retrieval
(MIPR) pp. 430–435 (2018)
18. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L.,
      </p>
      <p>Polosukhin, I.: Attention is all you need (2017)
19. Wolf, T., Debut, L., Sanh, V., Chaumond, J., Delangue, C., Moi, A., Cistac, P., Rault, T.,
Louf, R., Funtowicz, M., Brew, J.: Huggingface’s transformers: State-of-the-art natural
language processing. ArXiv abs/1910.03771 (2019)
20. Zhang, M.R., Lucas, J., Hinton, G., Ba, J.: Lookahead optimizer: k steps forward, 1 step
back (2019)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. de Albornoz,
          <string-name>
            <given-names>J.C.</given-names>
            ,
            <surname>Plaza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Gervás</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          : Sentisense:
          <article-title>An easily scalable concept-based affective lexicon for sentiment analysis</article-title>
          .
          <source>In: LREC</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Beltagy</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peters</surname>
            ,
            <given-names>M.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cohan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Longformer: The long-document transformer</article-title>
          . arXiv:
          <year>2004</year>
          .
          <volume>05150</volume>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Luong</surname>
            ,
            <given-names>M.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>Q.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manning</surname>
          </string-name>
          , C.D.: Electra:
          <article-title>Pre-training text encoders as discriminators rather than generators (</article-title>
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Devlin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>M.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toutanova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding</article-title>
          .
          <source>In: NAACL-HLT</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Ghanem</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rangel</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>An emotional analysis of false information in social media and news articles</article-title>
          .
          <source>ACM Trans. Internet Technol</source>
          .
          <volume>20</volume>
          (
          <issue>2</issue>
          ) (
          <year>Apr 2020</year>
          ), https://doi.org/10.1145/3381750
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Giachanou</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Crestani</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Leveraging emotional signals for credibility detection</article-title>
          .
          <source>In: Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          . p.
          <fpage>877</fpage>
          -
          <lpage>880</lpage>
          . SIGIR'
          <volume>19</volume>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA (
          <year>2019</year>
          ), https://doi.org/10.1145/3331184.3331285
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jiang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>He</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>J</given-names>
            ., Han, J
          </string-name>
          .:
          <article-title>On the variance of the adaptive learning rate and beyond</article-title>
          . arXiv preprint arXiv:
          <year>1908</year>
          .
          <volume>03265</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ott</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goyal</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Du</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joshi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levy</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lewis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zettlemoyer</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stoyanov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Roberta: A robustly optimized bert pretraining approach (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Mohammad</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Turney</surname>
          </string-name>
          , P.D.:
          <article-title>Crowdsourcing a word-emotion association lexicon</article-title>
          .
          <source>ArXiv abs/1308</source>
          .6297 (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Popat</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mukherjee</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yates</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weikum</surname>
          </string-name>
          , G.:
          <article-title>DeClarE: Debunking fake news and false claims using evidence-aware deep learning</article-title>
          .
          <source>In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing</source>
          . pp.
          <fpage>22</fpage>
          -
          <lpage>32</lpage>
          . Association for Computational Linguistics, Brussels, Belgium (Oct-Nov
          <year>2018</year>
          ), https://www.aclweb.org/anthology/D18-1003
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gollub</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wiegmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>TIRA Integrated Research Architecture</article-title>
          . In: Ferro,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Peters</surname>
          </string-name>
          ,
          <string-name>
            <surname>C</surname>
          </string-name>
          . (eds.)
          <article-title>Information Retrieval Evaluation in a Changing World</article-title>
          . Springer (Sep
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Raffel</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shazeer</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roberts</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Narang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Matena</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          , Liu,
          <string-name>
            <surname>P.J.:</surname>
          </string-name>
          <article-title>Exploring the limits of transfer learning with a unified text-to-text transformer (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Rangel</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giachanou</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghanem</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Overview of the 8th Author Profiling Task at PAN 2020: Profiling Fake News Spreaders on Twitter</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Eickhoff</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Névéol</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <article-title>CLEF 2020 Labs and Workshops, Notebook Papers</article-title>
          .
          <source>CEUR-WS.org (Sep</source>
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>