<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>IIR</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Personalization in BERT with Adapter Modules and Topic Modelling</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Marco Braga</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessandro Raganato</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gabriella Pasi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Università degli Studi di Milano Bicocca, Dipartimento di Informatica, Sistemitstica e Comunicazione DISCo</institution>
          ,
          <addr-line>Viale Sarca 336, Milano</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>13</volume>
      <abstract>
        <p>As a result of the widespread use of intelligent assistants, personalization in dialogue systems has become a hot topic in both research and industry. Typically, training such systems is computationally expensive, especially when using recent large language models. To address this challenge, we develop an approach to personalize dialogue systems using adapter layers and topic modelling. Our implementation enables the model to incorporate user-specific information, achieving promising results by training only a small fraction of parameters.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Retrieval based chatbot</kwd>
        <kwd>Personalization</kwd>
        <kwd>Adapters</kwd>
        <kwd>Topic Modelling</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        As smart assistants become increasingly common in our daily lives, developing dialogue systems
is attracting considerable attention. Dialogue systems are being used in various settings, such
as customer services, e-commerce and healthcare, where personalized interactions can greatly
impact performances. Personalization can be seen as the ability of a system to customize its
responses based on a user’s past behaviour and on the context of the ongoing conversation.
Typically, such systems use pretrained large language model such as BERT [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], GPT [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and T5 [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
These models are developed following the pretrain-and-then-finetune paradigm, which involves
pretraining a neural model on very large amounts of raw text using a language model objective,
and then further fine-tuning it on task-specific data. Over the years, diferent approaches to
developing dialogue systems have been explored; for example, Han et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] fine-tune BERT for
dialogue response selection by applying a mechanism to let the model understand the coherence
between subsequent turns in a conversation, while Gu et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] personalize BERT adding
a speaker embedding to token representation, which includes information about the user’s
identity, to name a few. However, these methods are usually computationally expensive as they
involve training all neural network parameters. To address this drawback, we explore the use
of adapters [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], which are modules added between the layers of a pre-trained Transformer, to
inject personal information into a network. Our proposed implementation, which we call User
Adapter, receives a user embedding vector as external input allowing the encoding of personal
information into the model, resulting in improved performances and accuracy compared to
baseline adapters.
Training
Validation
Test
1M
196k
182k
202768
9374
9080
      </p>
      <p>In the following sections, we first give an overview of the benchmark used in this work,
then we describe the details of two extensions we propose, which are categorized into
nonpersonalized and personalized models. The non-personalized models aim to adapt BERT to
a dialogue system task; personalized models introduce user-related information into BERT,
obtained by applying topic modelling, through adapter layers. Finally, we present the results of
our evaluation with the conclusions and future work.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Ubuntu Dialogue Corpus</title>
      <p>
        Dialogue systems can be broadly grouped into two main categories: generation-based and
retrieval-based. Generation-based methods aim to create new text and generate responses
within a conversation, typically using an encoder-decoder framework [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Retrieval-based
methods, on the other hand, focus on selecting responses for single-turn conversations and are
often referred to as Next Utterance Classification. This approach involves predicting whether a
given utterance follows the previous dialogue or not, and can be seen as a binary classification
task. In this work, we focus on the latter setting. One of the most popular benchmark data sets
for retrieval-based dialogue systems is the Ubuntu Dialogue Corpus (UDC) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], which consists
of dyadic dialogues extracted from the Ubuntu support platform. Statistics about UDC are in
Table 1. Each sample of the dataset includes a dialogue history (the context), the next possible
utterance, the user who wrote it, and a flag indicating whether the utterance is the correct
sentence that follows the dialogue history. The context consists of multiple turns of dialogue,
where each turn represents a series of utterances exchanged between the participants in the
conversation. Given a dialogue, the task consists of selecting the correct next utterance across
10 possible candidates.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. The Proposed Approach</title>
      <p>In this section, we present the models we consider and evaluate, divided into non-personalized
baselines (Section 3.1), and personalized adapter models (Section 3.2). Moreover, in Section
3.3 we describe how we use topic modelling to obtain user embeddings, which are used to
incorporate personal information (i.e., user-related information) into a model.</p>
      <sec id="sec-3-1">
        <title>3.1. Baselines</title>
        <p>
          We use diferent baseline models based on BERT without any personalization component:
Finetuning (FT) and Task Adapter (TA). The first model, FT, is a fine-tuned version of BERT base
(12-layer, 768-hidden, 12-heads, 110M parameters) 1 on the Ubuntu Dialogue Corpus, which
requires retraining all 110 million parameters of BERT. TA models, instead, are based on the
adapter architecture, which is a lightweight approach to adapting pretrained language models
to a specific task. As described in [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] and shown in Figure 1, an adapter usually consists of
two feedforward layers: the first layer performs a down-projection to a lower intermediate
dimension, followed by a non-linear activation function (in our work RELU). Next, there is an
up-projection to the original dimension. The output of an adapter layer is the sum of the input
of the layer itself and the output of the up-projection layer. We test the considered models by
using diferent intermediate dimensions, which are the only hyperparameters that control the
adapter capacity, i.e. 128 and 256. It can be argued that training also the word embeddings layer
may lead to better performance overall, but with an additional cost of training more parameters.
Thus, we include this setting in our experiments. To make a comparison, all these experiments
follow the parameters reported in the original study [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], i.e. batch size of 32 and 3 epochs. To
ensure the convergence of models, as suggested by [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], the adapter weights are initialized with a
normal distribution having mean equal to zero and standard deviation of 0.02. This guarantees
that, during the initial training steps, adapter layers behave similarly to an identity function.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Personalized Models</title>
        <p>We propose three extensions of the previously described adapter layers to incorporate
userrelated information into BERT: i) Topic User Adapter (TUA), ii) Concatenation Topic User
Adapter (CTUA), and iii) Gate-based Topic User Adapter (GTUA). In our implementation, each
method receives an external vector that represents the user who wrote the utterance in input;
we describe how to encode the user vector in Section 3.3.</p>
        <p>Once we have obtained the user vector, we give it as input to a new down projection, making
it comparable to the dimensions of the BERT projected vector. Then, in TUA, we apply a
sum operation between the user and BERT vectors, resulting in a new vector that captures
the combined information. Then a RELU function is applied to obtain the final output. This
architecture is shown in Figure 1. TUA requires training only 0.1% more parameters than
adapters without personalization. In CTUA, instead, we combine the two vectors by appending
one to the end of the other, resulting in a vector whose length is twice the length of the projected
vectors. Finally, in GTUA, we use a gating function to weigh the user vector representation.
More formally, the output of the Gated Adapter is defined as ( (  +  ′) ′ +  )
where  ∈ R is the input to the adapter layer,  = 768 the intermediate dimension of BERT,
 ∈ R our user embedding with  that corresponds to the number of topics,  ∈ R′ and
 ′ ∈ R′ are matrices of BERT and user down projections respectively, ′ is the intermediate
dimension of the adapter and  is a sigmoid function. Since  takes values between 0 and 1,
if its value is high and near to one, user embeddings are contributing to the final predictions,
otherwise, if the value is near to zero, user embeddings have a small impact.
1https://huggingface.co/bert-base-uncased</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. User Embeddings</title>
        <p>
          We employ topic modelling to generate user vectors, specifically, we use the Latent Dirichlet
Allocation (LDA) [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] implementation from scikit-learn [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. Let’s denote by  the document
containing all dialogues in which a single user  engages. For each document  and topic
 , LDA returns a value  ( ,  ) between zero and one such that ∑︀ ∈{1,...,}  ( ,  ) = 1,
where  is the number of topics.  ( ,  ) represents how much the topic  characterizes
dialogues in which the user  participates. To optimize the performances of the LDA model,
we test diferent hyperparameters congfiurations in a small development set to find the best
number of topics between 10, 15, 20, 25, 30. Our analysis reveals that the best number of topics
is 10, which results in the best perplexity score. Our method produces a user embedding that
represents the user’s level of interest in diferent topics: each entry  ∈ {1, ..., } of the user 
vector corresponds to the value  ( , ) of the user’s association with the topic . For users
with a limited past conversation history, topic modelling assigns a vector whose entries are
all equal to 1/. We apply the same strategy to users in validation and test sets with no prior
context, as it is impossible to obtain their user embeddings without any previous conversations.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Evaluation</title>
      <p>
        We use the same evaluation metrics as in previous works [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ]: during testing, each model has to
select the  best answers from a set of  = 10 candidates with the same history context. There
is only one correct answer in the set of candidates. Then we calculate the Recall values @ of
the true positive utterances among the  selected responses. The value of  can be 1, 2 or 5. In
Table 2, we report the performances of our extended models. Even without personalization,
ifne-tuned remains the best model. This result is not unexpected: using adapters for transfer
learning can decrease the performance of fine-tuning. To our knowledge, no-one has tried
before to employ adapters in the next utterance classification task: we learn that our best Task
Adapter module decreases the performance of fine-tuning by 4% on @1 and @2, and by 1%
on @5. Compared to the GLUE [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] benchmark dataset, as reported by Houlsby et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ],
adapter layers attain within 0.4% of the performances of the fine-tuned model. Thus, adapters
perform worse on a next utterance classification task than on a Natural Language Understanding
Fine-Tuning
Task Adapter128
Task Adapter256
Task Adapter128
Task Adapter256
Topic User Adapter256
Concatenation Topic User Adapter256
Gate-based Topic User Adapter256
      </p>
      <p>Train Emb.</p>
      <p>Baselines
Yes
Yes
Yes
No
No
Personalized
No
No
No</p>
      <p>Trained Params.
task. From our results, the best intermediate size for the adapter is 256, which outperforms
dimension 128 by 1.7% on average. Training the word embeddings layer performs worse than
not training it, likely due to overfitting on train set. The performances of the personalized
models are comparable, the best model is TUA, which decreases performances of fine-tuning
by 1.3%, 1.0% and 0.51% on @1, @2 and @5 respectively, which is better than using
only Task Adapters. By using sum operation, when the user has no prior information, the
output vector of each adapter layer is like a non-personalized one. This approach allows for the
integration of personalized and non-personalized models, resulting in superior performances.
Personalization does not surpass fine-tuning performances, but it can still obtain better results
than training adapter without personalization by adding only 0.1% of total BERT weights.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions and Future Work</title>
      <p>In this paper, we achieve promising results in the Next Utterance Classification task by adding
personalization layers, surpassing the performances of using only task-specific adapters training
only 0.1% more parameters. However, this approach does not outperform fine-tuning, which
remains the most efective but also the most computationally expensive method. Our objective
is to apply personalized adapters to various tasks, including information retrieval and news
recommendation, which can benefit from personalization. Therefore, we aim to propose new
personalization techniques based on the attention mechanism rather than topic modelling. By
incorporating an attention mechanism in the adapter layer, we can represent the entire history of
user conversations through a Long Transformer embedding and give it as input to the attention
mechanism, allowing the model to determine the impact of past dialogues for classification.
Our goal is to improve fine-tuning performances with personalization without having to retrain
all parameters of a model, which is computationally expensive with Transformer architectures.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , BERT:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers),
          <source>Association for Computational Linguistics</source>
          , Minneapolis, Minnesota,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          . URL: https://aclanthology.org/ N19-1423. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N19</fpage>
          -1423.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Narasimhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Salimans</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Sutskever</surname>
          </string-name>
          ,
          <article-title>Improving language understanding by generative pre-training</article-title>
          . (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>C.</given-names>
            <surname>Rafel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Matena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <article-title>Exploring the limits of transfer learning with a unified text-to-text transformer</article-title>
          .,
          <source>The Journal of Machine Learning Research</source>
          (
          <year>2020</year>
          )
          <fpage>5485</fpage>
          -
          <lpage>5551</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Seo</surname>
          </string-name>
          ,
          <article-title>Fine-grained post-training for improving retrievalbased dialogue systems</article-title>
          .,
          <source>Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          (
          <year>2021</year>
          )
          <fpage>1549</fpage>
          -
          <lpage>1558</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.-C.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.-H.</given-names>
            <surname>Ling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <article-title>Speaker-aware bert for multi-turn response selection in retrieval-based chatbots</article-title>
          ,
          <source>Proceedings of the 29th ACM International Conference on Information and Knowledge Management</source>
          (
          <year>2020</year>
          ). URL: http://doi.acm.
          <source>org/ 10</source>
          .1145/3340531.3412330.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>N.</given-names>
            <surname>Houlsby</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Giurgiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jastrzebski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. d. L. Bruna</given-names>
            <surname>Morrone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gesmundo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Attariyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gelly</surname>
          </string-name>
          ,
          <article-title>Parameter-eficient transfer learning for nlp</article-title>
          .,
          <source>International Conference on Machine Learning</source>
          (
          <year>2019</year>
          )
          <fpage>2790</fpage>
          -
          <lpage>2799</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R.</given-names>
            <surname>Lowe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Pow</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Serban</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Pineau,</surname>
          </string-name>
          <article-title>The Ubuntu dialogue corpus: A large dataset for research in unstructured multi-turn dialogue systems</article-title>
          ,
          <source>in: Proceedings of the 16th Annual Meeting of the Special Interest Group on Discourse and Dialogue</source>
          , Association for Computational Linguistics, Prague, Czech Republic,
          <year>2015</year>
          , pp.
          <fpage>285</fpage>
          -
          <lpage>294</lpage>
          . URL: https: //aclanthology.org/W15-4640. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>W15</fpage>
          -4640.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>I.</given-names>
            <surname>Sutskever</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Vinyals</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <article-title>Sequence to sequence learning with neural networks</article-title>
          .,
          <source>Advances in neural information processing systems</source>
          ,
          <volume>27</volume>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D. M.</given-names>
            <surname>Blei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. I. Jordan</surname>
          </string-name>
          ,
          <article-title>Latent dirichlet allocation</article-title>
          .,
          <source>Journal of machine Learning research</source>
          (
          <year>2003</year>
          )
          <fpage>993</fpage>
          -
          <lpage>1022</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>F.</given-names>
            <surname>Pedregosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Varoquaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gramfort</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Michel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thirion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Grisel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Blondel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Prettenhofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Weiss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Dubourg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vanderplas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Passos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cournapeau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Perrot</surname>
          </string-name>
          , E. Duchesnay,
          <article-title>Scikit-learn: Machine learning in Python</article-title>
          ,
          <source>Journal of Machine Learning Research</source>
          <volume>12</volume>
          (
          <year>2011</year>
          )
          <fpage>2825</fpage>
          -
          <lpage>2830</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Michael</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Hill</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bowman</surname>
          </string-name>
          ,
          <article-title>Glue: A multi-task benchmark and analysis platform for natural language understanding</article-title>
          .,
          <source>Proceedings of the 2018 EMNLP Workshop BlackboxNLP: Analyzing and Interpreting Neural Networks for NLP</source>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>