<!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>On the comparability of pre-trained language models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Matthias Aßenmacher Christian Heumann</string-name>
          <email>chris@stat.uni-muenchen.de</email>
          <email>matthias@stat.uni-muenchen.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Statistics Department of Statistics Ludwig-Maximilians-Universität Ludwig-Maximilians-Universität Munich</institution>
          ,
          <addr-line>Germany Munich</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p />
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Recent developments in unsupervised
representation learning have successfully
established the concept of transfer
learning in NLP. Instead of simply plugging
in static pre-trained representations,
endto-end trainable model architectures are
making better use of contextual
information through more intelligently designed
language modelling objectives. Along
with this, larger corpora are used for
selfsupervised pre-training of models which
are afterwards fine-tuned on supervised
tasks. Advances in parallel computing
made it possible to train these models with
growing capacities in the same or even in
shorter time than previously established
models. These developments
agglomerate in new state-of-the-art results being
revealed in an increasing frequency.
Nevertheless, we show that it is not possible to
completely disentangle the contributions
of the three driving forces to these
improvements.</p>
      <p>We provide a concise overview on several
large pre-trained language models, which
achieved state-of-the-art results on
different leaderboards in the last two years, and
compare them with respect to their use
of new architectures and resources. We
clarify where the differences between the
models are and attempt to gain some
insight into the single contributions of lexical
and computational improvements as well
as those of architectural changes. We do
not intend to quantify these contributions,
Copyright c 2020 for this paper by its authors. Use permitted
under Creative Commons License Attribution 4.0
International (CC BY 4.0)
but rather see our work as an overview in
order to identify potential starting points
for benchmark comparisons.
1</p>
    </sec>
    <sec id="sec-2">
      <title>Introduction</title>
      <p>
        For solving NLP tasks, most researchers turn to
using pre-trained word embeddings
        <xref ref-type="bibr" rid="ref2 ref24 ref27 ref5">(Mikolov et al.,
2013; Pennington et al., 2014; Bojanowski et al.,
2017)</xref>
        as a key component of their models. These
representations map each word of a sequence to a
real valued vector of fixed dimension. Drawbacks
of these kinds of externally learned features are
that they are (i) fixed, i.e. can not be adapted to a
specific domain they are used in, and (ii) context
independent, i.e. there’s only one embedding for a
word by which it is represented in any context.
More recently, transfer learning approaches, as for
example convolutional neural networks (CNNs)
pre-trained on ImageNet
        <xref ref-type="bibr" rid="ref14">(Krizhevsky et al., 2012)</xref>
        in computer vision, have entered the discussion.
Transfer learning in the NLP context means
pretraining a network with a self-supervised objective
on large amounts of plain text and fine-tuning its
weights afterwards on a task specific, labelled data
set. For a comprehensive overview on the current
state of transfer learning in NLP, we recommend
the excellent tutorial and blog post by Ruder et al.
(2019)1.
      </p>
      <p>
        With ULMFiT (Universal Language Model Fine
Tuning), Howard and Ruder (2018) proposed a
LSTM-based
        <xref ref-type="bibr" rid="ref10">(Hochreiter and Schmidhuber, 1997)</xref>
        approach for transfer learning in NLP using
AWDLSTMs
        <xref ref-type="bibr" rid="ref20">(Merity et al., 2017)</xref>
        . This model can be
characterised as unidirectional contextual, while a
bidirectionally contextual LSTM-based model was
presented in ELMo (Embeddings from Language
Models) by Peters et al. (2018).
      </p>
      <p>
        The bidirectionality in ELMo is achieved by using
1https://ruder.io/state-of-transfer-learning-in-nlp/
biLSTMs instead of AWD-LSTMs. On the other
hand, ULMFiT uses a more "pure" transfer
learning approach compared to ELMo, as the
ELMoembeddings are extracted from the pre-trained
model and are not fine-tuned in conjunction with
the weights of the task-specific architecture.
The OpenAI GPT
        <xref ref-type="bibr" rid="ref30 ref31">(Generative Pre-Training,
Radford et al., 2018)</xref>
        is a model which resembles the
characteristics of ULMFiT in two crucial points.
It is a unidirectional language model and it
allows stacking task specific layers on top after
pretraining, i.e. it is fully end-to-end trainable. The
major difference between them is the internal
architecture, where GPT uses a Transformer decoder
architecture
        <xref ref-type="bibr" rid="ref42">(Vaswani et al., 2017)</xref>
        .
      </p>
      <p>
        Instead of processing one input token at a time, like
recurrent architectures (LSTMs, GRUs) do,
Transformers process whole sequences all at once. This
is possible because they utilize a variant of the
Attention mechanism
        <xref ref-type="bibr" rid="ref1">(Bahdanau et al., 2014)</xref>
        , which
allows modelling dependencies without having to
feed the data to the model sequentially. At the same
time, GPT can be characterised as unidirectional
as it just takes into account the left side of the
context. Its successor OpenAI GPT2
        <xref ref-type="bibr" rid="ref32">(Radford et al.,
2019)</xref>
        possesses (despite some smaller architectural
changes) the same model architecture and thus can
also be termed as unidirectional contextual.
BERT
        <xref ref-type="bibr" rid="ref6">(Bidirectional Encoder Representations
from Transformers, Devlin et al., 2019)</xref>
        , and
consequently the other two BERT-based approaches
discussed here (Liu et al.,
        <xref ref-type="bibr" rid="ref17">2019; Lan et al., 2019</xref>
        ) as
well, differ from the GPT models by the fact that
they are bidirectional Transformer encoder models.
Devlin et al. (2019) proposed Masked Language
Modelling (MLM) as a special training objective
which allows the use of a bidirectional Transformer
encoder without compromising the language
modelling objective. XLNet
        <xref ref-type="bibr" rid="ref49">(Yang et al., 2019)</xref>
        on the
contrary relies on an objective which the authors
call Permutation Language Modelling (PLM) and
is also able to model a bidirectional context despite
being an auto-regressive model.
2
      </p>
    </sec>
    <sec id="sec-3">
      <title>Related work</title>
      <p>
        In their stimulating paper, Raffel et al. (2019) take
several steps in a similar direction by trying to
ensure comparability among different
Transformerbased models. They perform various experiments
with respect to the transfer learning ability of a
Transformer encoder-decoder architecture by
varying the pre-training objective (different variants
of denoising vs. language modelling), the
pretraining resources (their newly introduced C4
corpus vs. variants thereof) and the parameter size
(from 200M up to 11B). Especially, their idea of
introducing a new corpus and creating subsets
resembling previously used corpora like RealNews
        <xref ref-type="bibr" rid="ref50">(Zellers et al., 2019)</xref>
        or OpenWebText
        <xref ref-type="bibr" rid="ref40 ref8">(Gokaslan
and Cohen, 2019)</xref>
        is a promising approach in order
to ensure comparability.
      </p>
      <p>However, their experiments do not cover an
important point we are trying to address with our work:
Focussing on only one specific architecture does
not yield an answer to the question which
components explain the performance differences
between models where the overall architecture differs
(e.g. Attention-based vs. LSTM-based). Yang et al.
(2019) also address comparability to some extent
by performing an ablation study to compare their
XLNet explicitly to BERT. They train six different
XLNet-based models where they modify different
parts of their model in order to quantify how these
design choices influence performance. At the same
time they restrict themselves to an architecture of
the same size as BERT-BASE and use the same
amount of lexical resources for pre-training. Liu
et al. (2019) vary RoBERTa with respect to model
size and amount of pre-training resources in
order to perform an ablation study also aiming at
comparability to BERT. Lan et al. (2019) go one
step further with ALBERT by also comparing their
model to BERT with regard to run time as well as
width and depth of the model.</p>
      <p>Despite all these experiments are highly valuable
steps into the direction of better comparability,
there are still no clear guidelines on which
comparisons to perform in order to ensure a maximum
degree of comparability with respect to multiple
potentially influential factors at the same time.
3</p>
    </sec>
    <sec id="sec-4">
      <title>Materials and Methods</title>
      <p>First, we present the different corpora which were
utilised for pre-training the models and compare
them with respect to their size and their
accessibility (cf. Tab. 1). Subsequently, we will briefly
introduce benchmark data sets which the models
are commonly fine-tuned and evaluated on.
While conceptual differences between the
evaluated models have been addressed in the
introduction, the models will now be described in more
detail. This is driven by the intention to emphasise
differences beyond the obvious, conceptual ones.
3.1</p>
      <sec id="sec-4-1">
        <title>Pre-training corpora</title>
        <p>English Wikipedia Devlin et al. (2019) state that
they used data from the English Wikipedia and
provide a manual for crawling it, but no actual data
set. Their version encompassed around 2.5B words.
Wikipedia data sets are available in the Tensorflow
Datasets-module.</p>
        <p>CommonCrawl Among other resources, Yang
et al. (2019) used data from CommonCrawl.
Besides stating that they filtered out short or
lowquality content, no further information is given.
Since CommonCrawl is a dynamic database, which
is updated on a monthly base (and the extracted
amount of data always depends on the user) we can
not provide a word count for this source in Tab. 1.</p>
      </sec>
      <sec id="sec-4-2">
        <title>ClueWeb (Callan et al., 2009), Giga5 (Parker</title>
        <p>et al., 2011) The information about ClueWeb
and Giga5 is similarly sparse as for
CommonCrawl. ClueWeb was obtained by crawling 2.8M
web pages in 2012, Giga5 was crawled between
01/2009 and 12/2010.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>1B Word Benchmark2 (Chelba et al., 2013)</title>
      <p>This corpus, actually introduced as a benchmark
data set by Chelba et al. (2013), combines
multiple data sets from the EMNLP 2011 workshop on
Statistical Machine Translation. The authors
normalised and tokenized the corpus and performed
further pre-processing steps in dropping duplicate
sentences as well as discarding words with a count
below three. Additionally, they randomised the
ordering of the sentences in the corpus. This
constitutes a corpus with a vocabulary of 793.471 words
and a total word count of 829.250.940 words.</p>
    </sec>
    <sec id="sec-6">
      <title>BooksCorpus3 (Zhu et al., 2015) In 2015, Zhu</title>
      <p>
        et al. introduced the BooksCorpus, which is heavily
used for pre-training language models (cf. Tab. 1).
In their work, they used the BooksCorpus in order
to train a model for retrieving sentence similarity.
Overall, the corpus comprises 984.846.357 words
in 74.004.228 sentences obtained from analysing
11.038 books. They report a vocabulary consisting
of 1.316.420 unique words, making the corpus
lexically more diverse than the 1B Word Benchmark,
as it possesses a by 66% larger vocabulary whereas
having a word count which is only 19% higher.
2https://research.google/pubs/pub41880/
3https://yknzhu.wixsite.com/mbweb
Wikitext-103
        <xref ref-type="bibr" rid="ref21 ref22 ref23">(Merity et al., 2016a,b)</xref>
        The
authors emphasised the necessity for a new large scale
language modelling data set by stressing the
shortcomings of other corpora. They highlight the
occurrence of complete articles, which allows learning
long range dependencies, as one of the main
benefits of their corpus. This property is, according to
the authors, not given in the 1B Word Benchmark
as the sentence ordering is randomised there. With
a count of 103.227.021 tokens and a vocabulary
size of 267.735, it is about one eighth of the 1B
Word Benchmark’s size concerning token count
and about one third concerning the vocabulary size.
Note, that there is also the smaller Wikitext-2
corpus
        <xref ref-type="bibr" rid="ref21 ref22 ref23">(Merity et al., 2016c)</xref>
        available, which is a
subset of about 2% of the size of Wikitext-103.
      </p>
      <sec id="sec-6-1">
        <title>CC-News (Nagel, 2016) This corpus was pre</title>
        <p>
          sented and used by Liu et al. (2019). They used a
web crawler proposed by Hamborg et al. (2017) to
extract data from the CommonCrawl News data set
          <xref ref-type="bibr" rid="ref25">(Nagel, 2016)</xref>
          and obtained a data set similar to the
RealNews data set
          <xref ref-type="bibr" rid="ref50">(Zellers et al., 2019)</xref>
          .
        </p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>Stories4 (Trinh and Le, 2018) The authors built</title>
      <p>a specific subset of the CommonCrawl data based
on questions from common sense reasoning tasks.
They extracted nearly 1M documents, most of
which are taken from longer, coherent stories.</p>
      <sec id="sec-7-1">
        <title>WebText (Radford et al., 2019) This pre</title>
        <p>
          training corpus, obtained by creating "a new web
scrape which emphasised document quality"
          <xref ref-type="bibr" rid="ref32">(Radford et al., 2019)</xref>
          , is not publicly available.
        </p>
      </sec>
      <sec id="sec-7-2">
        <title>OpenWebText (Gokaslan and Cohen, 2019)</title>
        <p>As a reaction to Radford et al. (2019) not releasing
their pre-training corpus, Gokaslan and Cohen
(2019) started an initiative to emulate an
opensource version of the WebText corpus.</p>
        <p>It becomes obvious that there is a lot of
heterogeneity with respect to the observed combinations
of availability, quality and corpus size. Thus, we
can state that there is some lack of transparency
when it comes to the lexical resources used for
per-training. Especially, the missing standardised
availability of the BooksCorpus is problematic as
this corpus is heavily used for pre-training.</p>
        <p>4https://console.cloud.google.com/storage/browser/
commonsense-reasoning/reproduce/stories_corpus</p>
        <sec id="sec-7-2-1">
          <title>Corpora</title>
        </sec>
      </sec>
      <sec id="sec-7-3">
        <title>Benchmark data sets for fine-tuning</title>
        <p>
          GLUE5
          <xref ref-type="bibr" rid="ref46">(Wang et al., 2018)</xref>
          The General
Language Understanding Evaluation (GLUE)
benchmark is a freely available collection of nine data
sets on which models can be evaluated. It provides
a fixed train-dev-test split with held out labels for
the test set, as well as a leaderboard which displays
the top submissions and the current state-of-the-art
(SOTA). The relevant metric for the SOTA is an
aggregate measure of the nine single task metrics.
The benchmark includes two binary classification
tasks with single-sentence inputs
          <xref ref-type="bibr" rid="ref11 ref24 ref31 ref34 ref39 ref41 ref47">(CoLa [Warstadt
et al., 2018] and SST-2 [Socher et al., 2013])</xref>
          and
five binary classification tasks with inputs that
consist of sentence-pairs
          <xref ref-type="bibr" rid="ref11 ref13 ref2 ref20 ref31 ref34 ref38 ref41 ref46 ref47 ref48 ref7 ref9">(MRPC [Dolan and Brockett,
2005], QQP [Shankar et al., 2017], QNLI, RTE
and WNLI [all Wang et al., 2018])</xref>
          . The
remaining two tasks also take sentence-pairs as input but
have a multi-class classification objective with
either three
          <xref ref-type="bibr" rid="ref48">(MNLI [Williams et al., 2017])</xref>
          or five
classes
          <xref ref-type="bibr" rid="ref16">(STS-B [Cer et al., 2017])</xref>
          .
        </p>
        <p>
          SuperGLUE6
          <xref ref-type="bibr" rid="ref45">(Wang et al., 2019)</xref>
          As a reaction
to human baselines being surpassed by the top
ranked models, Wang et al. (2019) proposed a set
of benchmark data sets similar to, but, according
to the authors, more difficult than GLUE. It did not
make sense to include it as a part of our model
comparison, as (at the time of writing) only two of the
5https://gluebenchmark.com/
6https://super.gluebenchmark.com/
discussed models were evaluated on SuperGLUE.
        </p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>SQuAD7 (Rajpurkar et al., 2016, 2018) The</title>
      <p>Stanford Question Answering Dataset (SQuAD)
1.1 consists of 100.000+ questions explicitly
designed to be answerable by reading segments of
Wikipedia articles. The task is to correctly locate
the segment in the text which contains the answer.
A shortcoming is the omission of situations where
the question is not answerable by reading the
provided article. Rajpurkar et al. (2018) address this
problem in SQuAD 2.0 by adding 50.000
handcrafted unanswerable questions to SQuAD 1.1. The
authors provide a train and development set as well
as an official leaderboard. The test set is completely
held out, participants are required to upload their
models to CodaLab. The SQuAD 1.1 data is, in an
augmented form (QNLI), also part of GLUE.</p>
    </sec>
    <sec id="sec-9">
      <title>RACE8 (Lai et al., 2017) The Large-scale</title>
      <p>ReAding Comprehension Dataset From
Examinations (RACE) contains English exam
questions for Chinese students (middle/high
school). In most of the articles using RACE
for evaluation, it is described to be especially
challenging due to (i) the length of the passages,
(ii) the inclusion of reasoning questions and (iii)
the intentionally tricky design of the questions
in order to test a human’s ability in reading
comprehension. The data set can be subdivided
7https://rajpurkar.github.io/SQuAD-explorer/
8http://www.qizhexie.com/data/RACE_leaderboard.html
in RACE-M (middle school examination) and
RACE-H (high school examination) and comprises
a total of 97.687 questions on 27.933 passages of
text.
3.3</p>
      <sec id="sec-9-1">
        <title>Evaluated Models</title>
      </sec>
      <sec id="sec-9-2">
        <title>ULMFit (Howard and Ruder, 2018) The</title>
        <p>
          AWD-LSTMs in this architecture make use of
DropConnect
          <xref ref-type="bibr" rid="ref44">(Wan et al., 2013)</xref>
          for better
regularisation and apply averaged stochastic gradient
descent (ASGD) for optimization
          <xref ref-type="bibr" rid="ref29">(Polyak and
Juditsky, 1992)</xref>
          . The model consists of an
embedding layer followed by three LSTM layers with
a softmax classifier on top for pre-training. It is
complemented by a task specific final layer during
fine-tuning. The vocabulary size is limited to 30k
words as in Johnson and Zhang (2017).
        </p>
        <p>
          ULMFiT was not evaluated on GLUE, but on
several other data sets
          <xref ref-type="bibr" rid="ref19 ref37 ref43 ref52">(IMDb [Maas et al., 2011],
TREC-6 [Voorhees and Tice, 1999], Yelp-bi,
Yelpfull, AG’s news, DBpedia [all Zhang et al., 2015])</xref>
          .
        </p>
      </sec>
      <sec id="sec-9-3">
        <title>ELMo (Peters et al., 2018) Consisting of mul</title>
        <p>
          tiple biLSTM layers, one can extract multiple
intermediate-layer representations from ELMo.
These representations are used for computing a
(task-specific) weighted combination, which is
concatenated with external, static word
embeddings. During the training of the downstream
model, ELMo embeddings are not updated, only
the weights for combining them are. For the GLUE
benchmark there are multiple ELMo-based
architectures available on the leaderboard. In Tab. 3, we
report the best-performing model, an ELMo-based
BiLSTM-model with Attention
          <xref ref-type="bibr" rid="ref46">(Wang et al., 2018)</xref>
          .
        </p>
      </sec>
      <sec id="sec-9-4">
        <title>OpenAI GPT (Radford et al., 2018) The Open</title>
        <p>
          AI GPT is a pure attention-based architecture that
does not make use of any recurrent layers.
Pretraining is performed by combining Byte-Pair
encoded
          <xref ref-type="bibr" rid="ref37">(Sennrich et al., 2015)</xref>
          token embeddings
with learned position embeddings, feeding them
into a multi-layer transformer decoder architecture
with a standard language modelling objective.
Finetuning was, amongst others, performed on the nine
tasks that together form the GLUE benchmark.
        </p>
      </sec>
      <sec id="sec-9-5">
        <title>BERT (Devlin et al., 2019) BERT can be seen</title>
        <p>
          as a reference point for everything that came
thereafter. Similar to GPT it uses Byte-Pair
Encoding (BPE) with a vocabulary size of 30k. By
introducing the MLM objective, the authors were
able to combine deep bidirectionality with
SelfAttention for the first time. Additionally, BERT
also utilizes the next-sentence prediction (NSP)
objective, the usefulness of which has been debated
in other research papers
          <xref ref-type="bibr" rid="ref18">(Liu et al., 2019)</xref>
          . The
BERT-BASE model consists of 12 bidirectional
transformer-encoder blocks (24 for BERT-LARGE)
with 12 (16 respectively) attention heads per block
and an embedding size of 768 (1024 respectively).
OpenAI GPT2
          <xref ref-type="bibr" rid="ref32">(Radford et al., 2019)</xref>
          Compared to its predecessor GPT, it contains some
smaller changes concerning the placement of layer
normalisation and residual connections. Overall,
there are four different versions of GPT2 with the
smallest one being equal to GPT, the medium one
being of similar size as BERT-LARGE and the
xlarge one being released as the actual GPT2 model
with 1.5B parameters.
        </p>
        <p>
          XLNet
          <xref ref-type="bibr" rid="ref49">(Yang et al., 2019)</xref>
          In order to overcome
(what they call) the pretraining-finetune
discrepancy, which is a consequence of BERT’s MLM
objective, and to simultaneously include
bidirectional contexts, Yang et al. (2019) propose the PLM
objective . They use two-stream self-attention for
preserving the position information of the token to
be predicted, which would otherwise be lost due
to the permutation. While the content stream
attention resembles the standard Self-Attention in
a transformer-decoder, the query stream attention
doesn’t allow the token to see itself but just the
preceding tokens of the permuted sequence.
RoBERTa
          <xref ref-type="bibr" rid="ref18">(Liu et al., 2019)</xref>
          With RoBERTa
(Robustly optimized BERT approach), Liu et al.
(2019) introduce a replicate of BERT with tuned
hyperparameters and a larger corpus used for
pretraining. The masking strategy is changed from
static (once during pre-processing) to dynamic
(every sequence just before feeding it to the model),
the additional NSP objective is removed, the BPE
vocabulary is increased to 50k and training is
performed on larger batches than BERT. These
adjustments improve performance of the model and make
it competitive to the performance of XLNet.
        </p>
      </sec>
      <sec id="sec-9-6">
        <title>ALBERT (Lan et al., 2019) By identifying that</title>
        <p>the increase of the model size is a problem,
ALBERT (A Lite BERT) goes into another
direction compared to most of post-BERT architectures.
Parameter-reduction techniques are applied in
order to train a faster model with lower memory
demands that, at the same time, yields a comparable</p>
        <p>NA
30 days
4 days
4 days
NA</p>
        <sec id="sec-9-6-1">
          <title>7 days 2.5 days</title>
          <p>NA |</p>
          <p>1 day 
NA
performance to SOTA models. We will always
refer to the best performing ALBERT-XXLARGE,
despite also the smaller ALBERT models yield
results comparable to BERT.
4</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-10">
      <title>Model comparison</title>
      <p>Tab. 2 gives an overview on the amount of
computational power needed to pre-train a given
architecture on given pre-training (lexical) resources. In
Tab. 3 we will directly try to relate model
architecture and size as well as usage of lexical resources
to model performance.</p>
      <p>
        One thing we can learn from Tab. 2 is the lack of
details when it comes to reporting the computational
resources used for pre-training. While Howard and
Ruder (2018) do not provide any information on
the computational power utilised for pre-training,
the other articles report it to different degrees.
Unfortunately, there are no clear guidelines on how
to appraise this when it comes to evaluating and
comparing models. This may be attributed to the
rapidly growing availability of hardware, but in
our opinion it should nevertheless be accounted for,
since it might pose environmental issues
        <xref ref-type="bibr" rid="ref40">(Strubell
et al., 2019)</xref>
        and also limits portability to smaller
devices.
      </p>
      <p>Further, it is important to consider the
differences displayed in the Tab. 2 and Tab. 3 when
comparing the model performances.
Considering two models of approximately the same size
(BERT-BASE vs. GPT), the superior performance
of BERT-BASE seems to originate purely from its
more elaborated architecture because of the similar
size. But one should also be aware of the larger
lexical resources (BERT-BASE uses at least twice
as much data for pre-training) and the unknown
differences in usage of computational power. We
approximated the latter as the pfs-days (cf. Tab. 2),
resulting in an estimation for BERT-BASE being
not less than the one for GPT.</p>
      <p>Another aspect which should not be ignored when
evaluating performance is ensembling. As can be
seen in the first column of Tab. 3, the three model
ensembles outperform both of the BERT models
by a large margin. Only parts of these differences
may be attributed to the model architecture or the
hyperparameter settings, as the ensembling as well
as the larger pre-training resources might give an</p>
      <sec id="sec-10-1">
        <title>Model</title>
      </sec>
      <sec id="sec-10-2">
        <title>BERT-BASE</title>
      </sec>
      <sec id="sec-10-3">
        <title>ELMo-based</title>
        <p>GPT
BERT-LARGE
XLNet-BASE
XLNet-LARGE
RoBERTa
RoBERTa-BASE
RoBERTa z
ALBERT</p>
        <p>Resources
leaderboard
dev~
v1.1 (dev)
v2.0 (dev)
test
#parameters
lexical
78.3
- 8.3
- 5.5
+ 2.2
–
+ 10.1 }
+ 10.2 }
–
–
+ 11.1 }
–
advantage to these models. As there are no
performance values of single models available for
XLNet, RoBERTa and ALBERT on the official GLUE
leaderboard, we also compare the single model
performances from Lan et al. (2019) obtained on the
dev sets. From this comparison we get an
impression of how high the contribution of ensembling
might be: The difference between BERT-LARGE
and the XLNet ensemble in the official score (7.9
%pts) is more than twice as high as the difference
in dev score (3.4 %pts).</p>
        <p>In order to address the differences in size of the
pre-training resources, Yang et al. (2019) make the
extremely insightful effort to compare a
XLNetBASE variant to BERT-BASE using the same
pretraining resources. While the F1 score on SQuAD
v2.0 is still remarkably higher than for
BERTBASE (comparable to BERT-LARGE) it does not
show a large improvement on RACE (which might
have been expected due to the large improvement
of XLNet-LARGE over both BERT models).
The comparability of RoBERTa from the GLUE
leaderboard (ensemble + larger pre-training
resources) to BERT-LARGE is limited, but the
authors perform several experiments in order to show
the usefulness of their optimisations. Pre-training
a single model on comparable lexical resources
(13GB for BERT vs. 16GB for RoBERTa), the
RoBERTa model shows a smaller (compared to
the RoBERTa ensemble), but still remarkable,
improvement over BERT-LARGE. In another ablation
study, Liu et al. (2019) train a RoBERTa-BASE
variant on larger pre-training resources. Even
though comprising only about one third of the size
of BERT-LARGE, the larger pre-training corpus in
conjunction with the optimised training leads to a
slightly better performance on the GLUE dev set.
We are not able to compare RoBERTa-BASE to
BERT-BASE, as neither the "official" leaderboard
score for RoBERTa-BASE nor the "inofficial" dev
set score for BERT-BASE are available.</p>
        <p>In order to set the results of ULMFiT into
context, we present the results published by Yang
et al. (2019) alongside with information on size
and pre-training resources in Tab. 4. Despite
being much larger and pre-training on some
orders of magnitude larger corpora, BERT-LARGE
and XLNet-LARGE do not exhibit that large
improvements over the performance of ULMFiT. This
might partly originate from the relative
simplicity of the tasks, but partly also from the already
achieved high performances.
This chapter reflects the main takeaways from the
above comparisons and raises some issues for
research practices. We do not claim to have a solution
to these potentially problematic aspects, but rather
think that these points are highly debatable.</p>
        <sec id="sec-10-3-1">
          <title>Why no benchmark corpus for pre-training?</title>
          <p>
            It is good practice to use benchmark data sets for
comparing the performance of pre-trained language
models on different types of Natural language
understanding (NLU) tasks. Many recently published
articles (Liu et al.,
            <xref ref-type="bibr" rid="ref17">2019; Yang et al., 2019</xref>
            ; Lan
et al., 2019) perform (partly extensive) ablation
studies controlling for pre-training resources in
order to make (versions of) their models comparable
to BERT, which is really important as it helps to
get an intuition for the impact of pre-training
resources. Nevertheless, it is unfortunately not
perfect due to two critical issues: (i) BERT and all of
its successors make use of the BooksCorpus
            <xref ref-type="bibr" rid="ref53">(Zhu
et al., 2015)</xref>
            which is not publicly available and
(ii) this only leads to model comparisons in a low
pre-training resource environment (compared to
more recent models) and yields no insight on the
behaviour of the reference model (e.g. BERT) in
a medium or high resource context. So we view
statements of the type "Model architecture A is
superior to model architecture B on performing task
X." somewhat critical and propose to phrase it more
like the following statement: "Model architecture A
is superior to model architecture B on performing
task X, when pre-trained on a small/medium/large
corpus of low/high quality data from domain Y for
pre-training time Z."
Why no standardised description of
(computational) resources? When writing this article, it
turned out difficult to get one unified measure for
the amount of the computational power used for
pre-training. In our opinion, this is not a
carelessness of the authors but rather the lack of a clear
reporting standard. We found ourselves confronted
with the following situations:
a) No information at all (Radford et al.,
            <xref ref-type="bibr" rid="ref17">2019)
b) Hardware (Liu et al., 2019</xref>
            ; Lan et al., 2019)
c) Hardware and training time (Devlin et al.,
2019; Yang et al., 2019)
          </p>
        </sec>
      </sec>
      <sec id="sec-10-4">
        <title>d) Standardised measure (Radford, 2018)</title>
        <p>While a) is clearly unsatisfactory and should be
avoided, b) and c) provide most of the necessary
information but miss out on going the last final step
to d), where the reporting reaches universal
comparability across different articles. The measure we
computed (cf. Tab. 2) is of course not as exact as
a computation based on the counts of operations
in a network, but requires no deep insight into the
model architecture and is thus applicable to a wide
range of architectures without much effort.
Shouldn’t performance be evaluated in relation
to size and resource usage? As larger models
have a higher capacity for learning representations
and using larger pre-training resources should
improve their quality, varying these two components
simultaneously with the model architecture might
lead to interference between the individual effects
on model performance. This aspect has a slight
overlap with the question raised above, but while
the above is more or less about introducing some
reference, this is about carefully varying and
evaluating the effects of different model parts.
6</p>
      </sec>
    </sec>
    <sec id="sec-11">
      <title>Conclusion</title>
      <p>
        As can be seen from the above analysis, there is a
lack of a concise guideline for fair comparisons of
large pre-trained language models. It is not
sufficient to just rank models by their performance on
the common benchmark data sets as this does not
take into account all the other factors mentioned
in this analysis. Further aspects worth reporting
are the use of resources (time and compute) spent
on model development (including all experimental
runs and trials) and hyperparameter tuning during
pre-training. In our opinion, this is important with
respect to two facets: On the one hand side it is
important to take into account environmental
considerations when training deep learning models
        <xref ref-type="bibr" rid="ref40">(Strubell et al., 2019)</xref>
        , on the other hand side it is
also a signal to the reader/user how difficult it is
to train (and to fine-tune) the model. This might
have implications for the usage of a model as
transfer learning model for diverse downstream tasks.
Models that have already been tuned to a high
degree during pre-training to reach a certain level of
performance, may have, in the long run, less
potential for further improvements compared to models
which do so without much hyperparameter tuning.
To conclude, we unfortunately cannot say with
determination which one of the influential factors
(architecture or amount of pre-training resources)
is more important, but we think that a
substantial amount of the recent improvements can be
attributed to larger pre-training resources. A detailed
disentanglement of the influence of the different
components stays an open research question which
might be answerable by carefully designed
benchmark studies.
      </p>
    </sec>
    <sec id="sec-12">
      <title>Acknowledgments</title>
      <p>We would like to thank the three anonymous
reviewers for their insightful comments and their
feedback on our work.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Dzmitry</given-names>
            <surname>Bahdanau</surname>
          </string-name>
          , Kyunghyun Cho, and
          <string-name>
            <given-names>Yoshua</given-names>
            <surname>Bengio</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Neural machine translation by jointly learning to align and translate</article-title>
          .
          <source>arXiv preprint arXiv:1409</source>
          .
          <fpage>0473</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Piotr</given-names>
            <surname>Bojanowski</surname>
          </string-name>
          , Edouard Grave, Armand Joulin, and
          <string-name>
            <given-names>Tomas</given-names>
            <surname>Mikolov</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Enriching word vectors with subword information</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          ,
          <volume>5</volume>
          :
          <fpage>135</fpage>
          -
          <lpage>146</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Jamie</given-names>
            <surname>Callan</surname>
          </string-name>
          , Mark Hoy, Changkuk Yoo, and
          <string-name>
            <given-names>Le</given-names>
            <surname>Zhao</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Clueweb09 data set</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <article-title>task 1: Semantic textual similarity-multilingual and cross-lingual focused evaluation</article-title>
          .
          <source>arXiv preprint arXiv:1708</source>
          .
          <fpage>00055</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Ciprian</given-names>
            <surname>Chelba</surname>
          </string-name>
          , Tomas Mikolov, Mike Schuster, Qi Ge, Thorsten Brants, Phillipp Koehn, and
          <string-name>
            <given-names>Tony</given-names>
            <surname>Robinson</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>One billion word benchmark for measuring progress in statistical language modeling</article-title>
          .
          <source>arXiv preprint arXiv:1312</source>
          .
          <fpage>3005</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Jacob</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <surname>Ming-Wei</surname>
            <given-names>Chang</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Kenton</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Kristina</given-names>
            <surname>Toutanova</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>BERT: 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), pages
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          , Minneapolis, Minnesota. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>William B Dolan and Chris Brockett</surname>
          </string-name>
          .
          <year>2005</year>
          .
          <article-title>Automatically constructing a corpus of sentential paraphrases</article-title>
          .
          <source>In Proceedings of the Third International Workshop on Paraphrasing (IWP2005).</source>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Aaron</given-names>
            <surname>Gokaslan</surname>
          </string-name>
          and
          <string-name>
            <given-names>Vanya</given-names>
            <surname>Cohen</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Openwebtext corpus</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Felix</given-names>
            <surname>Hamborg</surname>
          </string-name>
          , Norman Meuschke, Corinna Breitinger, and
          <string-name>
            <given-names>Bela</given-names>
            <surname>Gipp</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>News-please: a generic news crawler and extractor</article-title>
          .
          <source>In 15th International Symposium of Information Science (ISI</source>
          <year>2017</year>
          ), pages
          <fpage>218</fpage>
          -
          <lpage>223</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>Sepp</given-names>
            <surname>Hochreiter</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jürgen</given-names>
            <surname>Schmidhuber</surname>
          </string-name>
          .
          <year>1997</year>
          .
          <article-title>Long short-term memory</article-title>
          .
          <source>Neural computation</source>
          ,
          <volume>9</volume>
          (
          <issue>8</issue>
          ):
          <fpage>1735</fpage>
          -
          <lpage>1780</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Jeremy</given-names>
            <surname>Howard</surname>
          </string-name>
          and
          <string-name>
            <given-names>Sebastian</given-names>
            <surname>Ruder</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Universal language model fine-tuning for text classification</article-title>
          . arXiv preprint arXiv:
          <year>1801</year>
          .06146.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>Rie</given-names>
            <surname>Johnson</surname>
          </string-name>
          and Tong Zhang.
          <year>2016</year>
          .
          <article-title>Convolutional neural networks for text categorization: Shallow word-level vs. deep character-level</article-title>
          .
          <source>arXiv preprint arXiv:1609</source>
          .
          <fpage>00718</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Rie</given-names>
            <surname>Johnson</surname>
          </string-name>
          and Tong Zhang.
          <year>2017</year>
          .
          <article-title>Deep pyramid convolutional neural networks for text categorization</article-title>
          .
          <source>In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</source>
          , pages
          <fpage>562</fpage>
          -
          <lpage>570</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <given-names>Alex</given-names>
            <surname>Krizhevsky</surname>
          </string-name>
          , Ilya Sutskever, and
          <string-name>
            <given-names>Geoffrey E</given-names>
            <surname>Hinton</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Imagenet classification with deep convolutional neural networks</article-title>
          .
          <source>In Advances in neural information processing systems</source>
          , pages
          <fpage>1097</fpage>
          -
          <lpage>1105</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <given-names>Guokun</given-names>
            <surname>Lai</surname>
          </string-name>
          , Qizhe Xie, Hanxiao Liu,
          <string-name>
            <given-names>Yiming</given-names>
            <surname>Yang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Eduard</given-names>
            <surname>Hovy</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Race: Large-scale reading comprehension dataset from examinations</article-title>
          .
          <source>arXiv preprint arXiv:1704</source>
          .
          <fpage>04683</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <given-names>Daniel</given-names>
            <surname>Cer</surname>
          </string-name>
          , Mona Diab, Eneko Agirre, Inigo LopezGazpio, and
          <string-name>
            <given-names>Lucia</given-names>
            <surname>Specia</surname>
          </string-name>
          .
          <year>2017</year>
          . Semeval-2017
          <string-name>
            <given-names>Zhenzhong</given-names>
            <surname>Lan</surname>
          </string-name>
          , Mingda Chen,
          <string-name>
            <given-names>Sebastian</given-names>
            <surname>Goodman</surname>
          </string-name>
          , Kevin Gimpel, Piyush Sharma, and Radu Soricut.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          2019.
          <article-title>Albert: A lite bert for self-supervised learning of language representations</article-title>
          . arXiv preprint arXiv:
          <year>1909</year>
          .11942.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <given-names>Yinhan</given-names>
            <surname>Liu</surname>
          </string-name>
          , Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen,
          <string-name>
            <surname>Omer Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Mike</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Luke</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Veselin</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Roberta: A robustly optimized bert pretraining approach</article-title>
          . arXiv preprint arXiv:
          <year>1907</year>
          .11692.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <string-name>
            <surname>Andrew L Maas</surname>
          </string-name>
          , Raymond E Daly,
          <string-name>
            <surname>Peter T Pham</surname>
            , Dan Huang, Andrew Y Ng, and
            <given-names>Christopher</given-names>
          </string-name>
          <string-name>
            <surname>Potts</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Learning word vectors for sentiment analysis</article-title>
          .
          <source>In Proceedings of the 49th annual</source>
          <article-title>meeting of the association for computational linguistics: Human language technologies</article-title>
          -volume
          <volume>1</volume>
          , pages
          <fpage>142</fpage>
          -
          <lpage>150</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Merity</surname>
          </string-name>
          , Nitish Shirish Keskar, and Richard Socher.
          <year>2017</year>
          .
          <article-title>Regularizing and optimizing lstm language models</article-title>
          .
          <source>arXiv preprint arXiv:1708</source>
          .
          <fpage>02182</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Merity</surname>
          </string-name>
          , Caiming Xiong, James Bradbury, and Richard Socher. 2016a.
          <article-title>Pointer sentinel mixture models</article-title>
          .
          <source>arXiv preprint arXiv:1609</source>
          .
          <fpage>07843</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Merity</surname>
          </string-name>
          , Caiming Xiong, James Bradbury, and Richard Socher. 2016b. Wikitext-
          <volume>103</volume>
          . Accessed:
          <fpage>2020</fpage>
          -02-10.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Merity</surname>
          </string-name>
          , Caiming Xiong, James Bradbury, and Richard Socher.
          <source>2016c. Wikitext-2</source>
          . Accessed:
          <fpage>2020</fpage>
          -02-10.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          <string-name>
            <given-names>Tomas</given-names>
            <surname>Mikolov</surname>
          </string-name>
          , Kai Chen, Greg Corrado, and
          <string-name>
            <given-names>Jeffrey</given-names>
            <surname>Dean</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Efficient estimation of word representations in vector space</article-title>
          .
          <source>arXiv preprint arXiv:1301</source>
          .
          <fpage>3781</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          <string-name>
            <given-names>Sebastian</given-names>
            <surname>Nagel</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Cc-news.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          <string-name>
            <given-names>Robert</given-names>
            <surname>Parker</surname>
          </string-name>
          , David Graff,
          <string-name>
            <given-names>Junbo</given-names>
            <surname>Kong</surname>
          </string-name>
          , Ke Chen, and
          <string-name>
            <given-names>Kazuaki</given-names>
            <surname>Maeda</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>English gigaword fifth edition, june</article-title>
          .
          <source>Linguistic Data Consortium, LDC2011T07</source>
          ,
          <fpage>12</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          <string-name>
            <surname>Jeffrey</surname>
            <given-names>Pennington</given-names>
          </string-name>
          , Richard Socher, and
          <string-name>
            <given-names>Christopher</given-names>
            <surname>Manning</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Glove: Global vectors for word representation</article-title>
          .
          <source>In Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP)</source>
          , pages
          <fpage>1532</fpage>
          -
          <lpage>1543</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          <string-name>
            <surname>Matthew E Peters</surname>
            , Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark,
            <given-names>Kenton</given-names>
          </string-name>
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>and Luke</given-names>
          </string-name>
          <string-name>
            <surname>Zettlemoyer</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Deep contextualized word representations</article-title>
          .
          <source>arXiv preprint arXiv:1802</source>
          .05365.
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          <string-name>
            <surname>Boris T Polyak</surname>
          </string-name>
          and
          <string-name>
            <surname>Anatoli B Juditsky</surname>
          </string-name>
          .
          <year>1992</year>
          .
          <article-title>Acceleration of stochastic approximation by averaging</article-title>
          .
          <source>SIAM Journal on Control and Optimization</source>
          ,
          <volume>30</volume>
          (
          <issue>4</issue>
          ):
          <fpage>838</fpage>
          -
          <lpage>855</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          <string-name>
            <given-names>Alec</given-names>
            <surname>Radford</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Improving language understanding with unsupervised learning</article-title>
          .
          <source>Accessed: 2020-02- 10.</source>
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          <string-name>
            <given-names>Alec</given-names>
            <surname>Radford</surname>
          </string-name>
          , Karthik Narasimhan, Tim Salimans, and
          <string-name>
            <given-names>Ilya</given-names>
            <surname>Sutskever</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Improving language understanding by generative pre-training</article-title>
          .
          <source>URL https://s3-us-west-2</source>
          . amazonaws. com/openaiassets/researchcovers/languageunsupervised/language understanding paper.
          <source>pdf.</source>
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          <string-name>
            <given-names>Alec</given-names>
            <surname>Radford</surname>
          </string-name>
          , Jeffrey Wu, Rewon Child, David Luan,
          <string-name>
            <given-names>Dario</given-names>
            <surname>Amodei</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Ilya</given-names>
            <surname>Sutskever</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Language models are unsupervised multitask learners</article-title>
          .
          <source>OpenAI Blog</source>
          ,
          <volume>1</volume>
          (
          <issue>8</issue>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          <string-name>
            <given-names>Colin</given-names>
            <surname>Raffel</surname>
          </string-name>
          , Noam Shazeer, Adam Roberts,
          <string-name>
            <given-names>Katherine</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Sharan</given-names>
            <surname>Narang</surname>
          </string-name>
          , Michael Matena,
          <string-name>
            <surname>Yanqi Zhou</surname>
            ,
            <given-names>Wei</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
          </string-name>
          , and
          <string-name>
            <surname>Peter J Liu</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Exploring the limits of transfer learning with a unified text-to-text transformer</article-title>
          . arXiv preprint arXiv:
          <year>1910</year>
          .10683.
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          <string-name>
            <given-names>Pranav</given-names>
            <surname>Rajpurkar</surname>
          </string-name>
          , Robin Jia, and
          <string-name>
            <given-names>Percy</given-names>
            <surname>Liang</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Know what you don't know: Unanswerable questions for squad</article-title>
          . arXiv preprint arXiv:
          <year>1806</year>
          .03822.
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          <string-name>
            <given-names>Pranav</given-names>
            <surname>Rajpurkar</surname>
          </string-name>
          , Jian Zhang, Konstantin Lopyrev, and
          <string-name>
            <given-names>Percy</given-names>
            <surname>Liang</surname>
          </string-name>
          .
          <year>2016</year>
          . Squad:
          <volume>100</volume>
          ,000+
          <article-title>questions for machine comprehension of text</article-title>
          .
          <source>arXiv preprint arXiv:1606</source>
          .
          <fpage>05250</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          <string-name>
            <given-names>Sebastian</given-names>
            <surname>Ruder</surname>
          </string-name>
          , Matthew E. Peters, Swabha Swayamdipta, and
          <string-name>
            <given-names>Thomas</given-names>
            <surname>Wolf</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Transfer learning in natural language processing</article-title>
          .
          <source>In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Tutorials</source>
          , pages
          <fpage>15</fpage>
          -
          <lpage>18</lpage>
          , Minneapolis, Minnesota. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          <string-name>
            <given-names>Rico</given-names>
            <surname>Sennrich</surname>
          </string-name>
          , Barry Haddow, and
          <string-name>
            <given-names>Alexandra</given-names>
            <surname>Birch</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Neural machine translation of rare words with subword units</article-title>
          .
          <source>arXiv preprint arXiv:1508</source>
          .
          <fpage>07909</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          <string-name>
            <given-names>Iyer</given-names>
            <surname>Shankar</surname>
          </string-name>
          , Dandekar Nikhil, and
          <string-name>
            <given-names>Csernai</given-names>
            <surname>Kornél</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>First quora dataset release: Question pairs</article-title>
          .
          <source>Accessed: 2020-02-10.</source>
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          <string-name>
            <given-names>Richard</given-names>
            <surname>Socher</surname>
          </string-name>
          , Alex Perelygin, Jean Wu, Jason Chuang,
          <string-name>
            <surname>Christopher D Manning</surname>
            ,
            <given-names>Andrew</given-names>
          </string-name>
          <string-name>
            <surname>Ng</surname>
            , and
            <given-names>Christopher</given-names>
          </string-name>
          <string-name>
            <surname>Potts</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Recursive deep models for semantic compositionality over a sentiment treebank</article-title>
          .
          <source>In Proceedings of the 2013 conference on empirical methods in natural language processing</source>
          , pages
          <fpage>1631</fpage>
          -
          <lpage>1642</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          <string-name>
            <given-names>Emma</given-names>
            <surname>Strubell</surname>
          </string-name>
          , Ananya Ganesh, and
          <string-name>
            <surname>Andrew McCallum</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Energy and policy considerations for deep learning in nlp</article-title>
          . arXiv preprint arXiv:
          <year>1906</year>
          .02243.
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          <string-name>
            <surname>Trieu H Trinh and Quoc V Le</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>A simple method for commonsense reasoning</article-title>
          . arXiv preprint arXiv:
          <year>1806</year>
          .02847.
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          <string-name>
            <given-names>Ashish</given-names>
            <surname>Vaswani</surname>
          </string-name>
          , Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez,
          <string-name>
            <surname>Łukasz Kaiser</surname>
            , and
            <given-names>Illia</given-names>
          </string-name>
          <string-name>
            <surname>Polosukhin</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Attention is all you need</article-title>
          .
          <source>In Advances in neural information processing systems</source>
          , pages
          <fpage>5998</fpage>
          -
          <lpage>6008</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          <string-name>
            <surname>Ellen M Voorhees and Dawn M Tice</surname>
          </string-name>
          .
          <year>1999</year>
          .
          <article-title>The trec-8 question answering track evaluation</article-title>
          .
          <source>In TREC</source>
          , volume
          <year>1999</year>
          , page 82. Citeseer.
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          <string-name>
            <given-names>Li</given-names>
            <surname>Wan</surname>
          </string-name>
          , Matthew Zeiler, Sixin Zhang, Yann Le Cun, and
          <string-name>
            <given-names>Rob</given-names>
            <surname>Fergus</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Regularization of neural networks using dropconnect</article-title>
          .
          <source>In International conference on machine learning</source>
          , pages
          <fpage>1058</fpage>
          -
          <lpage>1066</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          <string-name>
            <given-names>Alex</given-names>
            <surname>Wang</surname>
          </string-name>
          , Yada Pruksachatkun, Nikita Nangia, Amanpreet Singh,
          <string-name>
            <surname>Julian Michael</surname>
          </string-name>
          , Felix Hill,
          <string-name>
            <given-names>Omer Levy</given-names>
            , and
            <surname>Samuel R Bowman</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Superglue: A stickier benchmark for general-purpose language understanding systems</article-title>
          . arXiv preprint arXiv:
          <year>1905</year>
          .00537.
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          <string-name>
            <given-names>Alex</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Amanpreet</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <surname>Julian Michael</surname>
          </string-name>
          , Felix Hill,
          <string-name>
            <surname>Omer Levy</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Samuel</given-names>
            <surname>Bowman</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>GLUE: A multi-task benchmark and analysis platform for natural language understanding</article-title>
          .
          <source>In Proceedings of the 2018 EMNLP Workshop BlackboxNLP: Analyzing and Interpreting Neural Networks for NLP</source>
          , pages
          <fpage>353</fpage>
          -
          <lpage>355</lpage>
          , Brussels, Belgium. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          <string-name>
            <given-names>Alex</given-names>
            <surname>Warstadt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Amanpreet</given-names>
            <surname>Singh</surname>
          </string-name>
          , and
          <string-name>
            <surname>Samuel R Bowman</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Neural network acceptability judgments</article-title>
          . arXiv preprint arXiv:
          <year>1805</year>
          .12471.
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          <string-name>
            <given-names>Adina</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Nikita</given-names>
            <surname>Nangia</surname>
          </string-name>
          , and
          <string-name>
            <surname>Samuel R Bowman</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>A broad-coverage challenge corpus for sentence understanding through inference</article-title>
          .
          <source>arXiv preprint arXiv:1704</source>
          .
          <fpage>05426</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref49">
        <mixed-citation>
          <string-name>
            <given-names>Zhilin</given-names>
            <surname>Yang</surname>
          </string-name>
          , Zihang Dai, Yiming Yang, Jaime Carbonell, Ruslan Salakhutdinov, and
          <string-name>
            <surname>Quoc</surname>
            <given-names>V</given-names>
          </string-name>
          <string-name>
            <surname>Le</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Xlnet: Generalized autoregressive pretraining for language understanding</article-title>
          . arXiv preprint arXiv:
          <year>1906</year>
          .08237.
        </mixed-citation>
      </ref>
      <ref id="ref50">
        <mixed-citation>
          <string-name>
            <given-names>Rowan</given-names>
            <surname>Zellers</surname>
          </string-name>
          , Ari Holtzman, Hannah Rashkin, Yonatan Bisk, Ali Farhadi, Franziska Roesner, and
          <string-name>
            <given-names>Yejin</given-names>
            <surname>Choi</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Defending against neural fake news</article-title>
          . arXiv preprint arXiv:
          <year>1905</year>
          .12616.
        </mixed-citation>
      </ref>
      <ref id="ref51">
        <mixed-citation>
          <string-name>
            <given-names>Shuailiang</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Hai Zhao,
          <string-name>
            <surname>Yuwei Wu</surname>
            , Zhuosheng Zhang, Xi Zhou, and
            <given-names>Xiang</given-names>
          </string-name>
          <string-name>
            <surname>Zhou</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Dual comatching network for multi-choice reading comprehension</article-title>
          . arXiv preprint arXiv:
          <year>1901</year>
          .09381.
        </mixed-citation>
      </ref>
      <ref id="ref52">
        <mixed-citation>
          <string-name>
            <given-names>Xiang</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <source>Junbo Zhao, and Yann LeCun</source>
          .
          <year>2015</year>
          .
          <article-title>Character-level convolutional networks for text classification</article-title>
          .
          <source>In Advances in neural information processing systems</source>
          , pages
          <fpage>649</fpage>
          -
          <lpage>657</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref53">
        <mixed-citation>
          <string-name>
            <given-names>Yukun</given-names>
            <surname>Zhu</surname>
          </string-name>
          , Ryan Kiros, Rich Zemel, Ruslan Salakhutdinov, Raquel Urtasun, Antonio Torralba, and
          <string-name>
            <given-names>Sanja</given-names>
            <surname>Fidler</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Aligning books and movies: Towards story-like visual explanations by watching movies and reading books</article-title>
          .
          <source>In Proceedings of the IEEE international conference on computer vision</source>
          , pages
          <fpage>19</fpage>
          -
          <lpage>27</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>