<!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>Detection in Large Language Models (LLMs)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Malavika Suresh</string-name>
          <email>m.suresh@rgu.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Rahaf Aljundi</string-name>
          <email>rahaf.al.jundi@toyota-europe.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ikechukwu Nkisi-Orji</string-name>
          <email>i.nkisi-orji@rgu.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nirmalie Wiratunga</string-name>
          <email>n.wiratunga@rgu.ac.uk</email>
          <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>Large Language Models (LLMs)</institution>
          ,
          <addr-line>Hallucination, Model Probing</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Robert Gordon University (RGU)</institution>
          ,
          <addr-line>Aberdeen, Scotland</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Toyota-Motor-Europe (TME)</institution>
          ,
          <addr-line>Brussels</addr-line>
          ,
          <country country="BE">Belgium</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Due to the increasing availability of Large Language Models (LLMs) through both proprietary and open-sourced releases of models, the adoption of LLMs across applications has drastically increased making them commonplace in day-to-day lives. Yet, the problem of detecting and mitigating hallucinations in these models remains an open challenge. This work considers the problem of open-box hallucination detection, i.e., detecting hallucinations when there is full access to the generation process. Recent work has shown that simple binary probes constructed on the model activation space can act as reliable hallucination detectors. This work extends probing-based detection methods by considering the activation space at multiple layers, components and token positions during generation. Experiments are conducted across two LLMs and three open-domain fact recall datasets. The results indicate that hallucinations can be detected at various layers as well as token positions during the generation process. This indicates the potential for saving compute costs through early detection as well as for improving detection performance by designing more sophisticated probing methods.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        With Large Language Models (LLMs) becoming increasingly accessible, many researchers are now
focusing on the problem of detecting and mitigating model hallucinations - i.e. the tendency to produce
factually inaccurate text. Solving the problem of hallucinations is of high importance not only to
prevent the spread of misinformation in this era of LLM-based chatbots and search engines but also
to ensure safety when deploying to sensitive applications such as therapeutic chatbots, where LLMs
have the potential to create high impact. The widespread adoption of proprietary API-based LLMs has
led to the development of black-box and grey-box methods of hallucination detection and mitigation,
which do not require access to the underlying LLM. Black-box methods [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1, 2, 3</xref>
        ] rely on additional LLM
prompting, while grey-box methods [
        <xref ref-type="bibr" rid="ref1 ref4 ref5">1, 4, 5</xref>
        ] make use of generated token probabilities, where available,
to quantify the uncertainty of generated output. Meanwhile, the release of several open-sourced LLMs
has also recently motivated the development of open-box methods [
        <xref ref-type="bibr" rid="ref6 ref7 ref8">6, 7, 8</xref>
        ], which probe and modify
the internal operations during the generation process.
      </p>
      <p>
        Detection and mitigation using additional LLM prompting, while simple to implement, adds high
compute cost and increases latency at inference time. Uncertainty quantification methods, while
overcoming these shortcomings, cannot detect confident model hallucinations. With access to model
internals, open-box methods have the potential to address the problems of compute eficiency, inference
latency as well as model overconfidence. This work identifies and addresses open research questions in
open-box hallucination detection. Recent work [
        <xref ref-type="bibr" rid="ref6 ref9">6, 9</xref>
        ] has shown that binary classifiers (probes) built on
the model activation space are good hallucination detectors. While these methods typically consider
the activation space at the output of the transformer block, model editing literature [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] has shown that
SICSA REALLM Workshop 2024
      </p>
      <p>CEUR</p>
      <p>
        ceur-ws.org
feed-forward components play a crucial role in fact recall, which raises the question of whether better
detection performance can be achieved by probing activations at the level of individual transformer
components, especially for factual hallucinations. Similarly, probing attention head activations has
been shown to be useful for separating ‘truthful’ and ‘non-truthful’ statements [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], indicating that some
hallucinations may be detected at attention heads. This work extends recent probing-based hallucination
detection methods with the goal of investigating: (1) how can model activations at multiple layers be
combined to improve hallucination detection? (2) at which transformer model components and token
positions can hallucinations be best detected?
      </p>
      <p>Experiments are conducted on two LLMs, namely Llama-7B and its instruction fine-tuned version
Alpaca-7B. Results on three factual question-answering datasets demonstrate that hallucinations can
often be detected at the output of multiple model components (i.e. attention head outputs,
feedforward outputs) and token positions during decoding, highlighting the need for further research into
sophisticated probing methods to improve open-box hallucination detection. Reasonable detection
performance is observed even as early as the generation of the first token of the response, which can
help save compute costs in many practical applications.</p>
      <p>Section 2 provides an overview of recent methods of hallucination detection and mitigation,
introducing relevant notations and equations. The experiments conducted are described in section 3, followed
by a discussion of results in section 4. Finally, section 5 concludes the work and provides directions for
future research.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <sec id="sec-2-1">
        <title>2.1. Uncertainty estimation (grey-box)</title>
        <p>This category of approaches utilises the output token probabilities to estimate the uncertainty of a
generated sequence. For a given input prompt, generations with lower uncertainty scores are considered
to be less hallucinatory. Let  denote an input prompt to an LLM, for which M responses can be sampled
from the LLM1, denoted as  1,  2, ...,   . Broadly, uncertainty can be estimated either for each individual
sample   or for the entire sampled space of M responses. The former can be used to identify the best
response for the prompt as the sample with least uncertainty, while the latter determines whether the
LLM is capable of generating any appropriate response at all for the prompt. In other words, prompts
that an LLM is able to reliably provide responses for should have low uncertainty in the sampled space,
with appropriate and non-hallucinatory responses having the least individual sample uncertainty.</p>
        <p>Sequence probability of individual sample: (  |) = −
∏ (  | &lt; , )

Predictive entropy of individual sample:  (
1When using greedy decoding, M=1</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Prompt-based approaches (black-box)</title>
        <p>
          This category of approaches is based on the impressive reasoning performance of LLMs with
incontext learning [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] and chain-of-thought prompting [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. Several works [
          <xref ref-type="bibr" rid="ref1 ref13 ref2">1, 2, 13</xref>
          ] use additional LLM
prompting to detect contradictions in originally generated outputs. However, adapting the prompt
to specific applications (i.e. prompt-engineering) is not straight-forward and also computationally
expensive, since only larger models exhibit reasonable performance with prompt-based detection [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ].
In fact, using prompts as a self-correction mechanism has even been shown to be detrimental to the
original performance [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], whereby models modify originally correct responses into responses with
hallucinations.
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Decoding strategies (open-box)</title>
        <p>This category of approaches aims to detect and mitigate hallucinations at generation time through
probing and modifications respectively, of the internal transformer operations. Since the detection
and modification operations are applied during the forward pass of the prompt at inference time,
these approaches have much lower computational cost than some uncertainty approaches that require
multiple output samples or prompt-based approaches that require multiple forward passes.</p>
        <sec id="sec-2-3-1">
          <title>Preliminaries</title>
          <p>represented as { 0
−1
Let  −1 denote the output of layer  − 1 of the transformer, where individual tokens are
,  −11 ...

−1 ...

−1 }. Equations (4) - (7) describe various operations in the subsequent
transformer layer  . Equation (4) represents the multi-head-attention component, where 
denotes
the attention operation and  and  represent projection to and from the attention head dimensions.
Equation (5) represents the multi-layer perceptron (MLP) operation followed by residual connection to
give the final layer activation. Equations (6) and (7) represent the activation projection to vocabulary
space to give the next token probability distribution.

ℎ=1
Attention output:  ‵ =  −1 + ∑  ℎ</p>
          <p>Layer representation/activation:   =   +   (
‵

‵
)
Distribution over vocab (Layer logits): (  )</p>
          <p>Softmax output:   = Softmax ((  ))
(4)
(5)
(6)
(7)</p>
        </sec>
        <sec id="sec-2-3-2">
          <title>Detection</title>
          <p>
            Prior work in probing have primarily investigated the layer activations. CCS [
            <xref ref-type="bibr" rid="ref9">9</xref>
            ] consists
of a linear projection followed by a sigmoid classifier and takes as input the activations of the last
input token at the last layer. SAPLMA [
            <xref ref-type="bibr" rid="ref6">6</xref>
            ] consists of a a three-layer feed-forward network with ReLu
activations followed by a sigmoid classifier and takes as input the activations of the last input token at
a given layer.
          </p>
        </sec>
        <sec id="sec-2-3-3">
          <title>Mitigation</title>
          <p>
            The ITI [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ] approach is based on empirical evidence that the attention head activation
space contains directions that are correlated with the ’truthfulness’ of an input text [
            <xref ref-type="bibr" rid="ref9">9</xref>
            ]. The notion
of ’truthfulness’, as measured in this work, relates to common human misconceptions and as such,
is a special case of factual hallucinations. Given a labelled dataset of correct and false answers to
a set of questions and the model activations for all answers at each attention head, a linear binary
classifier (probe) is trained on the last token activations to separate the correct and false answers (with
one probing classifier per attention head). The direction learnt by this probe is then used to shift the
activations at inference time, at the top  heads that achieved the highest probing accuracy, with a
hyper-parameter  to control the intervention strength. CAD [
            <xref ref-type="bibr" rid="ref15">15</xref>
            ] modifies the generation probability
of output tokens by contrasting the probability distributions obtained with and without adding an input
context to the prompt. The contrast operation encourages the model to generate tokens which are
aligned with the input context as opposed to relying on the internal knowledge stored in the model,
which is shown to be particularly useful when the context information contradicts the stored knowledge.
DoLa [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ] builds on the early exit strategy work [
            <xref ref-type="bibr" rid="ref16">16</xref>
            ] and modifies the generation probability of output
tokens by contrasting the original output probability distribution of each token against the distribution
obtained by projecting inner transformer layer outputs on to the vocabulary (i.e. early exit). Specifically,
at each token position  , the layer  with maximum distribution divergence from the output layer 
is selected for contrast, which is then performed as a subtraction of log probabilities. The approach
is based on the observation that factual information tokens are decided at higher layers and shows
that contrasting against such layers improves factuality. Unlike CAD which focuses on incorporating
new factual information, DoLa elicits factual information that is already stored in the model. Opera
[
            <xref ref-type="bibr" rid="ref17">17</xref>
            ] modifies the final layer logits to introduce a penalty term when attending to summary tokens to
prevent hallucinations in long-form generations. Equations describing these methods are provided in
the appendix B.
          </p>
        </sec>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Model editing (open-box)</title>
        <p>
          The field of model editing aims to identify and update facts or information stored in the weights of a
pre-trained transformer model. This line of work [
          <xref ref-type="bibr" rid="ref10 ref18">10, 18</xref>
          ] permanently modifies the underlying model
and is thus orthogonal to work in decoding strategies, where updates are performed on the activations
directly at inference time.
        </p>
      </sec>
      <sec id="sec-2-5">
        <title>2.5. Fine-tuning and reinforcement learning with human feedback (open-box)</title>
        <p>
          This category of approaches fine-tunes a model, often using reinforcement learning with human
feedback [
          <xref ref-type="bibr" rid="ref19 ref20">19, 20</xref>
          ], to improve the truthfulness of model responses and encourage abstention when the
model is unable to produce a valid response. Fine-tuning large language model is computationally
intensive and also requires a large training dataset, making it infeasible for many practical applications
where data collection is dificult.
attention heads and MLP are probed in addition to the final layer output. As tokens are generated recursively,
multiple token locations are also considered for probing.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Method - Probing Experiments</title>
      <p>This section describes the probing experiments conducted to investigate the hallucination detection
capability at various points during the generation process2. For the first setup, L binary classifiers
(i.e. probes) are trained per LLM in a supervised manner with hallucination/non-hallucination labels,
where L denotes the number of transformer layers in the model, as shown in figure
1. Each probe
takes as input the output activations at the corresponding model layer  for the last generated token
(  ). At inference time, three strategies are explored for probe selection: (1)Most Accurate (MA):
selects the probe at the most accurate layer, i.e., layer with the best performance3 on an in-distribution
validation set (2)Most Confident (MC) : selects the probe with the most confident prediction for the
test sample (3)Majority Vote (MV): takes a majority vote across all probes. Probes that always predict
the same class on the validation set, if any, are excluded to ensure that we only consider layers where
hallucinating and non-hallucinating activations are separable.</p>
      <p>
        For the second setup, probes are constructed at three locations within each transformer layer, as
shown in figure 2: (1)LAY: at the output of the layer (  ) (2)MLP: at the output of the MLP (  (
 ‵))
(3)AH: at the output of each attention head (
ℎ
 ( 
ℎ 


−1 )), following ITI [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Further, at each layer and
model component, the following token positions are considered for probing: (1)LT: at the last token of
generation (2)PLT: at the last token of prompt, i.e. first token of generation (3) LLT: at the least likely
token, i.e. token location with least output probability (4)MAX: maxpooling activations across all token
positions
      </p>
      <sec id="sec-3-1">
        <title>Experiment Setup</title>
        <p>
          Experiments are conducted on Llama-7B and its instruction fine-tuned version
Alpaca-7B, using two open-domain question answering (QA) tasks - Natural Questions [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] and Trivia
QA [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] - and one chain-of-thought (COT) reasoning task - Strategy QA [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. All datasets are publicly
available. Natural Questions and Trivia QA consist of general knowledge questions requiring short
factual answers (i.e. who/when/where type questions). StrategyQA consists of general knowledge
2Refer section 2 for notations used
3we use the macro-F1 score as a measure of performance
questions that require multi-hop reasoning to produce a binary yes/no answer. All datasets are evaluated
in a closed-book setting. Responses are extracted using greedy decoding. For the QA tasks, each response
is labelled as hallucinated/non-hallucinated using a rouge-1 cut-of of 0.3 against the gold reference
answer, following prior work [
          <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
          ]. For the COT task, each response is labelled as
hallucinated/nonhallucinated by comparing the final yes/no answer produced against the gold reference answer, following
prior work [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. All tokens of a response share the same label. Prompt formats, dataset statistics and
other implementation details are provided in appendix.
        </p>
        <p>
          Baselines Here we focus on methods that are compute eficient at inference time, i.e. do not require
multiple generations or forward passes through the model. PE denotes the predictive entropy of the
generated tokens (using equation 2) [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]. LP denotes a linear probe trained on the activations of the
last token at the final transformer layer. NLP denotes a non-linear probe trained on the activations of
the last token at the final transformer layer, following SAPLMA [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results</title>
      <p>Detection across layers Table 1 shows the results of the three baseline methods that operate
only on the final layer output alongside the layer selection and layer combination strategies. The
baseline probes constructed on the last layer activations (LP, NLP) already perform significantly better
than the entropy baseline (PE). Non-linear probes do not provide a major improvement over linear
probes, indicating perhaps the need to increase the number of training samples to enable learning a
non-linear separation. Of the three layer selection strategies, selecting the most accurate layer (MA)
provides the best improvement, though minor, on most model-dataset combinations. Taking a majority
vote across layers (MV) also provides minor improvements. Future research could investigate any
correlation between the hallucination probabilities given by probes across layers and the early exit
theory, which could point towards methods for improving both hallucination detection and early
exit-based hallucination mitigation. No performance gains are seen when selecting the most confident
layer (MC) at inference time.</p>
      <p>Detection across components and tokens Table 2 compares the results of probing at diferent
model components and token positions. Probes at the output of the MLP on average perform comparably
to probes at the layer output. Probes at the attention head outputs are on average worse, although
still performing better than the predictive entropy baseline. Interestingly, probes at the last token
of the prompt (PLT) already perform better than the predictive entropy baseline (except for STR on
Llama-7B), indicating the potential for early detection of hallucinations before generating the full
response. Comparing the results of PLT, LLT and MAX on the Llama-7B model, all three types of
probing show similar performance on average. However, on the Alpaca-7B model, for the TQA and
NQ datasets, the LLT and MAX probes perform significantly better than the PLT probes on average.
Overall, across all model-dataset combinations, the best performance is achieved by probing at the last
generated token (LT).</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>This work compares the hallucination detection capability at various layers, transformer components
and token positions during the generation process in LLMs, using probing experiments. Specifically,
binary probes are constructed on top of activations at the attention head, MLP and layer output for each
transformer decoder block in the LLM. Probes are constructed at the first token of generation, at the
token with least output probability, as well as using maxpooled activations across all tokens. Results
across two LLMs and three factual question-answering datasets show that hallucinations can be detected
at varying levels at all considered components and token positions, with the best performance being
achieved at the last token position using the layer output activations. Reasonable performance achieved
at the first token indicates the potential for deploying early detection mechanisms, which can help save
compute costs. Given the good detection performance achieved at multiple layers in the LLM, simple
strategies are explored for selecting and creating an ensemble across layers. Results show that using
an in-distribution validation set to identify the layer with the best detection performance, as well as a
majority vote ensemble across all layers can provide minor performance gains at inference time. Overall,
this work highlights that hallucinations can be detected at various points during the generation process
and indicates that future research in developing more sophisticated detection mechanisms on top of
model activations can provide further gains. For instance, leveraging activations of sampled responses
alongside greedy responses for probe training could help learn a more generalisable separation between
hallucinations and non-hallucinations.
Answering Benchmark with Implicit Reasoning Strategies, Transactions of the Association for
Computational Linguistics (TACL) (2021).
https://arxiv.org/abs/2002.07650. arXiv:2002.07650.</p>
    </sec>
    <sec id="sec-6">
      <title>A. Equations describing uncertainty estimation methods</title>
      <p>
        Predictive entropy of individual sample with token relevance weighting [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]:
(8)
(9)
(10)
(11)
(12)
(13)
(14)
(15)
      </p>
      <sec id="sec-6-1">
        <title>Entropy of sampled space:</title>
        <p>Applying Monte Carlo Integration with importance sampling:
 (</p>
      </sec>
      <sec id="sec-6-2">
        <title>Entropy of sampled space with sample relevance weighting [5]:</title>
      </sec>
      <sec id="sec-6-3">
        <title>Semantic entropy of sampled space [4]:</title>
        <p>where (|) =
∑∈
(|)</p>
      </sec>
      <sec id="sec-6-4">
        <title>ITI [7] for mitigation:</title>
        <p>B. Equations describing decoding strategies
1 
Modified attention head activations:  +1 =   + ∑  ℎ
 (</p>
        <p>) +   ℎ ℎ)

ℎ=1
Penalty at final layer:   (  | &lt; ) = Softmax ((

+1 ) −  )</p>
      </sec>
      <sec id="sec-6-5">
        <title>Opera [17] for mitigation:</title>
      </sec>
      <sec id="sec-6-6">
        <title>DoLa [8] for mitigation:</title>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>C. Experiment Setup</title>
      <p>tasks, respectively.</p>
      <p>Modified distribution at final layer:
 ′ ( | &lt; ) = Softmax ( (  (  | &lt; ),   (  | &lt; )))</p>
      <p>
        Prompt Formats Prompt formats used are shown in figure 3 [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and figure 4 [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] for the QA and COT
Dataset Statistics Table 3 shows the number of train and test samples used per dataset. Accuracy
indicates the percentage of questions answered correctly by the model (i.e. non-hallucinations).
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>P.</given-names>
            <surname>Manakul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Liusie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. J. F.</given-names>
            <surname>Gales</surname>
          </string-name>
          , Selfcheckgpt:
          <article-title>Zero-resource black-box hallucination detection for generative large language models</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2303</volume>
          .
          <fpage>08896</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>N.</given-names>
            <surname>Mündler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Vechev</surname>
          </string-name>
          ,
          <article-title>Self-contradictory hallucinations of large language models: Evaluation, detection and mitigation</article-title>
          ,
          <source>arXiv preprint arXiv:2305.15852</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Schuurmans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chowdhery</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <article-title>Self-consistency improves chain of thought reasoning in language models</article-title>
          ,
          <source>arXiv preprint arXiv:2203.11171</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>L.</given-names>
            <surname>Kuhn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Farquhar</surname>
          </string-name>
          ,
          <article-title>Semantic uncertainty: Linguistic invariances for uncertainty estimation in natural language generation</article-title>
          ,
          <source>ArXiv abs/2302</source>
          .09664 (
          <year>2023</year>
          ). URL: https://api.semanticscholar. org/CorpusID:257039062.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Duan</surname>
          </string-name>
          , H. Cheng,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zavalny</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Kailkhura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <article-title>Shifting attention to relevance: Towards the uncertainty estimation of large language models</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2307</volume>
          .
          <fpage>01379</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Azaria</surname>
          </string-name>
          , T. Mitchell,
          <article-title>The internal state of an LLM knows when it's lying</article-title>
          ,
          <source>in: The 2023 Conference on Empirical Methods in Natural Language Processing</source>
          ,
          <year>2023</year>
          . URL: https://openreview.net/forum? id=y2V6YgLaW7.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>K.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Patel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Viégas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Pfister</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wattenberg</surname>
          </string-name>
          ,
          <article-title>Inference-time intervention: Eliciting truthful answers from a language model</article-title>
          ,
          <source>in: Thirty-seventh Conference on Neural Information Processing Systems</source>
          ,
          <year>2023</year>
          . URL: https://openreview.net/forum?id=aLLuYpn83y.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Y.-S.</given-names>
            <surname>Chuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Glass</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <article-title>Dola: Decoding by contrasting layers improves factuality in large language models</article-title>
          ,
          <source>in: The Twelfth International Conference on Learning Representations</source>
          ,
          <year>2024</year>
          . URL: https://openreview.net/forum?id=
          <fpage>Th6NyL07na</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>C.</given-names>
            <surname>Burns</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Ye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Klein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Steinhardt</surname>
          </string-name>
          ,
          <article-title>Discovering latent knowledge in language models without supervision</article-title>
          ,
          <source>arXiv preprint arXiv:2212.03827</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>K.</given-names>
            <surname>Meng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Andonian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Belinkov</surname>
          </string-name>
          ,
          <article-title>Locating and editing factual associations in gpt</article-title>
          , in: S. Koyejo,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mohamed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Belgrave</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Oh (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>35</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2022</year>
          , pp.
          <fpage>17359</fpage>
          -
          <lpage>17372</lpage>
          . URL: https://proceedings.neurips.cc/paper_files/paper/2022/file/ 6f1d43d5a82a37e89b0665b33bf3a182-Paper-Conference.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y. A.</given-names>
            <surname>Yadkori</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Kuzborskij</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>György</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Szepesvári</surname>
          </string-name>
          , To believe or not to believe your llm,
          <year>2024</year>
          . arXiv:
          <volume>2406</volume>
          .
          <fpage>02543</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>T.</given-names>
            <surname>Brown</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ryder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Subbiah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Kaplan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dhariwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Neelakantan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Shyam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sastry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Herbert-Voss</surname>
          </string-name>
          , G. Krueger,
          <string-name>
            <given-names>T.</given-names>
            <surname>Henighan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Child</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ziegler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Winter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hesse</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          , E. Sigler,
          <string-name>
            <given-names>M.</given-names>
            <surname>Litwin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gray</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chess</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Clark</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Berner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>McCandlish</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Sutskever</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Amodei</surname>
          </string-name>
          ,
          <article-title>Language models are few-shot learners</article-title>
          , in: H.
          <string-name>
            <surname>Larochelle</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Ranzato</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Hadsell</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Balcan</surname>
          </string-name>
          , H. Lin (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>33</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2020</year>
          , pp.
          <fpage>1877</fpage>
          -
          <lpage>1901</lpage>
          . URL: https:// proceedings.neurips.cc/paper_files/paper/2020/file/1457c0d6bfcb4967418bfb8ac142f64a-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S.</given-names>
            <surname>Dhuliawala</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Komeili</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Raileanu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Celikyilmaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Weston</surname>
          </string-name>
          ,
          <article-title>Chain-of-verification reduces hallucination in large language models</article-title>
          ,
          <source>arXiv preprint arXiv:2309.11495</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. S.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. W.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <article-title>Large language models cannot self-correct reasoning yet</article-title>
          ,
          <source>in: The Twelfth International Conference on Learning Representations</source>
          ,
          <year>2024</year>
          . URL: https://openreview.net/forum?id=
          <fpage>IkmD3fKBPQ</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>W.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tsvetkov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          , S. W. tau Yih,
          <article-title>Trusting your evidence: Hallucinate less with context-aware decoding</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2305</volume>
          .
          <fpage>14739</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>T.</given-names>
            <surname>Schuster</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fisch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dehghani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bahri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Tran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Metzler</surname>
          </string-name>
          ,
          <article-title>Confident adaptive language modeling</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>35</volume>
          (
          <year>2022</year>
          )
          <fpage>17456</fpage>
          -
          <lpage>17472</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <surname>X.</surname>
          </string-name>
          wen Dong,
          <string-name>
            <given-names>P.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. H.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <article-title>Opera: Alleviating hallucination in multi-modal large language models via over-trust penalty and retrospection-allocation</article-title>
          ,
          <source>ArXiv abs/2311</source>
          .17911 (
          <year>2023</year>
          ). URL: https://api.semanticscholar.org/ CorpusID:265498818.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>E.</given-names>
            <surname>Hernandez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Andreas</surname>
          </string-name>
          ,
          <article-title>Inspecting and editing knowledge representations in language models</article-title>
          ,
          <source>in: Arxiv</source>
          ,
          <year>2023</year>
          . URL: https://arxiv.org/abs/2304.00740.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>K.</given-names>
            <surname>Tian</surname>
          </string-name>
          , E. Mitchell,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Finn</surname>
          </string-name>
          ,
          <article-title>Fine-tuning language models for factuality</article-title>
          ,
          <source>arXiv preprint arXiv:2311.08401</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>T.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , T. He, Y. Han,
          <string-name>
            <surname>G</surname>
          </string-name>
          . Cui,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          , H.-T. Zheng,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sun</surname>
          </string-name>
          , T.-S. Chua, Rlhf-v:
          <article-title>Towards trustworthy mllms via behavior alignment from fine-grained correctional human feedback</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)</source>
          ,
          <year>2024</year>
          , pp.
          <fpage>13807</fpage>
          -
          <lpage>13816</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.-W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          ,
          <article-title>Latent retrieval for weakly supervised open domain question answering, in: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics</article-title>
          , Florence, Italy,
          <year>2019</year>
          , pp.
          <fpage>6086</fpage>
          -
          <lpage>6096</lpage>
          . URL: https://www.aclweb.org/anthology/P19-1612. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>P19</fpage>
          - 1612.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>M.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Weld</surname>
          </string-name>
          ,
          <string-name>
            <surname>L.</surname>
          </string-name>
          <article-title>Zettlemoyer, triviaqa: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehension</article-title>
          , arXiv e-prints (
          <year>2017</year>
          ) arXiv:
          <fpage>1705</fpage>
          .03551. arXiv:
          <volume>1705</volume>
          .
          <fpage>03551</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>M.</given-names>
            <surname>Geva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Khashabi</surname>
          </string-name>
          , E. Segal,
          <string-name>
            <given-names>T.</given-names>
            <surname>Khot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Roth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Berant</surname>
          </string-name>
          ,
          <article-title>Did Aristotle Use a Laptop? A Question</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>A.</given-names>
            <surname>Malinin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gales</surname>
          </string-name>
          ,
          <article-title>Uncertainty estimation in autoregressive structured prediction</article-title>
          ,
          <year>2021</year>
          . URL:
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>