<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Enhancing Knowledge Base Construction from Pre-trained Language Models using Prompt Ensembles</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Fabian Biester</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Daniel Del Gaudio</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mohamed Abdelaal</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Software AG</institution>
          ,
          <addr-line>Darmstadt</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Stuttgart</institution>
          ,
          <addr-line>Stuttgart</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Large language models such as ChatGPT and Bard manifest a significant step in the are of artificial intelligence. Yet, extracting useful knowledge from such models is still a challenging task. Due to the nature of language models, responses can be inaccurate, biased or even speculative. Predicting accurate object-entities by utilizing language model probing is the goal of the LM-KBC challenge. Our approach focuses on the concept of prompt ensembles. We employ initial baseline prompts to ChatGPT and then refine those prompts to exclude suboptimal ones. After a few shot learning step, we use prompt elicitation to improve the output. We use the Llama2 model with 70 billion parameters for inference. Our evaluation shows that this technique significantly enhances previous methods for knowledge base construction from language models. Our implementation is available on https://github.com/asdfthefourth/lmkbc.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Baseline Prompts</p>
      <p>Train/Val Data</p>
      <p>ChatGPT</p>
      <p>BaBsaesePrPormomptpt</p>
      <p>GeBnaesreatPerdomPrpotmpts
3</p>
      <p>1
Few Shot Learning</p>
      <p>Prompt Selection
Test Data</p>
      <p>LLAMA2-70B</p>
      <p>GPT-4</p>
      <p>5
can construct knowledge bases using pre-trained language models. Specifically, the challenge
entails the prediction of the accurate object-entities through the utilization of Language Model
probing, with the provided input subject-entity and relation. The LM-KBC challenge dataset
comprises a diverse set of 21 relations, each covering a diferent set of subject-entities, and a
complete list of ground truth object-entities per subject-relation-pair.</p>
      <p>Our solution primarily relies on the concept of prompt ensemble1. Figure 1 depicts the
architecture of our proposed solution, highlighting the various components. To craft the prompt
ensemble, we initiate the process by employing the initial baseline prompts as inputs to the
ChatGPT framework. Through this procedure, ten analogous prompts are generated, all of
which pose the identical query. Subsequently, a step of prompt elicitation is executed, wherein
supplementary contextual information is injected into the chosen prompts, furnishing them
with additional insights about the anticipated nature of the predicted data.</p>
      <p>Preceding the inference phase, a process of prompt refinement is undertaken to exclude
suboptimal prompts, drawing from insights garnered from the train/validation dataset. The
selected prompts of merit are then augmented with illustrative instances drawn from the training
data, thereby facilitating the enhancement of few-shot learning capabilities. Furthermore, a
validation process known as fact probing ensues, which assures the accuracy of the selected
prompts. In this phase, a transformation of the relation is undertaken to assume the form of a
Boolean question. For instance, for a relation like "BandHasMember," this transformation would
manifest as the query, "Is member a constituent of band?".</p>
      <p>The final stage involves the inference of object entities, using the Llama2 70B model, which
engages its adeptness in disentangling complex data relationships. In the remainder of this paper,
we will introduce these components in more detail, before discussing the obtained results.</p>
      <p>1Our implementation is available on https://github.com/asdfthefourth/lmkbc.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Prompt Ensemble</title>
      <p>
        The main contribution of our work is using prompt ensembles for LM probing [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Instead of
using a single prompt, a linguistic diverse set of prompts is used, i.e., an ensemble. We define
an individual threshold per relation to reach consensus between the prompts. Additionally,
the  worst prompts based on the performance on the training data are removed. We take the
number  of possible answers from the dataset description and only use the number as the
upper bound of possible answers for the model. We finetune the threshold on the validation
dataset and use the resulting values for the test dataset. For choosing the optimal subset for
the ensemble we calculated all subsets between 4 to all prompts on the training dataset and
evaluated those on the validation dataset. The final prompt consists of the general context, the
relation specific context, the few-shots and the prompt itself. The prompt ensemble approach is
divided into five steps that are further explained in this section: prompt generation (Section 2.1),
prompt elicitation (Section 2.2), few-shot example (Section 2.3), prompt selection (Section 2.4)
and entity disambiguation (Section 2.5).
      </p>
      <sec id="sec-2-1">
        <title>2.1. Prompt Generation</title>
        <p>For generating additional prompts, we use the base prompt and ChatGPT to generate an
additional  prompts. Also, additional prompts were checked by humans for consistency and
errors. The idea behind using LMs for prompt generation is to exploit model understanding to
get more similar questions.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Prompt Elicitation</title>
        <p>
          In the prompt elicitation step, we add additional information to some of the relations [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. This
information is very specific for each relation.
        </p>
        <p>For example, regarding the relation PersonPlayInstrument, we add the musician in front of
the subject-entity. For the relation BandHasMember, we add the band in front of the
subjectentity. One example for a prompt for the relation BandHasMember is "Who are the members
of subject_entity?". After elicitation, the prompt looks like this: "Who are the members of the
band subject_entity?". An example for the relation PersonPlaysInstrument is "What instrument
does subject_entity play?", which looks like this after elicitation: "What instrument does the
musician subject_entity play?".</p>
        <p>Table 6, Table 7 and Table 8 in Appendix A show the worst and the best performing prompts
resulting from our approach.</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Few-Shot Example</title>
        <p>
          We choose the few-shot examples randomly for each relation by using the training data and the
base prompt provided in the dataset repo [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. We test which amount of few-shots produces the
best F1-score. Table 1 shows the results for a given few-shot number .
        </p>
        <p>Table 2 shows the similar results for only using the best prompt ensemble. The results show
that the comparison of a higher amount of examples provides a better result. Yet, diminishing
returns happen after  = 10 and the computation efort increases too much for using  = 20
or higher. Using only the best prompt, the F1-score reduces even when using ensemble. the
few-shot examples are handpicked to include the maximum size of answers, the minimum size
of answers, the empty set if it is allowed and a diverse selection of answers if only a few answer
classes are available.</p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Prompt Selection</title>
        <p>Prompt selection is done by trying out a subset of ensembles on the training or the evaluation
datasets and varying thresholds for finding a consensus. The best subset of prompts is chosen
based on the F1-score.</p>
        <p>We only search for thresholds in relations that allow more than one object and the empty set,
because the consensus algorithm produces the same results regardless of the threshold. This is
only the case for the two relations with numbers as solutions: PersonHasNumberOfChildren
and SeriesHasNumberOfEpisodes.</p>
      </sec>
      <sec id="sec-2-5">
        <title>2.5. Entitiy Disambiguation</title>
        <p>We use the baseline entity disambiguation provided with the dataset and modify the algorithm
to return an empty string if no entity was found. We prompt the LM in the few shot example to
return the objects in the following format: [Object1, Object2, ...]. Then we extract the objects
and query the Wikidata2 API for IDs as it was done in the baseline.</p>
        <p>2Wikidata: http://wikidata.org</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Fact Probing</title>
      <p>
        Fact probing is used to check whether the result of the previous step is correct [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. For each
relation, the LM is asked whether it is true or not. Therefore, we invert the relationship of each
relation and create a prompt as a boolean question. For example, for every band in a relation
{band} BandHasMember {member}, we create a prompt "is {member} part of {band}".
In this step, we also do few shot examples to improve the LMs response. For example, regarding
the relations related to death, we first ask whether the subject is still alive and then confirm
either location or cause.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Experimental Setup</title>
      <p>The development of our approach was mostly done on the Llama2 model with 13 billion
parameters to improve the turnaround time.</p>
      <p>The following steps are taken to achieve the results. We run the validation dataset on the
Llama2 model with 70 billion parameters with 10 few-shot examples. Then, we do fact checking
on the results. Next, we generate the ensembles and the tresholds for each relation based on
the validation dataset. We run test dataset on Llama2 and GPT-4 while using the generated
ensembles from the previous step. Lastly, we combine the final dataset.</p>
      <p>The last step contains the combination of the final dataset, we combine the solutions that
were generated by gpt4 and llama respectivly and combine them to a single dataset.</p>
      <sec id="sec-4-1">
        <title>4.1. Dataset Description</title>
        <p>The dataset we use for the evaluation contains 21 m-to-n relations. Four of these relations
contain the empty set as the solution. The dataset contains 1940 subjects for predictions
and is divided into a training, validation and test dataset. The dataset contains relations in
diferent domains, e.g., chemistry, geography and celebrities. The relations are in the
triplemanner subject-predicate-object. An example for a relation in the chemistry dataset is: subject:
"potassium, hydrogen, oxygen", relation: "CompoundHasParts", object: "Potassium Hydroxide".
An example for an empty relation in the celebrity dataset is: subject: "Kobe Bryant", relation:
"PersonHasNoblePrize", object": "" (empty set).</p>
        <p>We use the training dataset for the few-shot training and the validation dataset for calculating
the optimal ensemble.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Model Selection</title>
        <p>We use the Llama2 model in several editions: with 7 billion parameters, with 13 billion parameters
and with 70 billion parameters. We run the Llama2 model with 70 billion parameters on two
A100 GPUs with 40GB RAM each for inference. We furthermore use a non-fine-tuned version
and a fine-tuned version for the chat completion. Table 3 shows the results of our comparison
of the Llama2 model with diferent parameter sizes, each using the best prompt and the best
ensemble. Our comparison shows that the model version with 70 billion parameters using the
best ensemble achieves the best results.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results</title>
    </sec>
    <sec id="sec-6">
      <title>6. Related Work</title>
      <p>
        Alivanistos et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] focus on prompting as probing which is a multi-step approach that combines
a variety of prompting techniques to construct knowledge bases from LMs. We apply a similar
approach in the step of fact probing. Yet, we further improve their approach be using prompt
ensembles in a previous step.
      </p>
      <p>
        Li et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] focus on the task-specific to improve relation prediction using LMs. Therefore,
they create a sentence from every subject-relation-object triple. They mask the tokens in the
sentence that are relevant to the object entity and train the LM with the objective to predict the
tokens. They furthermore apply prompt elicitation, similar to our approach.
      </p>
      <p>
        Ning and Celebi [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] also apply a prompt ensemble step, similar to our approach. Yet, we
furthermore improve this by applying additional steps like prompt elicitation and fact probing.
      </p>
      <p>
        In their pre-print “Boosted Prompt Ensembles for Large Language Models”, Pitis et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]
use few shot prompts to create prompt ensembles. They adapt classical boosting algorithms to
improve prompts in an iterative process. Their solution could be a promising future improvement
for our work.
      </p>
      <p>
        Jiang et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] propose a mining- and paraphrasing-based method to estimate the knowledge
contained in LMs more accurately. Similar to our approach, they use ensemble methods to
combine the results of diferent prompts. They describe diferent methods to create the ensembles,
which could be used to further improve our work. Yet, they do not involve ChatGPT for the
prompts generation.
      </p>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusion and Outlook</title>
      <p>Our evaluation shows that using prompt ensembles improves the overall performance of
knowledge base construction using LMs. Our comparison described in Section 4.2 shows that using
the non-fine-tuned Llama2 model with the most parameters achieves the best results. This leads
to a trade-of between the best results and processing time.</p>
      <p>
        In the future, we aim to evaluate our approach on more powerful hardware so we do not have
to apply quantization to the model parameters. This should lead to an ever higher F1-score. We
furthermore aim to test our approach of diferent LMs like GPT-4 and introduce the approaches
of Ning and Celeb [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] and Jiang et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] to our solution, as described in Section 6.
      </p>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgments</title>
      <p>This research was funded by German Federal Ministry of Education and Research (BMBF)
through grants 01IS17051 (Software Campus program), 02L19C155, 01IS21021A (ITEA project
number 20219).</p>
    </sec>
    <sec id="sec-9">
      <title>A. Worst and Best Performing Prompts</title>
      <sec id="sec-9-1">
        <title>Provide a list of states that belong to subject_entity.</title>
      </sec>
      <sec id="sec-9-2">
        <title>What are the constituent states of subject_entity?</title>
      </sec>
      <sec id="sec-9-3">
        <title>Can you tell me in which position subject_entity participates in football?</title>
      </sec>
      <sec id="sec-9-4">
        <title>Tell me about the role subject_entity plays in football.</title>
      </sec>
      <sec id="sec-9-5">
        <title>What caused the death of subject_entity?</title>
      </sec>
      <sec id="sec-9-6">
        <title>Share details about what led to subject_entity’s passing.</title>
      </sec>
      <sec id="sec-9-7">
        <title>Mention the title of the book authored by subject_entity.</title>
      </sec>
      <sec id="sec-9-8">
        <title>I’m interested in knowing the title of subject_entity’s autobiography.</title>
      </sec>
      <sec id="sec-9-9">
        <title>Who is subject_entity’s employer?</title>
      </sec>
      <sec id="sec-9-10">
        <title>Can you tell me the name of subject_entity’s employer?</title>
      </sec>
      <sec id="sec-9-11">
        <title>In which field did subject_entity receive the Nobel</title>
      </sec>
      <sec id="sec-9-12">
        <title>Prize?</title>
      </sec>
      <sec id="sec-9-13">
        <title>What discipline was recognized when subject_entity was awarded the Nobel Prize?</title>
      </sec>
      <sec id="sec-9-14">
        <title>How many children does subject_entity have?</title>
      </sec>
      <sec id="sec-9-15">
        <title>What is the size of subject_entity’s family in terms of children? F1-Score 0.0</title>
        <p>0.0
0.655
0.5566
0.7783
0.5366
0.4266
0.3166
0.3027
0.2142
0.9766
0.5966
0.52
0.39</p>
      </sec>
      <sec id="sec-9-16">
        <title>PersonHasPlaceOfDeath</title>
      </sec>
      <sec id="sec-9-17">
        <title>PersonHasPlaceOfDeath</title>
      </sec>
      <sec id="sec-9-18">
        <title>PersonHasProfession</title>
      </sec>
      <sec id="sec-9-19">
        <title>PersonHasProfession</title>
      </sec>
      <sec id="sec-9-20">
        <title>PersonHasSpouse</title>
      </sec>
      <sec id="sec-9-21">
        <title>PersonHasSpouse</title>
      </sec>
      <sec id="sec-9-22">
        <title>PersonPlaysInstrument</title>
      </sec>
      <sec id="sec-9-23">
        <title>PersonPlaysInstrument</title>
      </sec>
      <sec id="sec-9-24">
        <title>PersonSpeaksLanguage</title>
      </sec>
      <sec id="sec-9-25">
        <title>PersonSpeaksLanguage</title>
      </sec>
      <sec id="sec-9-26">
        <title>RiverBasinsCountry</title>
      </sec>
      <sec id="sec-9-27">
        <title>RiverBasinsCountry</title>
      </sec>
      <sec id="sec-9-28">
        <title>SeriesHasNumberOfEpisodes</title>
      </sec>
      <sec id="sec-9-29">
        <title>SeriesHasNumberOfEpisodes</title>
      </sec>
      <sec id="sec-9-30">
        <title>StateBordersState</title>
      </sec>
      <sec id="sec-9-31">
        <title>StateBordersState Prompt</title>
      </sec>
      <sec id="sec-9-32">
        <title>Where did subject_entity die?</title>
      </sec>
      <sec id="sec-9-33">
        <title>Identify the location of subject_entity’s passing.</title>
      </sec>
      <sec id="sec-9-34">
        <title>What does subject_entity do as their profession?</title>
      </sec>
      <sec id="sec-9-35">
        <title>State subject_entity’s area of expertise or job title.</title>
      </sec>
      <sec id="sec-9-36">
        <title>Who is the life partner or spouse of subject_entity?</title>
      </sec>
      <sec id="sec-9-37">
        <title>Provide information about the person to whom subject_entity is married.</title>
      </sec>
      <sec id="sec-9-38">
        <title>What is subject_entity’s chosen musical instrument?</title>
      </sec>
      <sec id="sec-9-39">
        <title>Tell me about the musical equipment with which subject_entity is proficient.</title>
      </sec>
      <sec id="sec-9-40">
        <title>What languages does subject_entity speak?</title>
      </sec>
      <sec id="sec-9-41">
        <title>What are the diferent languages known by subject_entity?</title>
      </sec>
      <sec id="sec-9-42">
        <title>State the country where the subject_entity river basin is situated.</title>
      </sec>
      <sec id="sec-9-43">
        <title>I’d like to know the geographical location of the subject_entity river basin.</title>
      </sec>
      <sec id="sec-9-44">
        <title>How many episodes have been produced for subject_entity series?</title>
      </sec>
      <sec id="sec-9-45">
        <title>Tell me about the total episode tally of subject_entity series.</title>
      </sec>
      <sec id="sec-9-46">
        <title>Tell me the names of the states that share borders with subject_entity. What states are connected to subject_entity’s state by borders?</title>
        <p>F1-Score</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>F.</given-names>
            <surname>Petroni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Rocktäschel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bakhtin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. H.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Riedel</surname>
          </string-name>
          ,
          <article-title>Language models as knowledge bases?</article-title>
          , arXiv preprint arXiv:
          <year>1909</year>
          .
          <volume>01066</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Singhania</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-C.</given-names>
            <surname>Kalo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Razniewski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. Z.</given-names>
            <surname>Pan</surname>
          </string-name>
          ,
          <article-title>Lm-kbc: Knowledge base construction from pre-trained language models, semantic web challenge @ iswc, CEUR-WS (</article-title>
          <year>2023</year>
          ). URL: https://lm-kbc.github.io/challenge2023/.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>X.</given-names>
            <surname>Ning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Celebi</surname>
          </string-name>
          ,
          <article-title>Knowledge base construction from pre-trained language models by prompt learning (</article-title>
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>T.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Papasarantopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Vougiouklis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. Z.</given-names>
            <surname>Pan</surname>
          </string-name>
          ,
          <article-title>Task-specific pre-training and prompt decomposition for knowledge graph population with language models</article-title>
          ,
          <source>arXiv preprint arXiv:2208.12539</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Kwok</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. M.</given-names>
            <surname>Ni</surname>
          </string-name>
          ,
          <article-title>Generalizing from a few examples: A survey on few-shot learning</article-title>
          ,
          <source>ACM Comput. Surv</source>
          .
          <volume>53</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Alivanistos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. B.</given-names>
            <surname>Santamaría</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cochez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-C.</given-names>
            <surname>Kalo</surname>
          </string-name>
          , E. van Krieken,
          <string-name>
            <given-names>T.</given-names>
            <surname>Thanapalasingam</surname>
          </string-name>
          ,
          <article-title>Prompting as probing: Using language models for knowledge base construction</article-title>
          ,
          <source>arXiv preprint arXiv:2208.11057</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Pitis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ba</surname>
          </string-name>
          ,
          <article-title>Boosted prompt ensembles for large language models</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2304</volume>
          .
          <fpage>05970</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. F.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Araki</surname>
          </string-name>
          , G. Neubig,
          <article-title>How Can We Know What Language Models Know?, Transactions of the Association for Computational Linguistics 8 (</article-title>
          <year>2020</year>
          )
          <fpage>423</fpage>
          -
          <lpage>438</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>