<!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>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Gut Instincts: Transformer-Based Extraction of Structured Data from Gut-Brain Axis Publications</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Lasse Ryge Andersen</string-name>
          <email>lasse2507a@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mikkel Hagerup Dolmer</string-name>
          <email>mikkel@dolmer.dk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marius Ihlen Gardshodn</string-name>
          <email>marius@gardshodn.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Juan Manuel Rodriguez</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Daniele Dell'Aglio</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Workshop</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Biomedical Information Extraction</institution>
          ,
          <addr-line>Gut-Brain Axis, Natural Language Processing</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Computer Science, Aalborg University</institution>
          ,
          <addr-line>Aalborg</addr-line>
          ,
          <country country="DK">Denmark</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper presents the proposed solution by our team, Gut-Instincts, for the GutBrainIE task, which introduces a named-entity recognition (NER) subtask and three relation extraction (RE) subtasks on biomedical articles related to the gut-brain axis. To address the domain-specific terminology involved in the tasks, we rely on biomedical pretrained transformer-based models. For NER, we extend these with three diferent classification heads: (1) a dense layer, (2) a dense layer followed by a conditional random field (CRF), or (3) a bidirectional long short-term memory layer followed by a CRF. For RE, we introduce negative samples and experiment with diferent ratios between positive and negative samples. For all subtasks, we use model ensembling to reduce variability and improve robustness. Furthermore, since the provided dataset is of diferent quality levels, we use weighted training that enables the models to utilize all available data, while ensuring that high-quality data has a stronger influence during optimization. Our experimental results suggest that a large ratio of negative to positive samples, model ensembling, and weighted training improve performance in the NER and RE subtasks. In the GutBrainIE task, we placed second in the NER subtask (6.1) with an F1micro score of 0.8382, and first place in all three RE subtasks 6.2.1, 6.2.2, and 6.2.3 with F1micro scores of 0.6864, 0.6866, and 0.4635, respectively.</p>
      </abstract>
      <kwd-group>
        <kwd>Axis Publications</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In recent years, there has been a surge of research on the gut-brain axis, which refers to the intricate
relationship between the gut and the brain. Once thought to afect only digestion, the gut microbiome
is now recognized as a key component in neurological and mental health conditions [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Studies have
revealed that imbalances in gut bacteria are linked to a range of conditions, including Alzheimer’s
disease, Parkinson’s disease, anxiety, and depression [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        As research in this domain intensifies, the volume of biomedical literature on the gut-brain axis has
grown rapidly, presenting new challenges for researchers to keep up with the latest developments [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
A recent analysis [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] revealed that PubMed has surpassed 37 million citations, with 1.6 million added
in the past year alone. This makes it increasingly dificult to manually curate relevant findings. In
response, there is an increased focus on developing information extraction systems that can support
experts by automatically extracting and linking knowledge from scientific literature [
        <xref ref-type="bibr" rid="ref3 ref5 ref6 ref7 ref8">3, 5, 6, 7, 8</xref>
        ].
      </p>
      <p>
        To support research on the gut-brain axis, the GutBrainIE task [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] is introduced, which is part of
the BioASQ workshop [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. The goal of the workshop is to “improve state-of-the-art methods from
information retrieval, machine learning, natural language processing, and text mining”1 for biomedical
documents. In particular, the GutBrainIE task focuses on analyzing articles related to the gut-brain axis.
To achieve this, the task presents four subtasks:
†These authors contributed equally.
      </p>
      <p>CEUR</p>
      <p>ceur-ws.org
• Subtask 6.1 - Named-entity recognition (NER): Classify specific text spans, referred to as
entities, according to 13 predefined labels.
• Subtask 6.2 - Relation extraction (RE): Classify relations between entities through three
distinct subtasks:
– Subtask 6.2.1 - Binary tag-based RE (BT-RE): Identify which entity labels are related.
– Subtask 6.2.2 - Ternary tag-based RE (TT-RE): Identify which entity labels are related
and classify each relation according to 17 predefined labels.
– Subtask 6.2.3 - Ternary mention-based RE (TM-RE): Identify which of the entities are
involved in relations and classify each relation according to the 17 predefined labels.</p>
      <p>
        When developing information extraction systems, a major cost is annotating the training dataset.
According to Lawson et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], the average cost of annotating entities in email datasets ranges from
$0.08 to $0.22 per document using Amazon Mechanical Turk. However, this approach is not appropriate
when annotating biomedical documents, as annotators need specialized domain knowledge to accurately
perform the task.
      </p>
      <p>Due to the high costs of annotating data and the expertise required to do so in the biomedical domain,
it is often necessary to balance annotation quality with scalability. As a result, datasets of varying
annotation quality are commonly created to support development. In this task, four datasets of diferent
quality levels are provided:
• Platinum dataset: 111 articles with expert-curated annotations reviewed by external biomedical
specialists.
• Gold dataset: 208 articles with expert-curated annotations.
• Silver dataset: 499 articles with annotations generated by trained students under expert
supervision.</p>
      <p>• Bronze dataset: 749 articles with automatically generated annotations, using fine-tuned models.
Additionally, the task also includes held-out development and test datasets, each consisting of 40 articles
of the gold and platinum qualities.</p>
      <p>
        As a result, the GutBrainIE task presents a wide range of obstacles. Firstly, biomedical articles
are rich in specialized vocabulary, laden with ambiguous abbreviations, and often exhibit irregular
grammar [
        <xref ref-type="bibr" rid="ref12 ref5">12, 5</xref>
        ]. As a result, general-domain language models are inefective in this domain. Secondly,
the training dataset has diferent quality annotations. Disregarding low-quality annotations reduces the
size of the training set, which might lead to overfitting and not covering all the relevant cases. However,
using the total amount of data without considering the quality could introduce too much noise in the
training process.
      </p>
      <p>
        This paper presents the proposed solution by our team, Gut-Instincts, for addressing the tasks of the
GutBrainIE task. Our approach is an information extraction pipeline that uses ensembles of specialized
models, built by extending well-known language models that have been pretrained on biomedical
corpora [
        <xref ref-type="bibr" rid="ref12 ref5 ref6">5, 6, 12</xref>
        ]. We train each model using the provided datasets with a weighting scheme that
reflects their quality, allowing for greater emphasis on higher-quality samples while still leveraging
information from lower-quality samples. Our solution is available on GitHub2.
      </p>
      <p>Our experiments show that the proposed solution performs well across all four tasks. This is further
supported by the oficial results in the GutBrainIE task, where our best NER ensemble resulted in second
place for the NER subtask (6.1) with an F1micro score of 0.8382 and our best RE ensembles achieved
ifrst place in the RE subtasks 6.2.1, 6.2.2, and 6.2.3 with F1micro scores of 0.6864, 0.6866, and 0.4635,
respectively.</p>
      <p>This paper is structured as follows: In Section 2, we introduce related work on NER and RE in the
biomedical domain. In Section 3, we explore and analyze the training datasets to uncover insights that
are key in the development of our approach. In Section 4, we describe our approach to ensembling
specialized models as well as the approach to training with a weighting scheme. In Section 5, we present
2https://github.com/P10-Natural-Language-Processing/Gut-Instincts
the experimental evaluation and key results for the final selection of the configurations of the models.
Finally, in Section 6, we conclude the paper, presenting takeaways and open challenges.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Since the introduction of BERT [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], transformer-based models have been the state-of-the-art technique
for natural language processing. However, applying these advancements directly to biomedical
information extraction yields unsatisfactory results due to a diference in vocabulary from general domain
corpora to biomedical corpora [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Therefore, methods for pretraining and fine-tuning
transformerbased models to perform specific tasks in the biomedical domain have been investigated [
        <xref ref-type="bibr" rid="ref12 ref14 ref15 ref5 ref6">14, 5, 12, 6, 15</xref>
        ].
One of the earliest models developed for this purpose is BioBERT [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], which extends BERT by further
pretraining it on biomedical corpora. BioBERT outperforms the original BERT on many biomedical
tasks.
      </p>
      <p>
        After the success of BioBERT, the pretraining of transformer-based models on biomedical corpora
has been further explored [
        <xref ref-type="bibr" rid="ref12 ref16 ref17 ref6">12, 6, 16, 17</xref>
        ]. BioLinkBERT [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] advances the pretraining approach by
including information about links between documents, enabling the model to capture relationships
across documents. This technique leads to improved performance over BioBERT. BiomedBERT3 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] is
a BERT-based model trained from scratch exclusively on biomedical corpora, in contrast to BioBERT,
which has initially been pretrained on general-domain corpora before being further pretrained on
biomedical corpora. Finally, BiomedELECTRA [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] is also a model exclusively pretrained on biomedical
corpora, but based on the ELECTRA pretraining strategy [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. The ELECTRA pretraining strategy
involves using discriminators to detect replaced tokens, while BERT-based models are trained to generate
masked tokens. In summary, these models have achieved widespread success, which is highlighted in a
recent survey [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] that identified over 30 publicly available variants. Therefore, we design our system
to exploit the wide range of pretrained models.
      </p>
      <p>
        NER and RE are core tasks of biomedical information extraction [
        <xref ref-type="bibr" rid="ref20 ref21 ref22 ref23 ref24">20, 21, 22, 23, 24</xref>
        ], enabling the
conversion of unstructured biomedical text into structured knowledge. Despite the advancements
in the field, challenges persist due to the complexity of biomedical terminology and the scarcity of
annotated data, as annotation is time-consuming, costly, and requires domain expertise. However,
despite the challenges, NER and RE are so relevant in the biomedical domain that dedicated benchmarks
for evaluating biomedical language models have been introduced, such as the Biomedical Language
Understanding and Reasoning Benchmark (BLURB) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        In state-of-the-art language models, NER is treated as a token-level classification task, typically
accomplished by adding a classification layer on top of the output of the language model to map each
token to an entity type or non-entity class [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. This is the approach of models such as BiomedBERT [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]
and BiomedELECTRA [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Prior to these models, it was common for NER to solely use a bidirectional
long short-term memory (BiLSTM) combined with a conditional random field (CRF) [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. The idea of
using a CRF has been revived by either extending a language model with a dense layer followed by a
CRF [
        <xref ref-type="bibr" rid="ref26 ref27">26, 27</xref>
        ] or a BiLSTM followed by a CRF [
        <xref ref-type="bibr" rid="ref27 ref28">28, 27</xref>
        ]. We consider these approaches while building our
solution, experimenting with them to understand how they perform in the context of GutBrainIE.
      </p>
      <p>
        Regarding the RE task, a simple approach is replacing the entities in a relation with special tokens
representing the entity label and inputting the concatenated embeddings of these tokens to a classifier
layer [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. However, there is a risk of losing the specific information about the entities as they are
replaced by generic tokens. Therefore, a widely adopted strategy to mark the entities in a relation is
to insert special tokens around them [
        <xref ref-type="bibr" rid="ref29 ref30 ref31 ref32 ref33 ref6 ref8">29, 30, 31, 32, 8, 33, 6</xref>
        ]. Additionally, Baldini Soares et al. [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]
explore diferent techniques for detecting relations between entities, including using the classification
token of the model ([CLS]), pooling the embeddings of the tokens of the entities, and concatenating the
embeddings of special entity start tokens. The latter technique exhibits the best performance.
      </p>
      <p>
        Beyond architectural improvements, there are also other techniques for improving model performance.
Bölücü et al. [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ] and Wang et al. [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ] propose methods for distinguishing between clean and noisy
3Previously known as PubMedBERT: https://huggingface.co/microsoft/BiomedNLP-BiomedBERT-base-uncased-abstract
samples and subsequently weighting the loss contribution of each sample based on its quality. Clean
samples are given a higher weight, while noisy samples contribute less to the overall loss, thereby
improving model robustness. We adopt a similar strategy to efectively leverage the data available in
the four datasets introduced in Section 1.
      </p>
      <p>
        Another technique is to ensemble models to improve performance [
        <xref ref-type="bibr" rid="ref36">36, 37</xref>
        ]. Model ensembles are
efective in handling noisy or inconsistent data, as averaging predictions helps suppress errors from
individual models. Additionally, ensembles enhance model stability and generalization, making them
more reliable for real-world applications.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Exploratory Data Analysis</title>
      <p>
        This section presents an exploratory data analysis that expands upon the initial analysis conducted
by the organizers of the GutBrainIE task [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Specifically, the analysis examines the article lengths,
entity and relation outliers, and annotation quality issues. These insights inform the development of
our information extraction pipeline.
      </p>
      <sec id="sec-3-1">
        <title>3.1. Token Sequence Length Distributions</title>
        <p>
          We analyze the article lengths across all dataset quality levels by tokenizing the combined title and
abstract of each article using WordPiece [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. Figure 1 shows the token sequence length distributions.
Overall, the distributions across all qualities appear to be close to normally distributed. The overall
lengths are similar across the diferent qualities, as expected. Two articles are excluded from the figure:
PubMed ID 37368331 with a token count of 1176 from the platinum dataset and PubMed ID 39299582
with a token count of 2924 from the silver dataset.
        </p>
        <p>200
400
600
800
200
400
600</p>
        <p>800</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Article Outliers</title>
        <p>this threshold, with a few reaching over 400 relations. Such outliers can introduce noisy patterns that
may negatively impact the ability of models to learn how entities relate to one another, potentially
reducing overall performance.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Annotation Issues</title>
        <p>The bronze dataset difers from the other datasets since the annotations are generated by a model rather
than human annotators. As a result, it contains a higher level of noise. For example, the entity “,” is
labeled as Biomedical Technique, and the entity “, and progressive” is labeled as DDF. These examples
suggest that the model struggles with correctly annotating the articles. Furthermore, some articles
from the bronze dataset contain very few entities and relations, with 21 articles having no relations at
all. Including these in the training could introduce noise and negatively impact model performance.
Despite these issues, we want to exploit the bronze dataset, as it makes up a significant amount of the
total amount of data.</p>
        <p>The silver dataset also includes some annotation issues besides the relation outliers previously
mentioned. It includes instances where entity text spans are incorrectly annotated in singular form
when the correct form should be plural. This does not adhere to the annotation guidelines and introduces
inconsistencies.</p>
        <p>We also observe that in all four datasets, there are HTML tags in many of the articles, including in the
annotated text spans. We consider the HTML tags problematic because they can lead to an increased
amount of noise in the training data since they are not used consistently and do not provide relevant
context. During tokenization, the HTML tags will result in the generation of spurious tokens that do
not represent meaningful content, leading to the model learning irrelevant patterns, which ultimately
leads to a degradation in performance.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Methodology</title>
      <p>This section presents our proposed solution to the GutBrainIE challenge, detailing the information
extraction pipeline we developed. An overview of the pipeline is illustrated in Figure 3. It takes as
input the titles and abstracts of biomedical articles about the gut-brain interplay. To address the NER
subtask (6.1), the pipeline processes these articles using an NER ensemble that combines the predictions
of multiple NER systems and outputs the final set of predicted entities. For the three RE subtasks (6.2.1,
6.2.2, and 6.2.3), the predicted entities along with the titles and abstracts of the original articles are
passed to an RE ensemble, which similarly combines the predictions of multiple RE systems to output
the final set of predicted relations. The information extraction pipeline outputs the predicted relations
in a format corresponding to the specific RE task being addressed.</p>
      <p>NER system 1
NER system 2
NER system n
NER ensemble</p>
      <p>RE system 1
RE system 2
RE system n</p>
      <p>RE ensemble
Entities</p>
      <sec id="sec-4-1">
        <title>4.1. Selection of Pretrained Models</title>
        <p>For both the NER and RE tasks, we use pretrained models. The benefits of using pretrained models
are the reduced computational cost from not training from scratch and the improved performance
through transfer learning. We considered two selection criteria. Firstly, we considered models that are
pretrained on biomedical corpora. This ensures that the models are better equipped to handle specific
terminology and patterns encountered in the GutBrainIE task. Secondly, all of the selected models are
uncased models, since the entities to be predicted in the NER task do not have a consistent casing, and
therefore, including casing in the input representation would not provide a significant benefit and could
introduce unnecessary variability.</p>
        <p>
          Based on the criteria outlined above, we selected seven transformer-based language models:
• BioLinkBERT-base [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] and BioLinkBERT-large [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], which are pretrained on abstracts from
PubMed4. Specifically, they are pretrained by feeding both a single document and its linked
documents into the same language model context.
• BiomedBERT-base-uncased-abstract-fulltext [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], which is pretrained using abstracts from
        </p>
        <p>
          PubMed and full-text articles from PubMedCentral5.
• BiomedBERT-base-uncased-abstract [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] and BiomedBERT-large-uncased-abstract [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ],
which are pretrained solely on PubMed abstracts.
• BiomedELECTRA-base-uncased-abstract [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] and
BiomedELECTRA-large-uncasedabstract [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], which are also pretrained on abstracts from PubMed.
        </p>
        <p>
          We also considered other pretrained models: BioM-ALBERT-xxlarge [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ],
BioM-ALBERT-xxlargePMC [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], and BioBERT [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. However, the ALBERT models were excluded due to their substantially
longer training times caused by their large size, and BioBERT was excluded because it consistently
performed worse compared to the seven selected models.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Named-Entity Recognition (Subtask 6.1)</title>
        <p>
          The first task in the information extraction pipeline is NER, which we approach as a token classification
problem using the beginning-inside-outside (BIO) tagging scheme [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. In this scheme, tokens that are
part of an entity are labeled with one of two prefixes: B-, indicating the beginning of an entity, or I-,
indicating a token inside an entity. Tokens that do not belong to any entity are labeled as O.
4https://pubmed.ncbi.nlm.nih.gov/
5https://pmc.ncbi.nlm.nih.gov/
        </p>
        <p>In the NER ensemble shown in the information extraction pipeline overview in Figure 3, there are
multiple NER systems. Each NER system consists of multiple components, which is illustrated in
the NER system architecture in Figure 4. An NER system takes the titles and abstracts of biomedical
articles as input, which are first preprocessed to ensure compatibility with the classification model. The
classification model consists of a pretrained model extended with a classification head. The outputs of
the classification model undergo a post-processing step, which converts them to entities, constituting
the final output of the NER system. In the following, we detail the individual components of the NER
system architecture, and then we discuss how we combine NER systems to create an NER ensemble.</p>
        <p>Preprocessing</p>
        <p>Pretrained model</p>
        <p>Dense + CRF</p>
        <sec id="sec-4-2-1">
          <title>4.2.1. Preprocessing</title>
          <p>
            The first component in the NER system architecture is the preprocessing of the input text. The input
text is tokenized using WordPiece [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ], which is a subword tokenization algorithm that splits words
into smaller, frequent subword units based on a fixed vocabulary for the specific pretrained model. This
allows the model to handle out-of-vocabulary words by representing them as combinations of known
subwords. This capability is particularly important when performing NER on text from biomedical
articles since the terminology contains a wide range of domain-specific expressions, including technical
terms, abbreviations, and names of chemicals and genes.
          </p>
          <p>The tokenization is performed with a maximum sequence length of 512 tokens. The resulting
sequence of tokens is either padded or truncated to the maximum length to maintain compatibility
with the architecture of the pretrained model. Given that only a small fraction of the dataset (77 out of
1567 samples) exceeds this limit, as shown in Section 3.1, this truncation minimally impacts the overall
performance while ensuring compatibility with the architecture.</p>
        </sec>
        <sec id="sec-4-2-2">
          <title>4.2.2. Classification Model</title>
          <p>The second component in the NER system architecture is the classification model, which consists of a
pretrained model (Section 4.1) extended with one of three classification heads:
• Dense: A single dense layer with size equal to the number of labels.
• Dense + CRF: A dense layer with size equal to the hidden size of the given pretrained model
with a GELU activation function. This is connected to another dense layer whose size matches
the number of labels, which feeds into a CRF.
• BiLSTM + CRF: A BiLSTM layer with hidden size set to half the hidden size of the given
pretrained model with a GELU activation function. This is connected to a dense layer whose size
matches the number of labels, which feeds into a CRF.</p>
          <p>The output of the classification model consists of token-level predictions, each represented by a BIO
label. The BIO labels are composed of the entity labels each prefixed with B- or I-. Tokens that do not
belong to any entity are labeled as O.
4.2.3. Post-processing
The last component in the NER system architecture is the post-processing step, which transforms
sequences of token-level predictions into entities. This step merges tokens into entities based on their
predicted labels and their adjacency in the original input text. Two subsequent tokens  1 and  2, with
start and end indices ( 1,  1) and ( 2,  2) in the original input text, are considered adjacent if  1 =  2 or
 1 =  2 − 1. The token-level predictions are processed sequentially and merged into entities based on
three rules:
1. A new span is initiated if the current token has a B- or I- prefix and there is no prior adjacent
token with a B- or I- prefix.
2. Once a span is initiated, subsequent tokens can be appended to it if they are adjacent and share
the same label, regardless of their prefix.
3. If there is no adjacent subsequent token or if it has a diferent label, then the current span is
merged into an entity, and a new span is initiated.</p>
          <p>Furthermore, we employ a lookahead mechanism to resolve rare cases, where the first and last tokens
of a sequence of adjacent tokens share the same label, but the labels of the intervening tokens are
diferent. Every time a span is initiated with a token with a B- prefix, the mechanism considers multiple
subsequent tokens. If these are adjacent, have I- prefixes, and the last token has the same label as the
initial token, then the labels of the intervening tokens are changed to the label of the initial token,
allowing all considered tokens to be merged into a single entity.</p>
          <p>When the token-level predictions are merged into entities, the casing of these entities is adjusted to
match the casing of the original input text.</p>
        </sec>
        <sec id="sec-4-2-3">
          <title>4.2.4. NER Ensemble</title>
          <p>We consider two diferent NER ensemble methods to leverage the capabilities of multiple NER systems,
to enhance the reliability of the model predictions. We name them entity-level ensemble and token-level
ensemble.</p>
          <p>Entity-level Ensemble The first method is an entity-level ensemble, which combines the outputs of
individual NER systems at the entity-level, meaning this method is applied after the post-processing.
The method involves an exact matching of the location of entities. Only entities for which the majority
of participating NER systems agree are retained. Subsequently, the final label for each retained entity is
determined based on a majority vote across the entity-level predictions from the participating NER
systems.</p>
          <p>Token-level Ensemble The second method is an token-level ensemble, which combines the outputs
of individual classification models at the token-level prior to the post-processing. A prerequisite for
this approach is to have consistent tokenization across all classification model outputs, ensuring that
token-level predictions correspond to the same underlying input tokens across models.</p>
          <p>This method involves a two-step process. In the first step, it is decided which token-level predictions
are retained from the participating classification models. At each token position in the input sequence
where at least one model predicts a label other than O, the predictions from all participating models are
examined. The method adopts a token retainment strategy to determine whether the predictions at
that position should be retained for the subsequent step. Three diferent token retainment strategies
are proposed:
• Union: All token-level predictions from the participating models are retained regardless of
agreement.
• Majority: Token-level predictions are retained only if the majority of the participating models
have predicted a label other than O at the given position.
• Intersection Token-level predictions are retained only if all models assign a label other than O
at the given position.</p>
          <p>In the second step, the method determines the final label for each token position. Two diferent
strategies are proposed for this purpose:
• Softmax sum: The softmax outputs of all the participating models are summed at the given
token position. Then, the label corresponding to the highest score is selected as the final label.
• Majority: The label predicted by the majority of the models at a given token position is selected
as the final label for the token at that position. In cases where labels receive an equal number of
votes, the label is decided with the softmax sum strategy.</p>
        </sec>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Relation Extraction (Subtask 6.2)</title>
        <p>
          We approach the RE task as a sequence classification problem. The approach is inspired by the method
proposed by Baldini Soares et al. [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ], in which entity spans are explicitly marked in the input text
using special tokens to enhance relation representation. Specifically, the special tokens [E1] and [/E1]
are inserted around the subject entity, and [E2] and [/E2] around the object entity. The hidden states
at the positions of the [E1] and [E2] tokens are extracted and concatenated to form a fixed-length
vector, which is then passed through a dense classification head.
        </p>
        <p>Each RE system in the RE ensemble shown in the information extraction pipeline overview in Figure 3
consists of multiple components. These are illustrated in the RE system architecture in Figure 5. An RE
system takes as input the titles and abstracts of the original articles together with the predicted entities
from the NER ensemble.</p>
        <p>The structure of the RE system architecture is similar to that of the NER system architecture. The
input is preprocessed to ensure compatibility with the model. The classification model consists of a
pretrained model (Section 4.1) followed by a classification head. In contrast to the NER systems, which
classifies each token in a sequence, the RE systems assign a single label to an entire sequence. Therefore,
we exclusively use a dense classification head for the RE systems, as architectures with a CRF layer
are more suitable for structured prediction tasks like NER. The classification model outputs relation
predictions that are post-processed to produce the set of relations, which are the final output. In the
following, we first describe the preprocessing and the post-processing components, and then we detail
the RE ensemble method.</p>
        <p>Preprocessing</p>
        <p>Pretrained model</p>
        <p>Dense head</p>
        <p>Classification model
The first component in the RE system architecture is the preprocessing of the input text. For each
pair of entities, a separate sample is generated by inserting the special entity markers around the
subject and object within the full input text. This ensures that each sample highlights exactly one
pair of entities. Each sample is tokenized using the tokenizer of the given pretrained model, with the
vocabulary extended with the four special tokens. The resulting sequence of tokens is either padded or
truncated to the maximum length of 512 tokens to maintain compatibility with the architecture of the
pretrained model.</p>
        <p>Entities</p>
        <sec id="sec-4-3-1">
          <title>4.3.1. Preprocessing</title>
          <p>classification model, three post-processing steps are applied. The first step is to filter out any predictions
where the classification model indicates that there is no relation between the subject and object, to
retain only the meaningful relationships. The second step involves transforming each prediction into
the format of the specific RE task. The third step identifies and removes duplicate predictions, ensuring
that each relation is represented only once in the final output.</p>
        </sec>
        <sec id="sec-4-3-2">
          <title>4.3.3. RE Ensemble</title>
          <p>We propose a relation-level ensemble method to improve the robustness of the RE predictions. This
method combines the outputs of multiple RE systems after post-processing and relies on exact matching
of relations. For BT-RE (6.2.1), this requires the labels of both the subject and object to match. For
TT-RE (6.2.2), the relation label is also included in the matching. For TM-RE (6.2.3), in addition to
the relation label, the method further requires the exact text spans of the subject and object to match.
Similarly to the entity-level ensemble strategy (Section 4.2.4), this method retains only those relations
for which a majority of the participating models produce identical predictions.</p>
        </sec>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Classification Model Training</title>
        <p>To enhance performance, we construct a more realistic training dataset distribution using a negative
sample multiplier for RE and incorporate weighted training to address diferences in annotation quality
across datasets.</p>
        <sec id="sec-4-4-1">
          <title>4.4.1. Negative Sample Multiplier</title>
          <p>For the RE tasks, to create a more realistic training dataset, the dataset is not limited to only containing
the positive relations, which are the annotated relations from the datasets.</p>
          <p>We extend it with a
configurable number of negative samples, which are instances of relations with random entities that
are not related. We denote this configurable number as the negative sample multiplier. This parameter
determines how many negative samples are added relative to the number of positive samples. We
hypothesize that the negative sample multiplier influences model performance, and we study this efect
in the experiments.</p>
        </sec>
        <sec id="sec-4-4-2">
          <title>4.4.2. Weighted Training</title>
          <p>We train the classification models for NER ( Section 4.2) and RE (Section 4.3) using diferent
combinations of the datasets of diferent qualities. We introduce a dataset weight vector, which is used as a
hyperparameter, to account for the varying annotation quality across datasets:
 ⃗=
⎡  ⎤
⎢  ⎥⎥ ,
⎢</p>
          <p>⎥
⎢
⎣  ⎦
ℒ = 1</p>
          <p>=1
∑  () ⋅  
.
where   ,   ,   ,   denote the weights for the platinum, gold, silver, and bronze datasets, respectively.
We associate each training sample to a weight based on its dataset quality. The weights are used during
training to scale the loss contributions from individual samples according to the dataset quality of their
source.
then computed as:</p>
          <p>Let   denote the loss for training sample  , and let  ()
be the mapping from training sample  to
its corresponding dataset weight. The weighted average training loss ℒ over a batch of  samples is
This approach enables the model to utilize all available data, including noisier datasets, while ensuring
that higher-quality annotations have a stronger influence during optimization.</p>
          <p>All models use the cross-entropy loss function, which is defined for training sample  as:

=1
  = − ∑  , log( ,̂ ),
where  is the number of classes,  , is the true probability of class c, represented as 1 for the correct
class and 0 for all other classes, and  ,̂ is the predicted probability of class  .</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Experiments and Results</title>
      <p>In this section, the setup, experiments, and results are presented. Section 5.1, Section 5.2, and Section 5.3
detail the setup, dataset preparation, and training configurations, respectively. In Section 5.4, we analyze
the experiments on the development dataset for the NER and RE subtasks. This includes exploring
dataset weights, model architectures, and ensemble methods. In Section 5.5, the classification models of
the best-performing systems are retrained. Then, the systems with the retrained models are evaluated
on the test dataset and the results are shown. Finally, the final GutBrainIE leaderboard results are
presented.
5.1. Setup
All training jobs are conducted on a high-performance computing cluster at Aalborg University,
AILAB6. It uses the SLURM workload manager7 to schedule and manage jobs, and leverages Singularity8
to allow for creating and running containers. Each training job is allocated access to an NVIDIA L4
GPU with 24 GB VRAM, a 32-core AMD EPYC 7543 CPU, and 24 GB of RAM.</p>
      <sec id="sec-5-1">
        <title>5.2. Dataset Preparation</title>
        <p>We use all dataset qualities for training in the NER and RE subtasks. As the silver and bronze datasets
contain some incorrect annotations, as described in Section 3.3, these are either corrected or removed.</p>
        <p>Additionally, for all subtasks, we concatenate the title and abstract of each paper before tokenization
to maintain a consistent input length and to accommodate RE, as relations can span from an entity in
the title to an entity in the abstract.</p>
        <p>In the bronze dataset, there are 21 articles with no relations at all, as detailed in Section 3.3. We
exclude these articles from the training dataset for the RE subtasks.</p>
        <p>As detailed in Section 3.2, the vast majority of articles contain fewer than 100 annotated relations, with
only a small number of outliers in the silver dataset exhibiting more than 100 relations. We hypothesize
that excluding these outliers enhances model performance. Therefore, we conduct experiments with
and without the inclusion of these outliers.</p>
      </sec>
      <sec id="sec-5-2">
        <title>5.3. Training Configurations</title>
        <p>The training is performed using the AdamW optimizer [38] and a custom learning rate scheduler.</p>
        <p>For the NER subtask, the models are trained for 20 epochs with a batch size of 16. The learning rate
scheduler applies a linear warmup from 2 ⋅ 10−5 at epoch 1 to 8 ⋅ 10−5 at epoch 4, as using a warmup is
proven to improve training stability and model performance [39]. From epoch 4 until epoch 13, the
learning rate is kept constant at 8 ⋅ 10−5. Then it decays with a factor of 0.8 every second epoch until
ifnished.</p>
        <p>For the RE subtasks, the models are trained for 10 epochs with a batch size of 16 using a similar
scheduling strategy. A linear warmup is applied from 10−6 at epoch 1 to 4 ⋅ 10−6 at epoch 3. From epoch
3 until epoch 6, the learning rate is kept constant at 4 ⋅ 10−6. Then it decays with a factor of 0.5 every
second epoch until finished.</p>
        <p>The development dataset is used to validate the performance of each model after every epoch. The
model state corresponding to the highest F1micro score is selected for each model. This metric is used
because it is the oficial evaluation metric of the GutBrainIE task.</p>
      </sec>
      <sec id="sec-5-3">
        <title>5.4. Experiments on the Development Dataset</title>
        <p>This section presents the experimental results for the NER and RE subtasks on the development dataset.</p>
        <sec id="sec-5-3-1">
          <title>5.4.1. Named-Entity Recognition (Subtask 6.1)</title>
          <p>Impact of Dataset Quality Weighting To assess the impact of dataset quality on NER performance,
the classification models are trained using various dataset weight combinations for the platinum, gold,
silver, and bronze datasets. To ensure a fair comparison, the BioLinkBERT-base model with a dense
classification head is used exclusively for this experiment. Table 1 presents the 18 dataset weight
combinations considered, along with their corresponding F1micro scores on the development dataset.
The best performance training with dataset weights achieves an F1micro score of 0.8314, whereas training
without weighting achieves an F1micro score of 0.8189. The two dataset weight combinations yielding
the highest F1micro scores are  ⃗= [1.5 1.5 1 0.75]⊤ and  ⃗= [1.25 1.25 1 0.75]⊤.
NER Classification Model Performance To investigate the performance across the three
classification heads described in Section 4.2 and the seven pretrained models described in Section 4.1, we study
three head variants of each of the seven pretrained models. This results in 21 classification models,
which we train using the two best dataset weight combinations identified in Table 1. Table 2 shows the
resulting F1micro scores.</p>
          <p>The diference in F1micro scores across the three classification head categories is minimal. The
classification models with dense heads perform slightly worse on average. However, although there
are slight diferences, the best-performing models are distributed across all three classification heads
and diferent pretrained models. Hence, we do not observe a pattern where one classification head
consistently outperforms the other two.</p>
          <p>Moreover, the results do not reveal a pattern across dataset weight combinations or architectures,
and therefore, no single architecture or classification head can be conclusively identified as the best.
NER Ensemble Performance Finally, we investigate how the NER ensemble methods described
in Section 4.2.4 perform. Token-level ensemble aggregates predictions for each token individually,
whereas entity-level ensemble retains complete entities based on majority voting across models. Both
strategies improve the performance, however, the entity-level ensemble approach consistently
outperforms the token-level approach. Consequently, only entity-level ensembles are considered in the
following experiment and for the submission.</p>
          <p>To determine which number of NER systems yields the best performance for the entity-level ensemble
approach, we conduct experiments with diferent sizes, ranging from 3 to 17 NER systems. For each
 -ensemble size, we select the top- NER systems based on the results of the previous experiments,
ranked by their individual F1micro scores on the development dataset. As a result, each larger ensemble
includes all NER systems from the smaller ensembles. For example, the top-5 ensemble contains all
NER systems from the top-3 ensemble, including the next two highest-scoring NER systems. Table 3
shows the performance of each ensemble size on the development dataset.</p>
          <p>The results indicate that ensemble strategies lead to a notable performance improvement compared
to individual models. The highest F1micro score is observed with an ensemble size of 9. However, as
performance remains consistently high across all ensemble sizes in Table 3, we consider all the ensemble
sizes for the submission of the NER subtask (6.1).</p>
        </sec>
        <sec id="sec-5-3-2">
          <title>5.4.2. Relation Extraction (Subtask 6.2)</title>
          <p>We conduct all RE experiments presented in this section using BT-RE classification models. Due to time
constraints, the configurations yielding the best performance in the BT-RE subtask (6.2.1) are also used
in the TT-RE (6.2.2) and TM-RE (6.2.3) subtasks.</p>
          <p>Impact of Dataset Hyperparameters To determine the best configurations, we conduct an
experiment to assess the impact of diferent combinations of dataset hyperparameters. These hyperparameters
encompass the dataset weights, negative sample multiplier, and exclusion of articles with relation
outliers. All RE classification models in this experiment are trained using BioLinkBERT-base as the
pretrained model, and we evaluate them on the development dataset. Table 4 presents the results.</p>
          <p>Lower negative sample multiplier values produce high recall but low precision, indicating a tendency
to generate an excessive number of false positive relations. In contrast, higher negative sample multiplier
values provide a better balance between precision and recall, resulting in the best overall performance.</p>
          <p>We also observe that removing articles with relation outliers often improves performance. Finally,
from the experiments, there does not emerge clear performance trends across diferent datasets and
dataset weight combinations.</p>
          <p>Hence, for the subsequent experiments and the final classification models, a negative sample multiplier
of 10 is used, the articles with relation outliers are excluded, and all dataset and weight combinations
are still considered.</p>
          <p>RE Classification Model Performance We evaluate the performance of the seven pretrained models
that are described in Section 4.3 with dense classification heads. We train the classification models on
the platinum and gold datasets, with outlier articles excluded and a negative sample multiplier of 10.
Table 5 shows that the results are similar across the diferent pretrained models. BioLinkBERT-base
yields the best performance among the base models, while BiomedBERT-large-uncased-abstract
and BiomedElectra-large-uncased-abstract yield the highest scores among the large models.
RE Ensemble Performance Similar to the NER ensemble experiment, the top- RE systems from
the previous RE experiments are used in a relation-level ensemble (Section 4.3.3). However, due to time
constraints, we only consider ensemble sizes of 3 and 5. Table 6 shows the performance of relation-level
ensembles of sizes 3 and 5 for each RE subtask. The level of performance is very similar, and it appears
that the two extra RE systems in the ensemble of size 5 do not lead to an advantage.</p>
        </sec>
      </sec>
      <sec id="sec-5-4">
        <title>5.5. GutBrainIE Submission Results</title>
        <p>When preparing for the submission to GutBrainIE, we retrained the classification models of the
bestperforming systems from the previous experiments on a training dataset that included the development
wp
dataset to make use of all the available annotated data. When all available data is used for training, no
separate dataset remains for validation during training. Therefore, we train the classification models
both with and without the development dataset to account for this limitation, in case those trained
on the development dataset perform unexpectedly. When the development dataset is included in the
training, it is assigned the same dataset weight as the platinum and gold datasets.</p>
        <sec id="sec-5-4-1">
          <title>5.5.1. Named-Entity Recognition (Subtask 6.1)</title>
          <p>For the NER subtask, we use the configurations presented in Table 2. We select the top 17 NER systems
based on the results from all previous experiments. This selection is conducted separately for NER
systems with the classification models trained with and without the development dataset included in
the training data. Based on these selections, we create entity-level ensembles using the top- NER
systems, where  ∈ {3, 5, 7, 9, 11, 13, 15, 17} . This results in two sets of eight entity-level ensembles.</p>
          <p>The test results for the NER subtask are shown in Table 7. As expected, including the development
dataset in the training dataset increases the performance. The best result is achieved with an entity-level
ensemble of the five NER systems with classification models trained with the development dataset
included.</p>
        </sec>
        <sec id="sec-5-4-2">
          <title>5.5.2. Relation Extraction (Subtask 6.2)</title>
          <p>Table 3 shows that the entity-level ensemble of size 9 achieves the best performance on the NER subtask
without including the development dataset in the training dataset. Since this ensemble yields the highest
score prior to evaluation on the test dataset, we select it as the best configuration. By extension, we also
select the entity-level ensemble size of 9 trained with the development dataset, assuming it may yield
the best performance. Hence, these two ensembles are used to generate the entities for the subsequent
RE subtasks.</p>
          <p>Based on the results shown in Table 5, the three pretrained models resulting in the best
performance are BioLinkBERT-base, BiomedBERT-large-uncased-abstract, and
BiomedElectra-largeuncased-abstract. Hence, the RE systems in all three RE subtasks use these models. Due to time
constraints, the classification models with large pretrained models are trained only using the platinum
and gold datasets, while those with the base model are trained on all four datasets and dataset weight
combinations shown in Table 4.</p>
          <p>For each RE subtask, we use the relation-level ensembles of size 3. This is due to time constraints,
as well as what we observed in Table 6, where there is no clear diference between the relation-level
ensembles of 3 or 5 RE systems.</p>
          <p>Since all models for the submission are trained with and without the development dataset included,
there are two entity-level ensembles and for each RE subtask there are two relation-level ensembles.
Combined this results in four relation-level ensembles for each RE subtask.</p>
          <p>Table 8 shows the test results for the RE subtasks. For each subtask, the best result is achieved by
using the entities from the entity-level ensemble that is trained with the development dataset and by
using the relation-level ensemble that is trained without the development dataset.</p>
          <p>BT-RE (Subtask 6.2.1)
TT-RE (Subtask 6.2.2)
TM-RE (Subtask 6.2.3)</p>
        </sec>
        <sec id="sec-5-4-3">
          <title>5.5.3. Final Leaderboards</title>
          <p>Table 9 illustrates the final leaderboards for each of the subtasks of the top three teams in the GutBrainIE
task. Our proposed information extraction pipeline achieved second place in the NER subtask (6.1), and
ifrst place in all three RE subtasks (6.2.1, 6.2.2, and 6.2.3).</p>
          <p>In the NER subtask (6.1), the F1micro score diference between first place and our result is 0.0026,
corresponding to a diference of 0.0031%. In the RE tasks, our approach outperformed second place
by 0.0291, 0.0408, and 0.0906 for subtasks 6.2.1, 6.2.2, and 6.2.3, respectively. This corresponds to a
diference in performance of 4.43%, 6.32%, and 24.3%, respectively.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion</title>
      <p>In this paper, we proposed a biomedical information extraction pipeline, leveraging transformer-based
models pretrained on biomedical corpora for NER and RE, as part of the GutBrainIE task.</p>
      <p>To address the domain-specific terminology involved in the tasks, we relied on biomedical pretrained
models, combined in ensembles. Specifically, for NER we selected and trained seven diferent pretrained
models combined with three diferent classification heads. Based on individual model performance, we
formed token-level and entity-level ensembles, ranging in size from 3 to 17. We discovered that both
methods and all ensemble sizes led to significant improvements in performance and that entity-level
ensembling consistently outperformed token-level ensembling. Performance across ensemble sizes was
comparable, with only minor variations. For RE, we applied the same set of pretrained models as in
NER and evaluated ensembles of sizes 3 and 5. Both ensemble sizes improved performance, with only
minor diferences observed between them.</p>
      <p>Moreover, to address the availability of datasets of varying quality, we introduced a weighted training
method, which improved performance for both NER and RE. Finally, for RE, we further improved the
performance by introducing negative samples. Our experiments suggested that a large amount of
negative samples (10 negative samples for each positive one) achieved the best performance.</p>
      <p>The organizers of the GutBrainIE task conducted an external assessment of the performance of our
information extraction pipeline. Our pipeline achieved the second-best performance in the NER subtask
(6.1) and the best performance in the RE subtasks (6.2.1, 6.2.2, and 6.2.3).</p>
      <p>For future work, we aim to improve the ability of the information extraction pipeline to distinguish
between Chemical and Gene entities, as it currently struggles with it. This could be addressed by
incorporating domain-specific gazetteers. For RE, we want to investigate the implementation of typed
entity markers, as they may provide more contextual cues to improve relation classification. Furthermore,
we want to improve data preparation by addressing the presence of HTML tags in the input texts. These
could not be removed during the challenge, as the annotations of the test data were hidden. Removing
HTML tags prevents the introduction of spurious tokens during tokenization, reducing the risk of the
model learning irrelevant patterns and improving performance.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>We gratefully acknowledge the support of CLAAUDIA through AI-Lab, which provided the
computational infrastructure essential for conducting the experiments in this study.</p>
      <p>This work is partially supported by the HEREDITARY Project, as a part of the European Union’s
Horizon Europe research and innovation programme under grant agreement No GA 101137074.</p>
    </sec>
    <sec id="sec-8">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the authors used Grammarly and Writefull in order to: Grammar
and spelling check, and Paraphrase and reword. After using this tool/service, the authors reviewed and
edited the content as needed and take full responsibility for the publication’s content.
Entity Recognition with Noise-Robust Learning and Language Model Augmented Self-Training,
in: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing,
Association for Computational Linguistics, 2021, pp. 10367–10378.
[37] D. T. Nguyen, C. K. Mummadi, T. P. N. Ngo, T. H. P. Nguyen, L. Beggel, T. Brox, Self: Learning to
iflter noisy labels with self-ensembling, arXiv preprint arXiv:1910.01842 (2019).
[38] I. Loshchilov, F. Hutter, Decoupled Weight Decay Regularization, in: 7th International Conference
on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019, OpenReview.net,
2019.
[39] D. S. Kalra, M. Barkeshli, Why Warmup the Learning Rate? Underlying Mechanisms and
Improvements, in: The Thirty-eighth Annual Conference on Neural Information Processing Systems,
2024.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>I.</given-names>
            <surname>Sekirov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. L.</given-names>
            <surname>Russell</surname>
          </string-name>
          , L.
          <string-name>
            <surname>C. M. Antunes</surname>
            ,
            <given-names>B. B.</given-names>
          </string-name>
          <string-name>
            <surname>Finlay</surname>
          </string-name>
          ,
          <article-title>Gut microbiota in health and disease, Physiological reviews (</article-title>
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>E. A.</given-names>
            <surname>Mayer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Tillisch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <article-title>Gut/brain axis and the microbiota</article-title>
          ,
          <source>J. Clin. Invest</source>
          .
          <volume>125</volume>
          (
          <year>2015</year>
          )
          <fpage>926</fpage>
          -
          <lpage>938</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>N.</given-names>
            <surname>Perera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dehmer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Emmert-Streib</surname>
          </string-name>
          ,
          <article-title>Named Entity Recognition and Relation Detection for Biomedical Information Extraction, Front</article-title>
          .
          <source>Cell Dev. Biol</source>
          .
          <volume>8</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>E. W.</given-names>
            <surname>Sayers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Beck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. E.</given-names>
            <surname>Bolton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Brister</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Connor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Feldgarden</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Fine</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Funk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hofman</surname>
          </string-name>
          , et al.,
          <article-title>Database resources of the National Center for Biotechnology Information in 2025</article-title>
          ,
          <source>Nucleic Acids Research</source>
          <volume>53</volume>
          (
          <year>2024</year>
          )
          <article-title>D20</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Yasunaga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Leskovec</surname>
          </string-name>
          , P. Liang,
          <article-title>LinkBERT: Pretraining Language Models with Document Links, in: ACL (1), Association for Computational Linguistics</article-title>
          ,
          <year>2022</year>
          , pp.
          <fpage>8003</fpage>
          -
          <lpage>8016</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Tinn</surname>
          </string-name>
          , H. Cheng, M. Lucas,
          <string-name>
            <given-names>N.</given-names>
            <surname>Usuyama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Naumann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          , H. Poon,
          <article-title>DomainSpecific Language Model Pretraining for Biomedical Natural Language Processing</article-title>
          ,
          <source>ACM Trans. Comput. Heal</source>
          .
          <volume>3</volume>
          (
          <issue>2022</issue>
          ) 2:
          <fpage>1</fpage>
          -
          <lpage>2</lpage>
          :
          <fpage>23</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>L. A.</given-names>
            <surname>Ramshaw</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Marcus</surname>
          </string-name>
          ,
          <article-title>Text Chunking using Transformation-Based Learning</article-title>
          , in: VLC@ACL,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Aid</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Azzoune</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Abdellaoui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Haddouche</surname>
          </string-name>
          , Re-SciBERT:
          <article-title>An Entity-Enriched Language Model to Enhance Biomedical Relation Extraction</article-title>
          ,
          <source>in: 2024 1st International Conference on Innovative and Intelligent Information Technologies (IC3IT)</source>
          , IEEE,
          <year>2024</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Martinelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Silvello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Bonato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. M.</given-names>
            <surname>Di Nunzio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Irrera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Marchesin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Menotti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Vezzani</surname>
          </string-name>
          , Overview of GutBrainIE@CLEF 2025:
          <article-title>Gut-Brain Interplay Information Extraction</article-title>
          , in: G. Faggioli,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          , D. Spina (Eds.),
          <source>CLEF 2025 Working Notes</source>
          ,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Nentidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Katsimpras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Krithara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Krallinger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rodríguez-Ortega</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Rodriguez-López</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Loukachevitch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sakhovskiy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Tutubalina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dimitriadis</surname>
          </string-name>
          , G. Tsoumakas,
          <string-name>
            <given-names>G.</given-names>
            <surname>Giannakoulas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bekiaridou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Samaras</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. M.</given-names>
            <surname>Di Nunzio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Marchesin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Martinelli</surname>
          </string-name>
          , G. Silvello, G. Paliouras,
          <source>Overview of BioASQ</source>
          <year>2025</year>
          :
          <article-title>The thirteenth BioASQ challenge on large-scale biomedical semantic indexing and question answering</article-title>
          , in: J.
          <string-name>
            <surname>C. de Albornoz</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Gonzalo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Plaza</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. G. S. de Herrera</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Mothe</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Piroi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Spina</surname>
          </string-name>
          , G. Faggioli, N. Ferro (Eds.),
          <source>Experimental IR Meets Multilinguality, Multimodality, and Interaction. Proceedings of the Sixteenth International Conference of the CLEF Association (CLEF</source>
          <year>2025</year>
          ),
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>N.</given-names>
            <surname>Lawson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Eustice</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Perkowitz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yetisgen-Yildiz</surname>
          </string-name>
          ,
          <article-title>Annotating large email datasets for named entity recognition with mechanical turk</article-title>
          ,
          <source>in: Proceedings of the NAACL HLT</source>
          <year>2010</year>
          <article-title>workshop on creating speech and language data with Amazon's Mechanical Turk</article-title>
          ,
          <year>2010</year>
          , pp.
          <fpage>71</fpage>
          -
          <lpage>79</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>R.</given-names>
            <surname>Tinn</surname>
          </string-name>
          , H. Cheng, Y. Gu,
          <string-name>
            <given-names>N.</given-names>
            <surname>Usuyama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Naumann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Poon</surname>
          </string-name>
          ,
          <article-title>Fine-tuning large neural language models for biomedical natural language processing</article-title>
          ,
          <source>Patterns</source>
          <volume>4</volume>
          (
          <year>2023</year>
          )
          <fpage>100729</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</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, in: NAACL-HLT (1), Association for Computational Linguistics</article-title>
          ,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Yoon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. H.</given-names>
            <surname>So</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Kang,</surname>
          </string-name>
          <article-title>BioBERT: a pre-trained biomedical language representation model for biomedical text mining</article-title>
          ,
          <source>Bioinformatics</source>
          <volume>36</volume>
          (
          <year>2019</year>
          )
          <fpage>1234</fpage>
          -
          <lpage>1240</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Alrowili</surname>
          </string-name>
          , V. Shanker, BioM-Transformers:
          <article-title>Building Large Biomedical Language Models with BERT, ALBERT and ELECTRA</article-title>
          , in: D.
          <string-name>
            <surname>Demner-Fushman</surname>
            ,
            <given-names>K. B.</given-names>
          </string-name>
          <string-name>
            <surname>Cohen</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Ananiadou</surname>
          </string-name>
          , J. Tsujii (Eds.),
          <source>Proceedings of the 20th Workshop on Biomedical Language Processing, Association for Computational Linguistics</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>221</fpage>
          -
          <lpage>227</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>K.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Altosaar</surname>
          </string-name>
          , R. Ranganath,
          <article-title>ClinicalBERT: Modeling clinical notes and predicting hospital readmission</article-title>
          , arXiv preprint arXiv:
          <year>1904</year>
          .
          <volume>05342</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>K.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Moseley</surname>
          </string-name>
          , C.-Y. Deng,
          <string-name>
            <given-names>N.</given-names>
            <surname>George</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lindvall</surname>
          </string-name>
          , Clinical XLNet:
          <article-title>Modeling Sequential Clinical Notes and Predicting Prolonged Mechanical Ventilation</article-title>
          , in: A.
          <string-name>
            <surname>Rumshisky</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Roberts</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Bethard</surname>
          </string-name>
          , T. Naumann (Eds.),
          <source>Proceedings of the 3rd Clinical Natural Language Processing Workshop</source>
          , Association for Computational Linguistics,
          <year>2020</year>
          , pp.
          <fpage>94</fpage>
          -
          <lpage>100</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>K.</given-names>
            <surname>Clark</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Luong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          , ELECTRA:
          <article-title>Pre-training Text Encoders as Discriminators Rather Than Generators</article-title>
          ,
          <source>in: 8th International Conference on Learning Representations, ICLR</source>
          <year>2020</year>
          ,
          <string-name>
            <given-names>Addis</given-names>
            <surname>Ababa</surname>
          </string-name>
          , Ethiopia,
          <source>April 26-30</source>
          ,
          <year>2020</year>
          , OpenReview.net,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>B.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Tiwari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <article-title>Pre-trained Language Models in Biomedical Domain: A Systematic Survey</article-title>
          ,
          <source>ACM Comput. Surv</source>
          .
          <volume>56</volume>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. J.</given-names>
            <surname>Johnson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Sciaky</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-H. Wei</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Leaman</surname>
            ,
            <given-names>A. P.</given-names>
          </string-name>
          <string-name>
            <surname>Davis</surname>
            ,
            <given-names>C. J.</given-names>
          </string-name>
          <string-name>
            <surname>Mattingly</surname>
            ,
            <given-names>T. C.</given-names>
          </string-name>
          <string-name>
            <surname>Wiegers</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Lu</surname>
          </string-name>
          ,
          <article-title>BioCreative V CDR task corpus: a resource for chemical disease relation extraction</article-title>
          ,
          <year>Database 2016</year>
          (
          <year>2016</year>
          )
          <article-title>baw068</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>R. I. Doğan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Leaman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <article-title>NCBI disease corpus: A resource for disease name recognition and concept normalization</article-title>
          ,
          <source>Journal of Biomedical Informatics</source>
          <volume>47</volume>
          (
          <year>2014</year>
          )
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>L.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. K.</given-names>
            <surname>Tanabe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. J. N.</given-names>
            <surname>Ando</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-J. Kuo</surname>
            ,
            <given-names>I.-F.</given-names>
          </string-name>
          <string-name>
            <surname>Chung</surname>
            ,
            <given-names>C.-N.</given-names>
          </string-name>
          <string-name>
            <surname>Hsu</surname>
            ,
            <given-names>Y.-S.</given-names>
          </string-name>
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Klinger</surname>
            ,
            <given-names>C. M.</given-names>
          </string-name>
          <string-name>
            <surname>Friedrich</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Ganchev</surname>
          </string-name>
          , et al.,
          <article-title>Overview of BioCreative II gene mention recognition</article-title>
          ,
          <source>Genome biology 9</source>
          (
          <year>2008</year>
          )
          <fpage>1</fpage>
          -
          <lpage>19</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>M.</given-names>
            <surname>Herrero-Zazo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Segura-Bedmar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Martínez</surname>
          </string-name>
          , T. Declerck,
          <article-title>The DDI corpus: An annotated corpus with pharmacological substances and drug-drug interactions</article-title>
          ,
          <source>Journal of Biomedical Informatics</source>
          <volume>46</volume>
          (
          <year>2013</year>
          )
          <fpage>914</fpage>
          -
          <lpage>920</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>À. Bravo</surname>
            ,
            <given-names>J. P.</given-names>
          </string-name>
          <string-name>
            <surname>González</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Queralt-Rosinach</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Rautschka</surname>
            ,
            <given-names>L. I. Furlong</given-names>
          </string-name>
          ,
          <article-title>Extraction of relations between genes and diseases from text and large-scale data analysis: implications for translational research</article-title>
          ,
          <source>BMC Bioinform</source>
          .
          <volume>16</volume>
          (
          <year>2015</year>
          )
          <volume>55</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>55</lpage>
          :
          <fpage>17</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>G.</given-names>
            <surname>Lample</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ballesteros</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Subramanian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kawakami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Dyer</surname>
          </string-name>
          ,
          <article-title>Neural Architectures for Named Entity Recognition</article-title>
          , in: K.
          <string-name>
            <surname>Knight</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Nenkova</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          Rambow (Eds.),
          <source>Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Association for Computational Linguistics</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>260</fpage>
          -
          <lpage>270</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>F.</given-names>
            <surname>Souza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Nogueira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Lotufo</surname>
          </string-name>
          ,
          <article-title>Portuguese named entity recognition using BERT-CRF</article-title>
          , arXiv preprint arXiv:
          <year>1909</year>
          .
          <volume>10649</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>T.</given-names>
            <surname>Almeida</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. A.</given-names>
            <surname>Jonker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Poudel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Silva</surname>
          </string-name>
          , S. Matos, BIT.UA at MedProcNer:
          <article-title>Discovering Medical Procedures in Spanish Using Transformer Models with MCRF and Augmentation</article-title>
          .,
          <source>in: CLEF (Working Notes)</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>60</fpage>
          -
          <lpage>72</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Ni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Bai</surname>
          </string-name>
          ,
          <article-title>Named Entity Recognition Using BERT BiLSTM CRF for Chinese Electronic Health Records</article-title>
          ,
          <source>in: 2019 12th International Congress on Image and Signal Processing</source>
          , BioMedical Engineering and
          <string-name>
            <surname>Informatics (CISP-BMEI)</surname>
          </string-name>
          ,
          <year>2019</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>L.</given-names>
            <surname>Baldini Soares</surname>
          </string-name>
          , N. FitzGerald, J. Ling, T. Kwiatkowski, Matching the Blanks:
          <article-title>Distributional Similarity for Relation Learning</article-title>
          , in: A.
          <string-name>
            <surname>Korhonen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Traum</surname>
          </string-name>
          , L. Màrquez (Eds.),
          <source>Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>2895</fpage>
          -
          <lpage>2905</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>K.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Mao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Gong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Cambria</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>JCBIE: a joint continual learning neural network for biomedical information extraction</article-title>
          ,
          <source>BMC bioinformatics 23</source>
          (
          <year>2022</year>
          )
          <fpage>549</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Geng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Shao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          , W. Xu,
          <article-title>Tell me your position: Distantly supervised biomedical entity relation extraction using entity position marker</article-title>
          ,
          <source>Neural Networks</source>
          <volume>168</volume>
          (
          <year>2023</year>
          )
          <fpage>531</fpage>
          -
          <lpage>538</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>W.</given-names>
            <surname>Yoon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Yi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Jackson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <article-title>Biomedical relation extraction with knowledge base-refined weak supervision</article-title>
          ,
          <year>Database 2023</year>
          (
          <year>2023</year>
          )
          <article-title>baad054</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <article-title>A Syntax-enhanced model based on category keywords for biomedical relation extraction</article-title>
          ,
          <source>Journal of Biomedical Informatics</source>
          <volume>132</volume>
          (
          <year>2022</year>
          )
          <fpage>104135</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>N.</given-names>
            <surname>Bölücü</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rybinski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wan</surname>
          </string-name>
          ,
          <article-title>An adaptive approach to noisy annotations in scientific information extraction</article-title>
          ,
          <source>Information Processing &amp; Management</source>
          <volume>61</volume>
          (
          <year>2024</year>
          )
          <fpage>103857</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Shang</surname>
          </string-name>
          , L. Liu,
          <string-name>
            <given-names>L.</given-names>
            <surname>Lu</surname>
          </string-name>
          , J. Liu, J. Han,
          <article-title>CrossWeigh: Training Named Entity Tagger from Imperfect Annotations</article-title>
          , in: K. Inui,
          <string-name>
            <given-names>J.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <string-name>
            <surname>X.</surname>
          </string-name>
          Wan (Eds.),
          <source>Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)</source>
          ,
          <source>Association for Computational Linguistics</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>5154</fpage>
          -
          <lpage>5163</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Meng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Ji</surname>
          </string-name>
          , J. Han, Distantly-Supervised Named
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>