<!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>Transferability of Natural Language Inference to Biomedical Question Answering</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>yul J</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>n Sung</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>ngwoo Kim</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Donghy</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>on Kim</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wonjin Yoon</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>hyo Yoo</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>woo K</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>AIR Lab, Hyundai Motor Company</institution>
          ,
          <addr-line>Seoul</addr-line>
          ,
          <country country="KR">Korea</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Computer Science and Engineering, Korea University</institution>
          ,
          <addr-line>Seoul</addr-line>
          ,
          <country country="KR">Korea</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Biomedical question answering (QA) is a challenging task due to the scarcity of data and the requirement of domain expertise. Pre-trained language models have been used to address these issues. Recently, learning relationships between sentence pairs has been proved to improve performance in general QA. In this paper, we focus on applying BioBERT to transfer the knowledge of natural language inference (NLI) to biomedical QA. We observe that BioBERT trained on the NLI dataset obtains better performance on Yes/No (+5.59%), Factoid (+0.53%), List type (+13.58%) questions compared to performance obtained in a previous challenge (BioASQ 7B Phase B). We present a sequential transfer learning method that signi cantly performed well in the 8th BioASQ Challenge (Phase B). In sequential transfer learning, the order in which tasks are ne-tuned is important. We measure an unanswerable rate of the extractive QA setting when the formats of factoid and list type questions are converted to the format of the Stanford Question Answering Dataset (SQuAD).</p>
      </abstract>
      <kwd-group>
        <kwd>Transfer Learning</kwd>
        <kwd>Domain Adaptation</kwd>
        <kwd>Natural Language</kwd>
        <kwd>Inference</kwd>
        <kwd>Biomedical Question Answering</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Biomedical question answering (QA) is a challenging task due to the limited
amount of data and the requirement of domain expertise. To address these issues,
pre-trained language models [
        <xref ref-type="bibr" rid="ref13 ref26">13, 26</xref>
        ] are used and further ne-tuned on a target
task [
        <xref ref-type="bibr" rid="ref19 ref2 ref20 ref31 ref32 ref36 ref4 ref7">2, 4, 7, 19, 20, 31, 32, 36</xref>
        ]. Although the pre-trained language models improve
performance on the target tasks, the models are still short of the upper-bound
performance in biomedical QA. Sequential transfer learning is based on transfer
learning and it is used to further improve biomedical QA performance [
        <xref ref-type="bibr" rid="ref2 ref20 ref36">2,20,36</xref>
        ].
For example, ne-tuning on both the SQuAD dataset [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] and the BioASQ
dataset [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ] results in higher performance than ne-tuning on only the BioASQ
dataset. In the general QA domain, learning relationships between sentence pairs
rst is e ective in sequential transfer learning [
        <xref ref-type="bibr" rid="ref11 ref27 ref34 ref35 ref4">4, 11, 27, 34, 35</xref>
        ]. Thus, in this
paper, we ne-tune the task of NLI [
        <xref ref-type="bibr" rid="ref1 ref10">1, 10</xref>
        ] to improve performance in biomedical
QA. We nd that performance improves when the objective function of the
netuned task becomes similar to the function of the downstream task. We also nd
that applying the NLI task to the biomedical QA task addresses task discrepancy.
Task discrepancy refers to the several di erences in the distribution of context
length, objective function, and domain shift between various ne-tuned tasks.
      </p>
      <p>
        Speci cally, we focus on reducing the discrepancy of context length
distribution between NLI and biomedical QA to improve sequential transfer learning
performance on the target task. To reduce the discrepancy, we only unify the
distributions of context length of the ne-tuned tasks. We reduce the SQuAD
context to a single sentence containing the ground truth answer spans [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ].
Finetuning on a uni ed distribution reduces the time to train and perform inference
on the BioASQ dataset by 52.95% and 25%, respectively. Finally, we measure an
unanswerable rate of the extractive QA setting when the format of the BioASQ
dataset is converted to the format of the SQuAD dataset.
      </p>
      <p>Our contributions are as follows:
(i) We show that ne-tuning on an NLI dataset is e ective in Yes/No, Factoid,
and List type questions in BioASQ dataset.
(ii) We demonstrate that unifying the distributions of context length between
ne-tuned tasks improves the sequential transfer learning performance of
biomedical QA.
(iii) In the Factoid and List type questions, we measure an unanswerable rate
of the extractive QA setting, when the format of the BioASQ dataset is
converted to that of the SQuAD dataset.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Works</title>
      <p>
        Transfer Learning Transfer learning, also known as domain adaptation, refers
to the situation of knowledge learned in a previous task to a subsequent task. In
various elds including image processing or natural language processing (NLP),
many studies have shown the e ectiveness of transfer learning based on deep
neural networks [
        <xref ref-type="bibr" rid="ref15 ref22 ref24 ref31 ref37">15, 22, 24, 31, 37</xref>
        ]. More recently, especially in NLP, pre-trained
language models such as ELMo [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ] and BERT [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] have been used for transfer
learning [
        <xref ref-type="bibr" rid="ref11 ref13 ref18 ref19 ref21 ref25 ref4">4, 11, 13, 18, 19, 21, 25</xref>
        ]. In the biomedical domain, unsupervised
pretraining has been used for biomedical contextualized representations [
        <xref ref-type="bibr" rid="ref16 ref20 ref9">9, 16, 20</xref>
        ].
BioBERT [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] was ne-tuned on biomedical corpora (e.g., PubMed and PubMed
Central) using BERT, and BioBERT can be employed for various tasks in the
biomedical or clinical domain [
        <xref ref-type="bibr" rid="ref16 ref17 ref25 ref36 ref8 ref9">8, 9, 16, 17, 25, 36</xref>
        ].
      </p>
      <sec id="sec-2-1">
        <title>Transferability of Natural Language Understanding The authors of [2]</title>
        <p>
          transferred the knowledge obtained from the SQuAD dataset to the target
BioASQ dataset to address the data scarcity issue. In [
          <xref ref-type="bibr" rid="ref20 ref36">20, 36</xref>
          ], the authors
adopted sequential transfer learning (e.g., BioBERT-SQuAD-BioASQ ) to
improve biomedical QA performance. Meanwhile, multiple NLI datasets have been
constructed for the general domain [
          <xref ref-type="bibr" rid="ref1 ref10 ref28 ref3 ref35">1, 3, 10, 28, 35</xref>
          ] and domain-speci c datasets
(e.g., biomedical) have recently been introduced [
          <xref ref-type="bibr" rid="ref25 ref30">25, 30</xref>
          ]. In [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], the authors have
found that ne-tuning on the MultiNLI (MNLI) dataset [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] consistently improves
performance on target tasks in terms of all the GLUE benchmarks [
          <xref ref-type="bibr" rid="ref35">35</xref>
          ]. The
authors of [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] have found that applying knowledge from the NLI dataset improves
performance on various yes and no type QA tasks in the general domain.
Furthermore, the authors of [
          <xref ref-type="bibr" rid="ref34">34</xref>
          ] have used various size datasets in question answering,
text classi cation/regression, and sequence labeling tasks. In this paper, we use
the MNLI dataset for improving performance in biomedical QA.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Methods</title>
      <p>In this section, we outline our problem setting for the downstream task. Our
training details are provided in the Appendix A. We explain our method of
learning biomedical entity representations using BioBERT. Then we describe
how to perform the sequential transfer learning of BioBERT for each
biomedical question type of the BioASQ Challenge. Our method can be used to apply
BioBERT, which was used for training NLI dataset, to biomedical QA.
3.1</p>
      <sec id="sec-3-1">
        <title>Problem Setting</title>
        <p>We converted the format of the BioASQ dataset to the format of the SQuAD
dataset. In detail, training instances in the BioASQ dataset are composed of
a question (Q), human-annotated answers (A), and relevant contexts (C) (also
called snippets). If the span of answers was not provided by human annotators,
we rst found exact spans in contexts based on human-annotated answers to
factoid and list type questions. In this case, we enumerated all the combinations
of Q-C-A triplets only when the answer span exactly matches the context. Yes
and No answers to Yes/No type questions are not suggested in contexts; thus,
we ne-tuned a task-speci c binary classi er to predict answers.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Overall Architecture</title>
        <p>Input sequence X consists of the concatenation of the BERT [CLS] token, Q,
and C, with [SEP] tokens in between Q and C. The sequence is denoted as X
= f[CLS] k Q k [SEP] k C k [SEP]g where k refers to the concatenation of
tensors. The hidden representation vector of the ith input token is denoted as
hi 2 RH where H denotes the hidden size. Finally, we ne-tuned the hidden
vectors corresponding to each question type, and the vectors were fed into a
softmax classi er or binary classi er.</p>
        <p>Yes/No Type For computing the yes probability P yes, we projected a linear
transformation matrix M 2 R1 H to transform the hidden representation of a
[CLS] token C 2 RH . In binary classi cation, the sigmoid function can be used
to calculate the yes probability as follows:
(1)
(2)
(3)
(4)
Factoid &amp; List type At hidden representation vectors, the start and end
vectors of answer spans were computed in one linear transformation matrix M 2
R2 H . Let us denote the ith and jth predicted answer tokens as start and end,
respectively. The probability of (Pistart; Pjend) can be calculated as follows:
Pi = Pistart k Piend =</p>
        <p>ehi M&gt;
Ps
t=1 eht M&gt;
; Pj = Pjstart k Pjend =</p>
        <p>ehj M&gt;
Ps
t=1 eht M&gt;
where s denotes the sequence length of BioBERT and is the dot-product. Our
objective function is the negative log-likelihood for the predicted answer with
the ground truth answer position. Start and end position losses are computed
as below:</p>
        <p>P yes =</p>
        <p>1
1 + e C M&gt;</p>
        <p>The binary cross entropy loss is utilized between the yes probability P yes
and its corresponding ground truth answer ayes. Our total loss is computed as
below.</p>
        <p>Loss =
(ayeslogP yes + (1
ayes)log(1</p>
        <p>P yes))
Lossstart =
1 XN logPasstart;n; Lossend =
N n=1
1 XN logPaeend;n
N n=1
where N denotes the batch size, and as and ae are the ground truth answers of
the start and end positions of each instance, respectively. Our total loss is the
arithmetic mean of Lossstart and Lossend.
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Transferability in domains and tasks</title>
        <p>
          Yes/No Type Training a model to classify relationships of sentence pairs can
enhance its performance on yes or no type questions in the general domain [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ].
Based on this nding, we believe that a classi er could be used for yes and no
type questions in biomedical QA. Thus, we ne-tuned BioBERT on the NLI
task so that it can be used to answer biomedical yes or no type questions. We
used the MNLI dataset because it is widely used and has a su cient amount of
data from various genres. Furthermore, as shown in Table 9 and 10, sequential
transfer learning models trained on the MNLI dataset obtained meaningful
results. For our learning sequence, we ne-tuned BioBERT on the MNLI dataset
which contains the relationships between hypothesis and premise sentences. We
composed a sequential transfer learning method, denoted as
BioBERT-MNLIBioASQ. However, using the nal layer of the MNLI task instead of the binary
classi er to compute P yes does not improve the performance of BioBERT on
the BioASQ dataset. For this reason, we added a simple binary classi er on the
top layer of BioBERT. Furthermore, the distributions of context length in the
MNLI dataset and the distributions of snippets of Yes/No type questions in
the BioASQ dataset are similar. Therefore, we did not unify the context length
distributions of yes and no type questions.
        </p>
        <p>
          Factoid &amp; List Type The order of sequential transfer learning is important
in bridging the gap between di erent tasks. Performance improves when the
objective function of the ne-tuned task becomes similar to that of the
downstream task in Table 5. Thus, we used the learning sequence
BioBERT-MNLISQuAD-BioASQ instead of BioBERT-SQuAD-MNLI-BioASQ. To address the
discrepancy of context length distribution between the SQuAD dataset and the
BioASQ dataset, we slightly modi ed the original experimental setting. As
suggested in [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ], we reorganized the context length distributions in the SQuAD
dataset which is similar to the MNLI dataset and BioASQ dataset. We
developed an extractive QA setting that is scalable to minimal context and that does
not use irrelevant sentences in full abstracts [
          <xref ref-type="bibr" rid="ref36">36</xref>
          ]. Therefore, we extracted a
sentence containing the ground truth answer span and set as a complete paragraph
to construct the minimal context. As a result, we reduced the discrepancy of
context length distribution by unifying the context length distributions for our
sequential transfer learning. Unifying the distributions of context length reduced
the time to train and perform inference on factoid and list type questions. Our
method achieved comparable results to those of the baseline method.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experiments</title>
      <p>4.1</p>
      <sec id="sec-4-1">
        <title>Datasets</title>
        <p>
          Our datasets are based on the pre-processed datasets provided by [
          <xref ref-type="bibr" rid="ref1 ref28 ref36">1, 28, 36</xref>
          ]. For
the extractive QA setting, we converted the BioASQ dataset format (Yes/No,
Factoid, and List type questions) to the format of the SQuAD dataset. In [
          <xref ref-type="bibr" rid="ref36">36</xref>
          ], the
authors suggested three pre-processing strategies, and for our study, we utilized
two of the three strategies: Snippet-as-is and Full-Abstract. However, we added
the criterion of having a blank space before and after each biomedical entity.
This criterion has shown to improve performance in distinguishing biomedical
named entities. The statistics of the pre-processed dataset are listed in Table 8.
We have made the pre-processed BioASQ datasets publicly available.3 In the
experimental setting, we removed approximately 5K training instances from the
SQuAD dataset because their answer spans do not exactly match the context.
        </p>
        <sec id="sec-4-1-1">
          <title>3 https://github.com/dmis-lab/bioasq8b</title>
          <p>Reference System</p>
          <p>
            Yes/No (Macro F1) Factoid (MRR) List (F1)
Dimitriadis &amp; Tsoumakas [
            <xref ref-type="bibr" rid="ref14">14</xref>
            ]
Hosein et al., [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ]
Oita et al., [
            <xref ref-type="bibr" rid="ref5">5</xref>
            ]
Resta et al., [
            <xref ref-type="bibr" rid="ref29">29</xref>
            ]
Telukuntla et al., [
            <xref ref-type="bibr" rid="ref6">6</xref>
            ]
Yoon et al., [
            <xref ref-type="bibr" rid="ref36">36</xref>
            ]
Ours
In Table 1, we compare our results with the best results from last year's BioASQ
Challenge Task 7B (Phase B) [5{7, 14, 29, 36]. From this comparison, we observe
that training BioBERT on the MNLI dataset signi cantly improves its
performance on the Yes/No (+5.59%), Factoid (+0.53%), and List (+13.58%) type
questions.
          </p>
          <p>Yes/No Type
# of Tasks Sequence of Transfer Learning
6B Test
7B Test</p>
          <p>BioBERT-SQuAD-BioASQ
BioBERT-MNLI-BioASQ
BioBERT-SQuAD-BioASQ
BioBERT-MNLI-BioASQ</p>
          <p>Evaluation Metric
Accuracy Yes F1 No F1</p>
          <p>Macro F1</p>
          <p>
            First, the Yes/No type question scores obtained by our method are shown
in Table 2. We observed that using the SQuAD dataset for intermediate
netuning improves performance [
            <xref ref-type="bibr" rid="ref2 ref20 ref36">2, 20, 36</xref>
            ]. Therefore, we evaluated our proposed
method of ne-tuning BioBERT using the sequence BioBERT-SQuAD-BioASQ,
as done in [
            <xref ref-type="bibr" rid="ref20 ref36">20, 36</xref>
            ]. BioBERT is trained on the SQuAD dataset for the QA task.
Fine-tuning BioBERT with the sequence BioBERT-MNLI-BioASQ signi cantly
improves its performance. BioBERT obtains higher macro F1 scores (+5.55%,
+2.65%) than the baseline. We believe selecting yes and no type questions in the
          </p>
          <p>Context Length Discrepancy
# of Tasks Setting</p>
          <p>Sequence of Transfer Learning</p>
          <p>BioASQ dataset is similar to deciding the relationship between sentence pairs in
the MNLI dataset. We also replaced the binary classi er of BioBERT, which is
trained on the BioASQ dataset, with the nal layer of the MNLI task, but this
did not improve performance. Thus, we ne-tuned the binary classi er to select
yes and no type questions.</p>
          <p>When using the factoid and list type questions in the MNLI dataset, we
considered the discrepancy of context length distributions. The obtained results
are shown in Table 3. In the original experimental setting, full documents in
the SQuAD dataset and snippets in the BioASQ dataset were used for training
BioBERT. The performance of our method on the 6B test set did not improve.
However, we observed that its performance improves with the size of the training
set, as shown by the higher performance on the 7B test set compared with that
on the 6B test set.</p>
          <p>In the document setting, we used the whole paragraphs and the full abstracts
of the SQuAD and BioASQ datasets, respectively. Performance obtained in this
setting is lower than that obtained in the original setting due to using longer
context rather than snippets in the BioASQ dataset. In other words, rather
than using the human annotated corpus (i.e., snippets), the search space in
which an answer can be found was expanded to full abstracts. Nevertheless, the
# of Batches
performance of our proposed method on the factoid type questions in the 7B
test set improved when BioBERT was ne-tuned on the SQuAD dataset.</p>
          <p>For the snippet setting, we unify the distributions of context length in the
extractive QA setting. Our method extracts the sentence containing the ground
truth answer span, i.e., the minimal context; the performance of our method on
the 6B &amp; 7B test sets signi cantly improved. We recognize that it is hard to
prove the generalization of our method because the test sets for the BioASQ
dataset are too small and the variance of performance is relatively high.
However, we demonstrate our superior performance by reducing the task discrepancy
of factoid type questions in 6B &amp; and 7B. Although, we have achieved better
performance of list type questions, reducing the discrepancy of context length
distribution does not signi cantly a ect. We believe that given the objective
function of list type questions, it needs further analyses to demonstrate the
generalization of sequential transfer learning with ne-tuning NLI dataset.
5</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Analysis</title>
      <sec id="sec-5-1">
        <title>Order of Sequential Transfer Learning The BioASQ Challenge Task 8B</title>
        <p>(Phase B) results are shown in Table 4. Each team was allowed to submit up
to ve systems with di erent combinations of features. The 8B ground truth
answers are not available so we could not use them for manually evaluating our
proposed method. Thus, we report the scores from the leaderboard.4</p>
        <p>In this ablation study, we explore the importance of the order of sequential
transfer learning. The results are shown in Table 5. We found that ne-tuning</p>
        <sec id="sec-5-1-1">
          <title>4 http://participants-area.bioasq.org/results/8b/phaseB/</title>
          <p>Order Importance
# of Tasks</p>
          <p>Sequence of Transfer Learning
BioBERT on the MNLI dataset improved its performance on factoid type
questions. On the other hand, its performance on list type questions improved when
the objective function of ne-tuned tasks was similar to that of the BioASQ
task. In other words, BioBERT needs to be ne-tuned on the SQuAD dataset
after ne-tuning it on the MNLI dataset.</p>
          <p>Type
7B Batch1
7B Batch2 7B Batch3 7B Batch4 7B Batch5
7B Total
Factoid 0.359 (14/39) 0.120 (3/25) 0.310 (9/29) 0.118 (4/34) 0.229 (8/35) 0.216 (35/162)
List</p>
          <p>0.083 (1/12) 0.235 (4/17) 0.200 (5/25) 0.136 (3/22) 0.500 (6/12) 0.204 (18/88)</p>
          <p>Unanswerable rate of the Extractive QA Setting So far, the experiments
were performed in the extractive QA setting. We manually analyzed di erences
between the answer span and the context of the human annotated corpus from
the BioASQ Challenge Task 7B (Phase B) test set. We used the test set instead
of the training set for measuring the unanswerable rate of the extractive QA
setting for the following two reasons. First, we wanted to measure the
upperbound performance of our proposed method. Second, the training and test data
of the BioASQ dataset are similar to those of the dataset from the previous year.
Table 6 shows the unanswerable rate of all batch results of the 7B test set which
contains only factoid and list type questions. We calculated the unanswerable
rate of the extractive QA setting using the rule Ground Truth Answer does
not exactly match the context of the Human Annotated Corpus (Snippet). The
rule applies to the following cases: no exact match, lowercase match, additional
phrase added, and di erent type of blank space between the exact answer and
snippet. In Table 7, we randomly sample such cases. Due to the lack of space,
we provide more examples of cases at our url 5. In here, we use the extractive
QA setting to measure the upper-bound performance of our method. We hope
our analysis is helpful in designing experimental settings.</p>
          <p>Limitations of the Supervised Setting
Type</p>
          <p>ID - Question - Context - Answer
ID: 5c531d8f7e3cb0e231000017
Question: What causes Bathing suit Ichthyosis(BSI)?</p>
          <p>Ground Truth Answer: transglutaminase-1 gene (TGM1) mutations</p>
        </sec>
        <sec id="sec-5-1-2">
          <title>Factoid Context: Bathing suit ichthyosis (BSI) is an uncommon phenotype classi ed as a minor</title>
          <p>variant of autosomal recessive congenital ichthyosis (ARCI). OBJECTIVES: We report a case of
BSI in a 3-year-old Tunisian girl with a novel mutation of the transglutaminase 1 gene (TGM1)
ID: 5c5214207e3cb0e231000003
Question: List potential reasons regarding why potentially important genes are ignored
Ground Truth Answer: Identi able chemical properties, Identi able physical properties,
Identi able biological properties, Knowledge about homologous genes from model organisms
Context: Here, we demonstrate that these di erences in attention can be explained, to a large
List extent, exclusively from a small set of identi able chemical, physical, and biological properties
of genes. Together with knowledge about homologous genes from model organisms, these
features allow us to accurately predict the number of publications on individual human
genes, the year of their rst report, the levels of funding awarded by the National Institutes
of Health (NIH), and the development of drugs against disease-associated genes.
In this work, we used natural language inference (NLI) as a rst step in
netuning BioBERT for biomedical question answering (QA). Training BioBERT
to classify relationships between sentence pairs improved its performance in
biomedical QA. We empirically demonstrated that ne-tuning BioBERT on the
NLI dataset improved its performance on the BioASQ dataset from the BioASQ
Challenge. We uni ed the distributions of context length to mitigate the
discrepancy between NLI and biomedical QA. Furthermore, the order of sequential
transfer learning is important when ne-tuning BioBERT. Finally, when
converting the format of the BioASQ dataset to the SQuAD format, we measured</p>
        </sec>
        <sec id="sec-5-1-3">
          <title>5 https://github.com/dmis-lab/bioasq8b/tree/master/human-eval</title>
          <p>the unanswerable rate of the extractive QA setting where an answer does not
exactly match the human annotated corpus.</p>
          <p>MNLI</p>
          <p>Original
SQuAD v1.1</p>
          <p>Original</p>
          <p>Snippet
SQuAD v2.0</p>
          <p>Original</p>
          <p>Train
392,702
Train
87,412
82,280
Train
130,319</p>
          <p>Dev
9,815
Dev
10,570
9,986
Dev
11,873
Type</p>
          <p>BioASQ</p>
          <p>Data Strategy</p>
          <p>6B 7B 8B</p>
          <p>Train Test Train Test Train Test
Yes/No Snippet-as-is
We use BioBERT as learning biomedical entity representation. We utilize a single
NVIDIA Titan RTX (24GB) GPU to ne-tune the sequence of transfer learning.
In MNLI task, we use hyperparameters suggested by Hugging Face.6 For
netuning, we select the batch size as 12, 24 and a learning rate is within range 1e-6
to 9e-6. In post-processing, we use the abbreviation resolution module called
Ab3P7 to remove the same answer appearance with a di erent form.</p>
        </sec>
        <sec id="sec-5-1-4">
          <title>6 https://github.com/huggingface/transformers/tree/master/examples/text</title>
          <p>classi cation</p>
        </sec>
        <sec id="sec-5-1-5">
          <title>7 https://github.com/ncbi-nlp/Ab3P</title>
          <p>MNLI
SNLI
90.04 68.96
SQuAD
MNLI
SNLI
89.90 73.44
92.75 75.88</p>
          <p>Accuracy Yes F1 No F1 Macro F1 SAcc LAcc MRR
Prec Recall F1
39.80 57.82 47.22 45.02 47.69 42.34
38.80 61.34 47.42 47.86 46.89 43.33</p>
          <p>Accuracy Yes F1 No F1 Macro F1 SAcc LAcc MRR
Prec Recall F1
81.67
84.32
78.53
67.29</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Williams</surname>
            et al.,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>A broad-coverage challenge corpus for sentence understanding through inference</article-title>
          .
          <source>In: Proceedings of the 2018 Conference of the NAACL: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Wiese</surname>
            et al.,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Neural domain adaptation for biomedical question answering</article-title>
          .
          <source>In: Proceedings of the 21st Conference on CoNLL</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Levesque</surname>
            et al.,
            <given-names>H.</given-names>
          </string-name>
          :
          <article-title>The winograd schema challenge</article-title>
          .
          <source>In: Thirteenth International Conference on the Principles of Knowledge Representation and Reasoning</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Phang</surname>
            et al.,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Sentence encoders on stilts: Supplementary training on intermediate labeled-data tasks</article-title>
          . arXiv preprint arXiv:
          <year>1811</year>
          .
          <volume>01088</volume>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Oita</surname>
            et al.,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Semantically corroborating neural attention for biomedical question answering</article-title>
          .
          <source>In: ECML PKDD</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Telukuntla</surname>
            et al.,
            <given-names>S.K.</given-names>
          </string-name>
          :
          <article-title>Uncc biomedical semantic question answering systems. bioasq: Task-7b, phase-b</article-title>
          .
          <source>In: ECML PKDD</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hosein</surname>
            et al.,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Measuring domain portability and errorpropagation in biomedical qa</article-title>
          . arXiv preprint arXiv:
          <year>1909</year>
          .
          <volume>09704</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Alsentzer</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Murphy</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boag</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weng</surname>
            ,
            <given-names>W.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jindi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Naumann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McDermott</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Publicly available clinical bert embeddings</article-title>
          .
          <source>In: Proceedings of the 2nd Clinical Natural Language Processing Workshop</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Beltagy</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lo</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cohan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Scibert: A pretrained language model for scienti c text</article-title>
          .
          <source>In: Proceedings of the 2019 Conference on EMNLP-IJCNLP</source>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Bowman</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Angeli</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Potts</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.D.:</given-names>
          </string-name>
          <article-title>A large annotated corpus for learning natural language inference</article-title>
          .
          <source>In: Proceedings of the 2015 Conference on EMNLP</source>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hou</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cui</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Che</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          , Liu,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <surname>X.</surname>
          </string-name>
          :
          <article-title>Recall and learn: Finetuning deep pretrained language models with less forgetting</article-title>
          . arXiv preprint arXiv:
          <year>2004</year>
          .
          <volume>12651</volume>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>M.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kwiatkowski</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , Collins,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Toutanova</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          :
          <article-title>Boolq: Exploring the surprising di culty of natural yes/no questions</article-title>
          .
          <source>In: Proceedings of the 2019 Conference of the NAACL: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers) (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Devlin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>M.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toutanova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding</article-title>
          .
          <source>In: Proceedings of the 2019 Conference of the NAACL: Human Language Technologies</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Dimitriadis</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tsoumakas</surname>
          </string-name>
          , G.:
          <article-title>Yes/no question answering in bioasq 2019</article-title>
          . In: ECML PKDD (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Howard</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ruder</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Universal language model ne-tuning for text classi cation</article-title>
          .
          <source>In: Proceedings of the 56th Annual Meeting of the ACL (Volume</source>
          <volume>1</volume>
          :
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Jin</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dhingra</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cohen</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Probing biomedical embeddings from language models</article-title>
          .
          <source>In: Proceedings of the 3rd Workshop on Evaluating Vector Space Representations for NLP</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>So</surname>
            ,
            <given-names>C.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jeon</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jeong</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Choi</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yoon</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sung</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kang</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A neural named entity recognition and multi-type normalization tool for biomedical text mining</article-title>
          .
          <source>IEEE Access</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patel</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poliak</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xia</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McCoy</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tenney</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ross</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Linzen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Van Durme</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          , et al.:
          <article-title>Probing what di erent nlp tasks teach machines about function word comprehension</article-title>
          .
          <source>In: Proceedings of the Eighth Joint Conference on Lexical and Computational Semantics (* SEM</source>
          <year>2019</year>
          )
          <article-title>(</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Lan</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goodman</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gimpel</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sharma</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Soricut</surname>
          </string-name>
          , R.: Albert:
          <article-title>A lite bert for self-supervised learning of language representations</article-title>
          . arXiv preprint arXiv:
          <year>1909</year>
          .
          <volume>11942</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yoon</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>So</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kang</surname>
          </string-name>
          , J.:
          <article-title>Biobert: a pre-trained biomedical language representation model for biomedical text mining</article-title>
          .
          <source>Bioinformatics</source>
          (Oxford, England) (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>N.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gardner</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Belinkov</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peters</surname>
            ,
            <given-names>M.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>N.A.</given-names>
          </string-name>
          :
          <article-title>Linguistic knowledge and transferability of contextual representations</article-title>
          .
          <source>In: Proceedings of the 2019 Conference of the NAACL: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers) (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Long</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jordan</surname>
            ,
            <given-names>M.I.</given-names>
          </string-name>
          :
          <article-title>Learning transferable features with deep adaptation networks</article-title>
          .
          <source>arXiv preprint arXiv:1502.02791</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Min</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhong</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Socher</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xiong</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>E cient and robust question answering from minimal context over documents</article-title>
          .
          <source>In: Proceedings of the 56th Annual Meeting of the ACL (Volume</source>
          <volume>1</volume>
          :
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Mou</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meng</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jin</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>How transferable are neural networks in nlp applications?</article-title>
          <source>In: Proceedings of the 2016 Conference on EMNLP</source>
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Peng</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Transfer learning in biomedical natural language processing: An evaluation of bert and elmo on ten benchmarking datasets</article-title>
          .
          <source>In: Proceedings of the 18th BioNLP Workshop and Shared Task</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Peters</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neumann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Iyyer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gardner</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zettlemoyer</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Deep contextualized word representations</article-title>
          .
          <source>In: Proceedings of the 2018 Conference of the NAACL: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27. Ra el, C.,
          <string-name>
            <surname>Shazeer</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roberts</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Narang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Matena</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          , Liu,
          <string-name>
            <surname>P.J.:</surname>
          </string-name>
          <article-title>Exploring the limits of transfer learning with a uni ed text-to-text transformer</article-title>
          . arXiv preprint arXiv:
          <year>1910</year>
          .
          <volume>10683</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Rajpurkar</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Zhang, J.,
          <string-name>
            <surname>Lopyrev</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liang</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : Squad:
          <volume>100</volume>
          ,000+
          <article-title>questions for machine comprehension of text</article-title>
          .
          <source>In: Proceedings of the 2016 Conference on EMNLP</source>
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Resta</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Arioli</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fagnani</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Attardi</surname>
          </string-name>
          , G.:
          <article-title>Transformer models for question answering at bioasq 2019</article-title>
          . In: ECML PKDD (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Romanov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shivade</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Lessons from natural language inference in the clinical domain</article-title>
          .
          <source>In: Proceedings of the 2018 Conference on EMNLP</source>
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Ruder</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Neural transfer learning for natural language processing</article-title>
          .
          <source>Ph.D. thesis</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Talmor</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berant</surname>
          </string-name>
          , J.:
          <article-title>Multiqa: An empirical investigation of generalization and transfer in reading comprehension</article-title>
          .
          <source>In: Proceedings of the 57th Annual Meeting of the ACL</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Tsatsaronis</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Balikas</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malakasiotis</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Partalas</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zschunke</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alvers</surname>
            ,
            <given-names>M.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weissenborn</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krithara</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Petridis</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Polychronopoulos</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , et al.:
          <article-title>An overview of the bioasq large-scale biomedical semantic indexing and question answering competition</article-title>
          .
          <source>BMC bioinformatics</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Vu</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Munkhdalai</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sordoni</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trischler</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mattarella-Micke</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maji</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Iyyer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Exploring and predicting transferability across nlp tasks</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Michael</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hill</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levy</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bowman</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Glue: A multitask 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>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>Yoon</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jeong</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kang</surname>
          </string-name>
          , J.:
          <article-title>Pre-trained language model for biomedical question answering</article-title>
          . arXiv preprint arXiv:
          <year>1909</year>
          .
          <volume>08229</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <surname>Yosinski</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clune</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lipson</surname>
          </string-name>
          , H.:
          <article-title>How transferable are features in deep neural networks?</article-title>
          <source>In: Advances in NIPS (2014) 85.95 89.45 85.40 78.67</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>