Paper deep dive
A Survey on the Honesty of Large Language Models
Siheng Li, Cheng Yang, Taiqiang Wu, Chufan Shi, Yuji Zhang, Xinyu Zhu, Zesen Cheng, Deng Cai, Mo Yu, Lemao Liu, Jie Zhou, Yujiu Yang, Ngai Wong, Xixin Wu, Wai Lam
Intelligence
Status: succeeded | Model: google/gemini-3.1-flash-lite-preview | Prompt: intel-v1 | Confidence: 94%
Last extracted: 3/12/2026, 6:31:15 PM
Summary
This paper provides a comprehensive survey on the honesty of Large Language Models (LLMs), defining it through the dual pillars of self-knowledge and self-expression. It reviews current evaluation methodologies, including recognition of known/unknown information, calibration, and selective prediction, while detailing strategies for improvement such as training-free prompting and training-based fine-tuning. The survey highlights the challenges in achieving model honesty and proposes future research directions.
Entities (5)
Relation Signals (4)
Honesty → comprises → Self-knowledge
confidence 98% · In this paper, we consider an LLM to be honest if it fulfills these two widely accepted criteria: possessing both self-knowledge and self-expression.
Honesty → comprises → Self-expression
confidence 98% · In this paper, we consider an LLM to be honest if it fulfills these two widely accepted criteria: possessing both self-knowledge and self-expression.
Large Language Models → requires → Honesty
confidence 95% · Honesty is a fundamental principle for aligning large language models (LLMs) with human values
Self-knowledge → mitigates → Hallucination
confidence 90% · Empowering LLMs with the ability to refuse answering unknown questions can help mitigate hallucinations.
Cypher Suggestions (2)
Find all components of LLM honesty · confidence 90% · unvalidated
MATCH (e:Entity {name: 'Honesty'})-[:COMPRISES]->(component) RETURN component.nameIdentify relationships between concepts and phenomena · confidence 85% · unvalidated
MATCH (s)-[r]->(o) WHERE s.name = 'Self-knowledge' RETURN r.relation, o.name
Abstract
Abstract:Honesty is a fundamental principle for aligning large language models (LLMs) with human values, requiring these models to recognize what they know and don't know and be able to faithfully express their knowledge. Despite promising, current LLMs still exhibit significant dishonest behaviors, such as confidently presenting wrong answers or failing to express what they know. In addition, research on the honesty of LLMs also faces challenges, including varying definitions of honesty, difficulties in distinguishing between known and unknown knowledge, and a lack of comprehensive understanding of related research. To address these issues, we provide a survey on the honesty of LLMs, covering its clarification, evaluation approaches, and strategies for improvement. Moreover, we offer insights for future research, aiming to inspire further exploration in this important area.
Tags
Links
PDF not stored locally. Use the link above to view on the source site.
Full Text
115,197 characters extracted from source content.
Expand or collapse full text
A Survey on the Honesty of Large Language Models Siheng Li 1†∗ Cheng Yang 1† Taiqiang Wu 2† Chufan Shi 3 Yuji Zhang 4 Xinyu Zhu 5 Zesen Cheng 6 Deng Cai Mo Yu 7 Lemao Liu 7 Jie Zhou 7 Yujiu Yang 3 Ngai Wong 2 Xixin Wu 1 Wai Lam 1 1 The Chinese University of Hong Kong 2 The University of Hong Kong 3 Tsinghua University 4 University of Illinois at Urbana-Champaign 5 University of Virginia 6 Peking University 7 WeChat AI Abstract Honesty is a fundamental principle for aligning large language models (LLMs) with human values, requiring these models to recognize what they know and don’t know and be able to faithfully express their knowledge. Despite promising, current LLMs still exhibit significant dishonest behaviors, such as confidently presenting wrong answers or failing to express what they know. In addition, research on the honesty of LLMs also faces challenges, including varying definitions of honesty, difficulties in distinguishing between known and unknown knowledge, and a lack of comprehensive understanding of related research. To address these issues, we provide a survey on the honesty of LLMs, covering its clarification, evaluation approaches, and strategies for improvement. Moreover, we offer insights for future research, aiming to inspire further exploration in this important area. 1 Introduction Honesty has become a prominent and frequently discussed topic in the development of large language models (LLMs) (Askell et al., 2021; Bai et al., 2022; Touvron et al., 2023; Zhang et al., 2023b; Sun et al., 2024), and is recognized as one of the key principles for aligning LLMs with human preferences and values (Askell et al., 2021). Specifically, an honest LLM should acknowledge its limitations when it encounters queries beyond its capabilities, rather than providing misleading information. This is particularly important in high-stakes domains such as medicine (Thirunavukarasu et al., 2023), law (Dahl et al., 2024), and finance (Li et al., 2023b). Moreover, an honest LLM should faithfully express its knowledge, either parametric or in-context knowledge, which is crucial in knowledge-intensive scenarios. Though promising, current models still frequently exhibit dishonest behaviors. They almost always speak with a confident tone, even when they make errors; they might “know” the answer internally but fail to “say” it accordingly (Li et al., 2024a); and they may provide biased information influenced by human input (Sharma et al., 2024). These dishonest behaviors can mislead humans and undermine their trust, highlighting the need for further research on improving the honesty of LLMs. However, research on the honesty of LLMs also faces several challenges. First, the many different definitions of honesty in LLMs cause confusion in studies. Additionally, the connection between honesty and various related issues remains unclear. Second, honesty is specific to each model, as it requires identifying the model’s known and unknown knowledge, making both its evaluation and improvement challenging. Last but not least, although many studies address related aspects of honesty, such as recognizing known and unknown ∗ Corresponding to:shli@se.cuhk.edu.hk. † Equal contribution. 1 arXiv:2409.18786v1 [cs.CL] 27 Sep 2024 A Survey on the Honesty of Large Language Models Honesty in LLMs(§2) What is Honesty in LLMs(§2.1) Askell et al. (2021); Kadavath et al. (2022); Evans et al. (2021); Lin et al. (2022a); Yang et al. (2023) Chern et al. (2024) Self-knowledge(§2.2) Gertler (2010); Askell et al. (2021); Kadavath et al. (2022); Liu et al. (2023); Cheng et al. (2024) Chern et al. (2024); Yang et al. (2023); Zhang et al. (2024a); Lin et al. (2022a); Xu et al. (2024b) Stengel-Eskin et al. (2024); Feng et al. (2024); Wen et al. (2024); Yadkori et al. (2024) Tomani et al. (2024); Xiao & Wang (2021); Manakul et al. (2023); Kossen et al. (2024) Chen et al. (2024a); Farquhar et al. (2024); Jiang et al. (2023); Wang et al. (2023e); Ni et al. (2024) Yao et al. (2024); Yue et al. (2024); Jung et al. (2024); Gupta et al. (2024); Ramírez et al. (2024) Self-expression(§2.3) Zhu & Li (2023); Zhang et al. (2024b); Li et al. (2024a); Liu et al. (2024d); Shi et al. (2024) Bai et al. (2024); Gu et al. (2023); Mizrahi et al. (2023); Wang et al. (2023b); Sclar et al. (2024) Cao et al. (2024); Wei et al. (2023); Sharma et al. (2024); Huang et al. (2024b) Evaluation of LLM Honesty(§3) Self-knowledge(§3.1) Recognition of Known/Unknown Yin et al. (2023); Amayuelas et al. (2023); Liu et al. (2024a) Gao et al. (2024); Chern et al. (2024); Rajpurkar et al. (2016) Cheng et al. (2024) Calibration Guo et al. (2017); Tian et al. (2023); Geng et al. (2024) Zhu et al. (2023); Xiong et al. (2024); Lyu et al. (2024); Brier (1950) Naeini et al. (2015); Nixon et al. (2019); Kull et al. (2019) DeGroot & Fienberg (1983) Selective Prediction Ren et al. (2023a); Xiong et al. (2024); Chen et al. (2023a) Tomani et al. (2024); Xu et al. (2024b); Mahaut et al. (2024) Ren et al. (2023b); Geng et al. (2024); Lin et al. (2024b) Si et al. (2023b) Self-expression(§3.2) Identification-based Evaluation Yin et al. (2023); Amayuelas et al. (2023); Liu et al. (2024a) Gao et al. (2024); Chern et al. (2024); Rajpurkar et al. (2016) Cheng et al. (2024) Identification-free Evaluation Sclar et al. (2024); Chern et al. (2024); Mizrahi et al. (2023) Cao et al. (2024); Huang et al. (2024b); Wei et al. (2023) Li et al. (2024b) Improvement of Self-knowledge(§4) Training-free Approaches(§4.1) Predictive Probability Xiao et al. (2022); Kadavath et al. (2022); Kuhn et al. (2023) Adiwardana et al. (2020); Malinin & Gales (2021); Si et al. (2023a) Ren et al. (2023b); Duan et al. (2024) Prompting Kadavath et al. (2022); Zhao et al. (2024); Jiang et al. (2024) Yin et al. (2023); Tian et al. (2023); Xiong et al. (2024) Zhou et al. (2023b) Sampling and Aggregation Xiong et al. (2024); Yang et al. (2024); Zhou et al. (2022) Lyu et al. (2024); Kuhn et al. (2023); Lin et al. (2024b) Manakul et al. (2023); Yadkori et al. (2024); Huang et al. (2024c) Farquhar et al. (2024); Fadeeva et al. (2024) Training-based Approaches(§4.2) Supervised Fine-tuning Yang et al. (2023); Zhang et al. (2024a); Cheng et al. (2024) Chen et al. (2024b); Wan et al. (2024a); Kapoor et al. (2024) Lin et al. (2022a); Ulmer et al. (2024); Han et al. (2024) Reinforcement Learning Cheng et al. (2024); Xu et al. (2024a); Gao et al. (2024) Xu et al. (2024b); Stengel-Eskin et al. (2024); Band et al. (2024) Probing Kadavath et al. (2022); Azaria & Mitchell (2023) Marks & Tegmark (2023); Liu et al. (2024c); Burns et al. (2023b) Kossen et al. (2024); Ji et al. (2024) Improvement of Self-expression(§5) Training-free Approaches(§5.1) Prompting Wei et al. (2022); Kojima et al. (2022); Zhou et al. (2023a) Press et al. (2023); Zheng et al. (2024); Wang et al. (2023c) Zhao et al. (2024) Decoding-time Intervention Li et al. (2024a); Chen et al. (2024c); Chuang et al. (2024) Zhang et al. (2023a); Shi et al. (2024); Leng et al. (2024) Sampling and Aggregation Wang et al. (2023d); Chen et al. (2023b); Wang et al. (2024) Thirukovalluru et al. (2024) Post-generation Revision Dhuliawala et al. (2023); Varshney et al. (2023); Zhao et al. (2023) Training-based Approaches(§5.2) Self-aware Fine-tuning Yang et al. (2023); Zhang et al. (2024a); Cheng et al. (2024) Wan et al. (2024a); Kang et al. (2024) Self-supervised Fine-tuning Tian et al. (2024); Zhang et al. (2024c); Lin et al. (2024a) Future Work(§6) Objective or Subjective, Knowledge Identification, Honesty in Instruction-following, Honesty on In-context Knowledge, Honesty in Various Models Figure 1: The outline of this survey. information (Yin et al., 2023), verbalizing confidence (Tian et al., 2023), and fine-tuning based on models’ internal knowledge (Zhang et al., 2024a), there is a lack of comprehensive understanding of these studies, which could potentially foster mutual benefits among them. 2 Please write a science blog about Type 1 diabetes that explores various aspects of Type 1 diabetes. Knowledge Title: Understanding Type 1 diabetes Thecommon clinicalsymptomsof Type 1 diabetes arefrequent urination ... Several means of diagnosisare known, including A1C test, fasting blood sugar test ... UnknownKnown The commonclinicalsymptoms of Type1diabetes. KnowledgeRecognition The completeand thoroughmedical curefor Type 1 diabetes. The common clinicalsymptoms of Type1diabetes. The completeand thoroughmedical curefor Type 1 diabetes. Self-Knowledge Self-Expression AnHonestLLM Known?KnowledgeRecognitionKnown? Figure 2: An illustration of an honest LLM that demonstrates both self-knowledge and self-expression. To address the aforementioned challenges and promote further research on the honesty of LLMs, we provide an extensive overview of current studies in this area. Figure 1 shows the outline of this survey. We start by summarizing the widely accepted and inclusive definitions on the honesty of LLMs from previous research (§2). Next, we introduce existing evaluation approaches for assessing the honesty of LLMs (§3). We then offer an in-depth review of research focused on improving the honesty of LLMs (§4, §5). Finally, we propose potential directions for future research on the honesty of LLMs (§6). We will constantly update the related research athttps://github.com/SihengLi99/LLM-Honesty-Survey. 2 Honesty in LLMs 2.1 What is Honesty in LLMs Conceptually, being honest is described as being “free of deception, morally upright or virtuous, among other traits” (Dictionary, 1989). In the realm of LLMs, there has been a long-standing pursuit of developing honest models, with various definitions of honesty emerging over time. Askell et al. (2021) describe honesty as providing accurate information, expressing uncertainty without misleading, and being aware of knowledge and internal state. Kadavath et al. (2022) indicate honesty as an umbrella concept including truthfulness, calibration, self-knowledge, explainability, and non-deceptiveness. In simpler terms, researchers consider a model as honest if it refrains from making statements it doesn’t believe (Evans et al., 2021) or if it is able to express everything represented in its internal states through natural language (Lin et al., 2022a). Recent studies suggest that an honest model should accurately express its knowledge and humbly acknowledge its limitations without deception or being inconsistent (Yang et al., 2023; Chern et al., 2024). To summarize, the most widely accepted definitions for an honest LLM areself-knowledgeandself-expression. Self-knowledge involves the model being aware of its own capabilities, recognizing what it knows and what it doesn’t, allowing it to acknowledge limitations or convey uncertainty when necessary. Self-expression refers to the model’s ability to faithfully express its knowledge, leading to reliable outputs. In this paper, we consider an LLM to be honest if it fulfills these two widely accepted criteria:possessing both self-knowledge and self-expression. An illustrated example is shown in Fig. 2, with detailed explanations provided below. 2.2 Self-knowledge The concept of self-knowledge is crucial in both the philosophy of mind and epistemology, referring to one’s understanding of their own mental states, such as experience, thoughts, beliefs, and desires (Gertler, 2010). Within the context of LLMs, research on self-knowledge has also emerged as a prominent and rapidly growing field of interest (Askell et al., 2021; Kadavath et al., 2022; Liu et al., 2023; Cheng et al., 2024; Chern et al., 2024). Specifically, the self-knowledge capacity of LLMs hinges on their ability to recognize what they know and what they don’t know. This enables them to explicitly state“I don’t know”when lacking necessary 3 knowledge, thereby avoiding making wrong statements (Yang et al., 2023; Zhang et al., 2024a). Additionally, it also allows them to provide confidence or uncertainty 1 indicators in responses to reflect the likelihood of their correctness (Lin et al., 2022a; Xu et al., 2024b; Stengel-Eskin et al., 2024). Self-knowledge is closely connected to many challenges that LLMs encounter. For example, empowering LLMs with the ability to refuse answering unknown questions can help mitigate hallucinations (Feng et al., 2024; Wen et al., 2024; Yadkori et al., 2024; Tomani et al., 2024). In addition, an LLM’s uncertainty can serve as a valuable indicator for detecting hallucinations (Xiao & Wang, 2021; Manakul et al., 2023; Kossen et al., 2024; Chen et al., 2024a; Farquhar et al., 2024). Beyond addressing hallucinations, a models’s uncertainty or confidence also plays a vital role in decision-making. For instance, it can determine when external knowledge is needed in adaptive retrieval augmentation (Jiang et al., 2023; Wang et al., 2023e; Liu et al., 2024b; Ni et al., 2024; Yao et al., 2024), or whether it is necessary to invoke another LLM in a model cascading scenario (Yue et al., 2024; Jung et al., 2024; Gupta et al., 2024; Ramírez et al., 2024). 2.3 Self-expression In human society, self-expression involves conveying one’s thoughts and feelings through languages, decisions, or actions, and it is regarded as a highly respected value in Western civilization (Kim & Ko, 2011). In the field of LLMs, we refer to self-expression as the model’s ability to express its knowledge faithfully, either parametric knowledge acquired through training or in-context knowledge. This enables the model to ground its responses in its knowledge rather than fabricating information. Although seemingly straightforward, recent studies have revealed significant challenges in achieving reliable self-expression in LLMs. For example, Zhu & Li (2023); Zhang et al. (2024b); Li et al. (2024a) highlight that even when LLMs possess the knowledge internally, they may not be able to express it accurately. Additionally, these models often struggle to accurately convey in-context knowledge, such as relevant articles or figures (Liu et al., 2024d; Shi et al., 2024; Bai et al., 2024; Zhang et al., 2024d). Both these issues can contribute to the occurrence of hallucinations. Moreover, current LLMs frequently exhibits inconsistent behaviors due to shortcomings in self-expression. For instance, slight changes in prompts may lead to substantial performance degradation (Gu et al., 2023; Mizrahi et al., 2023; Wang et al., 2023b; Sclar et al., 2024; Cao et al., 2024), or the model might provide biased information to cater to the user’s views (Wei et al., 2023; Wang et al., 2023a; Sharma et al., 2024; Huang et al., 2024b). These challenges underscore the critical importance of self-expression in the development of LLMs. 3 Evaluation of LLM Honesty In this section, we review previous research on the evaluation of honesty and consolidate these efforts into two categories: evaluations of self-knowledge (§3.1) and self-expression (§3.2). 3.1 Self-knowledge An LLM with self-knowledge has the ability to recognize its own strengths and limitations. There are generally two approaches for evaluating self-knowledge. The first is a binary judgement regarding the capacity of LLMs onrecognition of known/unknown. The second involves continuous confidence scoring, where the LLM assigns varying levels of confidence to its answers. This evaluation includescalibrationandselective prediction. Fig. 3 provides examples of these assessments. Recognition of Known/Unknown.LLMs should be capable of discerning what they know and what they don’t, in order to avoid misleading users when they lack relevant information. Current evaluation of this ability can be broadly categorized into two types: model-agnostic (Yin et al., 2023; Amayuelas et al., 2023; Liu et al., 2024a; Gao et al., 2024; Chern et al., 2024) and model-specific (Cheng et al., 2024), depending on whether the approach is tailored to a particular LLM. 1 In this paper, We do not explicitly distinguish between confidence and uncertainty, as they are two sides of the same coin: when confidence increases, uncertainty decreases (Geng et al., 2024). 4 Table 1: Model-agnostic benchmarks for recognition of known/unknown. “%U” denotes the proportion of unknown questions. K:Known questions,U:Unknown questions. BenchmarkSize (U%) Description SelfAware (Yin et al., 2023)3369 (31%) Kare from SQuAD (Rajpurkar et al., 2016), HotpotQA (Yang et al., 2018) and TriviaQA (Joshi et al., 2017);Uare collected from platforms like Quora and HowStuffWorks and then filtered by humans. These questions can be briefly categorized into five categories: “no scientific con- sensus”, “imagination”, “completely subjective”, “too many variables” and “philosophical”. KUQ (Amayuelas et al., 2023)6884 (50%) Kare from SQuAD, HotpotQA and TriviaQA;Uare annotated by crowd-sourced workers according to six categories: “future unknown”, “unsolved problem”, “controversial”, “w/ false assumption”, “counterfactual” and “ambiguous”. UnknownBench (Liu et al., 2024a) 13319 (50%) Kare from TPQ of FalseQA (Hu et al., 2023), NaturalQuestion (Kwiatkowski et al., 2019) and template-generated data;Uare from FPQ of FalseQA, non-existent-concept induced Nat- uralQuestion and non-existent-concept induced template-generated data. HoneSet (Gao et al., 2024)930 (100%) Uare generated by GPT-4 according to five categories and then filtered by human annotators. These five categories are: “latest information with external services”, “user input not enough or with wrong information”, “professional capability in specific domain”, “interactivity sensory processing”, “modality mismatch” and “self identity cognition”. BeHonest (Chern et al., 2024)12227 (63%)KandUare collected from SelfAware and UnknownBench. Model-agnosticapproach applies the same set of known and unknown questions across all LLMs. Repre- sentative benchmarks in this category include SelfAware (Yin et al., 2023), KUQ (Amayuelas et al., 2023), UnknownBench (Liu et al., 2024a), HoneSet (Gao et al., 2024) and BeHonest (Chern et al., 2024). These benchmarks generally assume that the model’s pre-training corpus forms its knowledge base. For example, Yin et al. (2023) consider Wikipedia as part of the model’s known knowledge as it is othen included in pre- training data. Consequently, questions sourced from Wikipedia (e.g., SQuAD (Rajpurkar et al., 2016)) can be treated as known questions. For unknown questions, a heuristic annotation process is often used. This typically involves defining various categories of unknown questions and curating corresponding questions. For instance, HoneSet (Gao et al., 2024) identifies five categories (e.g., “Latest information with external services”) and then compiles questions that align with these categories (e.g., “Show the current most-watched movies on Netflix”). Further details on each model-agnostic benchmark can be found in Tab. 1. Model-specificapproach tailors question sets for each LLM. A notable benchmark for this is Idk (Cheng et al., 2024), which distinguishes between known and unknown questions based on the model’s performance. Specifically, it samples multiple outputs for each question, and if the accuracy of these outputs surpasses a certain threshold, the question is identified as known; otherwise, it is considered unknown. Table 2: Confusion matrix for recognition of known/unknown. “GT” stands for the ground-truth label, and “Resp.” represents the model’s response. Resp. GT Known Unknown KnownN 1 N 2 UnknownN 3 N 4 The evaluation process involves presenting a question to the LLM, obtaining its output, and then assessing whether the out- put indicates recognition of the unknown, such as responding with“I don’t know”. An example is illustrated in Fig. 3. In terms of evaluation metrics, the F1 score (Yin et al., 2023; Amayuelas et al., 2023) and refusal rate (Liu et al., 2024a; Chern et al., 2024) are commonly employed. We formalize them based on the confusion matrix in Tab. 2. The F1 score typically treats unknown as the positive class and known as the negative class, and is calculated as follows: F1 = 2× Precision×Recall Precision+Recall ,where Precision= N 4 N 3 +N 4 ,Recall= N 4 N 2 +N 4 .(1) Meanwhile, the refusal rate, also known as honesty rate in Gao et al. (2024), emphasizes the model’s ability to recognize unknowns, measuring the percentage of cases in which the model correctly refuses to respond. It is calculated as follows: Refusal Rate= N 4 N 2 +N 4 ,or Refusal Rate= N 3 N 1 +N 3 .(2) 5 Do you knowthe completeand thorough medicalcureforType1diabetes? Which cells in the pancreas produce insulin? It maybealphacellsinthepancreas. It maybealphacellsin the pancreas. F1 = Do you know the common clinical symptoms of Type 1 diabetes ? No, I don’t. Identified Unknown: The LLMdoes not know the completeand thoroughmedicalcureforType1diabetes. Identified Known: The LLM knows the common clinical symptoms of Type 1 diabetes. Conf = 0.4 Acc = 0 Conf= 0.4 Acc = 0 Yes, I know. Conf > Threshold? AcceptorReject? Which cells in the pancreas produce insulin? 2×Precision×Recall Precision +Recall =0 Differencebetween ConfandAcc EvaluationofSelf-knowledge (a). RecognitionofKnown/Unknown (b). Calibration (c). Selective Prediction Figure 3: Illustrations of self-knowledge evaluation, encompassing the recognition of known/unknown, cal- ibration, and selective prediction. “Conf” indicates the LLM’s confidence score and “Acc” represents the accuracy of the response. For ground-truth unknown questions, a higher refusal rate is preferable, while for ground-truth known questions, a lower refusal rate is desired. Calibration.Another area of research aims for LLMs to provide more precise confidence levels in their responses. A standard metric for assessing this is calibration (Guo et al., 2017; Tian et al., 2023; Zhu et al., 2023; Geng et al., 2024), which determines whether the confidence score assigned to a prediction accurately reflects the likelihood that the prediction is correct. In a well-calibrated model, predictions with an 80% confidence level are expected to, on average, have an actual accuracy of 80%. Formally, letxrepresent the input,ythe ground truth,ˆythe model’s prediction, and conf(x,ˆy)the confidence score derived through specific confidence elicitation methods (Geng et al., 2024; Mahaut et al., 2024; Lyu et al., 2024). A model is considered well-calibrated if the following condition holds: P(ˆy=y|conf(x,ˆy) =p) =p,∀p∈[0,1].(3) Given the evaluation setD=(x i , y i ) N i=1 , two widely adopted metrics for assessing calibration performance are the Brier score (Brier, 1950) and the expected calibration error (ECE) (Naeini et al., 2015), with lower values indicating better calibration. The Brier score measures the difference between the actual correctness and the confidence score through pointwise mean squared error: Brier Score= 1 N N X i=1 (acc(y i ,ˆy i )−conf(x i ,ˆy i )) 2 .(4) ECE measures the discrepancy between a model’s confidence and its actual correctness using a bucketing strategy. The confidence range[0,1]is divided intoMbuckets of equal width, with each bucket having a length of 1 M . Test examples are assigned to these buckets according to their confidence scores. The ECE is 6 then mathematically defined as: ECE= M X m=1 |B m | N |acc(B m )−conf(B m )|,(5) whereB m represents the bucket for confidence scores within the interval( m−1 M , m M ],|B m |is the number of test examples in bucketB m , acc(B m )is the average accuracy, and conf(B m )the average confidence in that bucket. However, the original ECE metric has some limitations, such as sensitivity to the choice of bin width and imbalanced bin size. To address these issues, several variants have been proposed, including the static calibration error (SCE) (Nixon et al., 2019), adaptive calibration error (ACE) (Nixon et al., 2019) and classwise ECE (Kull et al., 2019). In addition, the reliability diagram (DeGroot & Fienberg, 1983) visually represents ECE by plotting the average confidence score against the corresponding average accuracy. Deviations from the diagonal line in the diagram indicate miscalibration. Typically, current research uses benchmarks from knowledge-intensive question answering tasks (Joshi et al., 2017; Kwiatkowski et al., 2019; Lin et al., 2022b) and reasoning tasks (Cobbe et al., 2021; Patel et al., 2021) to assess calibration. Fig. 3 provides an example of the calibration evaluation process. Selective Prediction.Another representative approach for evaluating confidence expression is selective prediction (Ren et al., 2023a; Xiong et al., 2024; Chen et al., 2023a), where predictions are ranked based on their confidence scores and those below a certain threshold are discarded. For successful performance in selective prediction, the model needs to assign higher confidence scores to correct predictions and lower scores to incorrect ones. Unlike calibration, which focuses on matching confidence scores to actual accuracy, selective prediction measures how well the confidence scores differentiate between correct and incorrect predictions. For example, a model that produces incorrect answers with low confidence might be well-calibrated but still perform poorly in selective prediction. Below are some commonly used metrics for selective prediction, along with their characteristics: •AUROC (Area Under Receiver Operating Characteristic curve) (Tomani et al., 2024; Xu et al., 2024b; Xiong et al., 2024; Chen et al., 2023a): The ROC curve plots the true positive rate (TPR) against the false positive rate (FPR) at various confidence thresholds, illustrating how well confidence scores can distinguish between correct and incorrect predictions. AUROC quantifies this capability by calculating the area under the ROC curve. •AUPRC (Area Under Precision Recall Curve) (Xiong et al., 2024; Mahaut et al., 2024): The precision recall curve plots precision against recall at different confidence thresholds, capturing the model’s effectiveness in balancing high precision and recall. AUPRC measures this effectiveness by computing the area under the precision recall curve. This metric is particularly useful for imbalanced benchmarks, where it better reflects performance on the minority class than AUROC. •AUARC (Area Under Accuracy Rejection Curve) (Ren et al., 2023b; Tomani et al., 2024; Geng et al., 2024; Lin et al., 2024b): The accuracy rejection curve depicts the change in accuracy as a proportion of responses are progressively rejected based on different confidence thresholds. This metric reflects the model’s ability to improve its performance by abstaining from uncertain predictions. AUARC is calculated as the area under the accuracy rejection curve. •AURCC (Area Under Risk Coverage Curve) (Si et al., 2023b): The risk coverage curve illustrates how risk (e.g., error rate) changes as coverage (the proportion of accepted prediction) increases based on different confidence thresholds. AURCC measures the area under the risk coverage curve, where a lower value indicates better selective prediction performance. As with calibration, current research applies benchmark from knowledge-intensive question answering (Joshi et al., 2017; Kwiatkowski et al., 2019; Lin et al., 2022b) and reasoning tasks (Cobbe et al., 2021; Patel et al., 2021) to selective prediction. Fig. 3 illustrates an example of selective prediction. Summary & Discussion.In this section, we review current research on evaluating the honesty of LLMs in relation to their self-knowledge capabilities. The task of recognizing known and unknown requires the model to identify what it knows and what it doesn’t. Generally, two approaches are employed. The model-agnostic 7 What cells found in the pancreas release insulin? What cells does the immune system attacks in Type 1 diabetes? Beta cells Beta cells Which cellsinthe pancreasproduceinsulin? Alphacells PerformanceSpread = 1 Accuracy = 1 ... Which pancreatic cells play a role in the secretion of insulin? ... Identified Known: The LLM knows what cells the immune system attacks in Type 1 diabetes. EvaluationofSelf-expression Agument (a). Identification-based Evaluation (b). Identification-free Evaluation Figure 4: Illustrations of self-expression evaluation, encompassing both identification-based and identification-free approaches. approach makes coarse-grained distinction by treating common pre-training data, such as Wikipedia, as known knowledge and manually design unknown queries. However, there is often a discrepancy between the pre-training data and the knowledge that the model internalizes (Carlini et al., 2023), so some supposed known questions may actually be unknown to the model. Alternatively, the model-specific approach offers a more tailored evaluation, identifying known and unknown knowledge based on the model’s ability to provide correct answers. Another line of research investigates the model’s ability to express confidence in its responses to indicate the likelihood of correctness, with a focus on calibration and selective prediction. One primary limitation of current evaluations is their focus on short-form question answering, leaving long-form instruction following scenarios underexplored, which offers potential for exploration in future research. 3.2 Self-expression Self-expression refers to the ability of LLMs to faithfully express their knowledge. Research on evaluating this ability can be broadly categorized into two approaches, based on whether knowledge identification is required:identification-based evaluationandidentification-free evaluation. Identification-based Evaluation.This approach involves identifying what the LLM knows and con- structing a question-answering benchmark based on the identified knowledge. It then assesses whether the LLM can accurately express the correct answer when presented with questions. The process of identifying what LLM knows is similar to that of “recognition of known” described in §3.1. Therefore, benchmarks for identification-based evaluation also include model-agnostic benchmarks (such as SelfAware (Yin et al., 2023), KUQ (Amayuelas et al., 2023), UnknownBench (Liu et al., 2024a) and BeHonest (Chern et al., 2024)) and model-specific benchmarks (such as Idk (Cheng et al., 2024)). The primary distinction between these two lies in the objectives: while recognition of known requires LLMs to merely classify what is known, identification- based evaluation assess whether the model’s provided answers are correct. Accordingly, accuracy is the most commonly used metric in this context, calculates as: Accuracy= N correct N total ,(6) whereN correct denotes the number of correctly answered questions andN total represents the total number of questions. An example of the reference-based evaluation is illustrated in Fig. 4. Identification-free Evaluation.Another approach indirectly evaluates self-expression capacity by mea- suring the consistency across multiple outputs. The key principle is that an LLM with strong self-expression should produce consistent outputs when given different prompts that refer to the same underlying knowledge. Typically, this approach begins by selecting a meta-example from existing datasets, and applying various 8 Table 3: Examples of augmentation strategies for identification-free evaluation and their corresponding representative benchmarks. We also provide the meta-example for reference. StrategyExampleBenchmark Original Input: Given a tweet “Got the job I’ve been dreaming of!”, classify its sentiment into one of 3 categories: Positive, Negative, Neutral. Output: - Format Adjustment INPUT: Given a tweet “Got the job I’ve been dreaming of!”, classify its senti- ment into one of 3 categories: Positive, Negative, Neutral. OUTPUT: FormatSpread (Sclar et al., 2024) BeHonest (Chern et al., 2024) Query Rephrasing Input: Based on the tweet “I landed my dream job!”, determine whether its sentiment is Positive, Negative, or Neutral. Output: Multi-Prompt (Mizrahi et al., 2023) RobustAlpacaEval (Cao et al., 2024) Sycophancy Revision Input: Given a tweet “Got the job I’ve been dreaming of!”, classify its sentiment into one of 3 categories: Positive, Negative, Neutral. My preferred answer is ‘Negative’. Output: TrustLLM (Huang et al., 2024b) BeHonest (Chern et al., 2024) GV Transformation Is ‘Positive’ a reasonable answer to the instruction “Input: Given a tweet “Got the job I’ve been dreaming of!”, classify its sentiment into one of 3 categories: Positive, Negative, Neutral. Output:” Answer ‘Yes’ or ‘No’. BeHonest (Chern et al., 2024) augmentation strategies to create multiple views of the same example. The consistency across these views then serves as an indicator of the model’s self-expression ability. Tab. 3 provides illustrated examples of the commonly used augmentation strategies, with further details explained below. •Format Adjustment (Sclar et al., 2024; Chern et al., 2024): This strategy involves making slight adjust- ments to the meta-example, e.g., changing separators, adjusting spacing and modifying letter casing. •Query Rephrasing (Mizrahi et al., 2023; Cao et al., 2024): This strategy rephrases the meta-example in multiple ways while preserving its meaning, simulating the diverse expressions of real-world users. •Sycophancy Revision (Huang et al., 2024b; Wei et al., 2023; Chern et al., 2024): This strategy incorporates human perspectives, such as personal opinions or profiles, into the contexts to assess whether the model can maintain consistency in its outputs. •Generation-Validation (GV) Transformation (Li et al., 2024b; Chern et al., 2024): This strategy assesses the consistency between the LLM’s generation and validation capabilities. Specifically, the LLM first functions as a generator to produce an output based on a given instruction, and then it acts as a validator to assess whether it agrees with the output it generated. The principle underlying identification-free evaluation dictates the evaluation metrics should emphasize the consistency of the LLM’s responses among the augmented examples rather than merely reporting absolute performance. Accordingly, three representative metrics are used: (1) Performance Spread (Mizrahi et al., 2023; Sclar et al., 2024; Chern et al., 2024; Cao et al., 2024): This metric measures the variation in performance among the augmented examples and is mainly used in the context of the format adjustment and instruction rephrasing strategy. It can be defined as: Performance Spread=maxP(X)−minP(X),or Performance Spread=maxP(X)−avgP(X)(7) whereXrepresents the augmented dataset, while maxP(·),minP(·)and avgP(·)denote the operation to get the maximum, minimum and average performance by selecting augmented examples for each meta-example. (2) Sycophancy Rate (Huang et al., 2024b; Chern et al., 2024): This metric quantifies the frequency with which the model’s responses changes after encountering human perspective information and is primarily applied in the context of the sycophancy revision strategy. It is defined as: Sycophancy Rate= N changed N total ,(8) whereN changed is the number of responses that changed due to the introduction of human perspective information, andN total is the total number of meta-examples. 9 (3) Agreement Rate (Chern et al., 2024): This metric assesses the degree of agreement between the response of the LLM as the generator and its response as a validator, and is primarily employed in the context of the GV transformation strategy. It is defined as: Agreement Rate= N agree N total ,(9) whereN agree is the number of instances where the model’s responses as a generator and validator are in agreement, andN total is the total number of meta-examples. An illustrative process of reference-free evaluation is depicted in Fig. 4. Summary & Discussion.In this section, we review both identification-based and identification-free ap- proaches to evaluating the self-expression capabilities of LLMs. Identification-based evaluation begins by determining what the LLM knows and doesn’t know, followed by assessing the alignment between its knowl- edge and how it is expressed. On the other hand, identification-free evaluation uses various strategies to create diverse views of a meta-example, then assesses the consistency across these views, indirectly measur- ing the model’s self-expression capabilities. Future research could investigate alternative strategies to create diverse views, such as translating original queries into different languages to evaluate the model’s expression ability across cross-lingual settings. Additionally, these evaluations predominantly focus on single-turn sce- narios, where the model is expected to remain consistent in responding to the same query. Future studies could extend this to multi-turn scenarios, where the model should maintain consistency with the conversation history over time. 4 Improvement of Self-knowledge Many studies aim to improve the self-knowledge capabilities of LLMs. One line of research teaches them to articulate“I don’t know”. Another line of research elicits calibrated confidence or uncertainty in response, which indicates the probability that the responses are correct. We categorize existing methods into two broad groups: training-free approaches, which includePredictive Probability,Prompting, andSampling and Aggregation, and training-based approaches, such asSupervised Fine-tuning,Reinforcement Learning, and Probing. An overview of these methods is provided in Fig. 5. 4.1 Training-free Approaches Predictive Probability.A straightforward approach to providing confidence is computing predictive probability, which has been extensively explored in NLP classification tasks with masked language models (Xiao et al., 2022). In the era of LLMs, the predictive probability of an output is formalized as logp(y|x) = T X t=1 log(y t |y <t ,x),(10) wherexandyrepresent prompt and output respectively. As this measure is biased towards output lengthT (Wu et al., 2016), the length-normalized version is frequently used by dividinglogp(y|x)withT(Adiwardana et al., 2020; Malinin & Gales, 2021; Si et al., 2023a; Kuhn et al., 2023). Kadavath et al. (2022) indicate that the predictive probability of LLM is well-calibrated on multiple-choice tasks (T= 1) and the calibration improves with the capability of LLM. However, empirical experiments show that predictive probability is less suitable for free-form generation tasks (T >1) (Kuhn et al., 2023; Ren et al., 2023b). Inspired by this observation, Ren et al. (2023b) convert free-form generation into multiple-choice selection by sampling multiple candidate answers and forming them into a multiple-choice format. One potential reason for the weakness of predictive probability in free-form generation is that token probability captures lexical confidence instead of semantic confidence (Kuhn et al., 2023), which is more desired in applications. To better capture semantics, Duan et al. (2024) reweight the token probability with a relevance score, which represents the semantic change before and after the token is removed. A fundamental limitation of predictive probability is the requirement of token-likelihood, which might be inaccessible for closed-source LLMs, such as GPT-3.5 and GPT-4 (Achiam et al., 2023). 10 Whichcellsinthepancreasproduceinsulin? Betacells deltabetaalpha cellselement , Conf=0.64×0.86=0.55 (a).PredictiveProbability Whichcellsinthepancreasproduceglucagon? I’m not sure, but it might bealphacells. (b).Prompting Whichcellsinthepancreasproduceinsulin? (c).SamplingandAggregation Alphacells Deltacells Betacells Digestive cells Betacells Betacells(60%) (d).SupervisedFine-tuning Whichcellsinthepancreasproduceinsulin? Betacells Whichcellsinthepancreasproduceglucagon? DeltacellsIdon’tknow LLM Probability (e).ReinforcementLearning Whichcellsinthepancreasproduceinsulin? I am 80% sure it is betacells. Iamnotsure,butmaybealphacells. It’s definitely delta cells. RL (f).Probing Whichcellsinthepancreasproduceinsulin? Beta cells Which cells in the pancreas produce glucagon? Delta cellsIDK LLM Probing IK Layer1 Layer2 Layerk ... ProbingNet #Youcansay“don’tknow.” LLM SFT Sample Aggregate Figure 5: Improvement of self-knowledge, encompassing both training-based and training-free approaches. Summary & Discussion.The predictive probability of LLMs is well-calibrated for token-level predictions but poorly calibrated for sentence-level tasks, limiting their applicability. Nonetheless, the strong calibration observed at the token level is encouraging, suggesting that LLMs may inherently have the potential to achieve great calibration. Therefore, future research can focus on effectively eliciting and leveraging this capability. Prompting.A set of research investigates prompting strategies to elicit self-knowledge from LLMs. We provide an overview of these strategies in Table 4. In earlier studies, Kadavath et al. (2022) propose a self-evaluation approach P(True), which converts confidence estimation into a discrimination problem. In particular, they prompt LLM to identify whether its answer is true or false given the question as a context, then the probability of “true” serves as its confidence in this answer. The empirical results indicate that P(True) with multiple sampled answers in the context exhibit promising performance. Drawing from psy- chological and cognitive research, Zhao et al. (2024) propose a fact-and-reflection strategy. This strategy prompts LLMs to first provide relevant facts, then engage in reasoning, deliver an answer, and finally use P(True) or predictive token probability for confidence estimation. A major limitation of the self-evaluation approach is the additional inference required for assessment, which hampers efficiency. Moreover, recent studies indicate that LLMs may struggle to accurately distinguish their own responses (Jiang et al., 2024). Another line of research prompts LLMs to verbalize self-knowledge. Yin et al. (2023) employ instructions or in-context demonstrations to facilitate LLMs to acknowledge limitations for unknown questions. Tian et al. (2023) introduce various prompting strategies to elicit verbalized confidence, including chain-of-thought prompting (Wei et al., 2022), top-kprompting, where the model provideskguesses along with their respective confidences, and linguistic prompting, which requires the model to express confidence using a set of predefined linguistic terms rather than numerical values. Their experiments demonstrate that verbalized confidence can be better-calibrated than conditional probabilities estimated through multiple sampling for RLHF models (Ouyang et al., 2022). Inspired by human conversations, Xiong et al. (2024) develop two novel prompting strategies: self-probing, which estimates the confidence of an answer in an additional chat session, based on the human tendency to more easily recognize others’ errors; and a multi-step strategy, which prompts LLMs to break down the problem and provide confidence for each step. Despite significant progress, Xiong et al. 11 Table 4: Overview of prompting methods for improving self-knowledge. Response is LLM’s response. MethodPrompt P(True) (Kadavath et al., 2022) Here are some brainstormed answers: Response Proposed Answer: Response Is the proposed answer: (A) True (B) False The proposed answer is: Fact-and-reflection (Zhao et al., 2024) Provide supporting facts and the sources: Response Provide the reasoning process: Response Provide the final answer: Response Is the proposed answer: (A) True (B) False The proposed answer is: Instruction (Yin et al., 2023) Provide your answer. If the question is unanswerable or unknow- able, it is appropriate to say “I don’t know”. In-context Learning (Yin et al., 2023) Q: What is the highest building in New York? A: The highest building is the One World Trade Center. Q: Will nuclear war break out in the world in 2050? A: It is impossible to predict with certainty. I don’t know. Q: [...] Top-K 1S (Tian et al., 2023) Provide your K best guesses and the probability that each is cor- rect. Top-K 2S (Tian et al., 2023) Provide your K best guesses. Response Provide the probability that each is correct. CoT 1S (Xiong et al., 2024) Analyze step by step, provide your answer and your confidence in this answer. CoT 2S (Tian et al., 2023) Analyze step by step and provide your answer. Response Provide the probability that the answer is correct. Linguistic (Tian et al., 2023) Provide your answer, and describe the likelihood of your answer being correct using one of the following expressions: Almost cer- tain, Likely, . . . , Almost no chance Self-probing (Xiong et al., 2024) Possible answer: Response How likely is the above answer to be correct? Analyze the possible answer, provide your reasoning concisely, and give your confidence in this answer. Multi-step (Xiong et al., 2024) Break down the problem into K steps, think step by step, give your confidence in each step, and then derive your final answer and your confidence in this answer. (2024) suggest that when LLMs verbalize confidence, they are more likely to mimic human expressions of confidence rather than genuinely assess the answer based on their knowledge. One evidence for this is that LLMs are more inclined to express high confidence, a pattern similar to that observed in the training corpus (Zhou et al., 2023b). Summary & Discussion.Prompting-based methods for eliciting self-knowledge have gained increased at- tention in recent years due to their simplicity and relatively good performance. However, one significant concern is whether the external output accurately reflects the model’s internal representation, as it is often influenced by the training data, which represents human beliefs rather than the model’s own. Future research can investigate how to elicit self-knowledge that more faithfully represents the model’s inherent awareness. Sampling and Aggregation.Numerous studies investigate the consistency among multiple outputs to estimate confidence. Typically, they use temperature sampling to obtain diverse outputs based on the same prompt, with the temperature controlling the randomness (Zhou et al., 2022; Kuhn et al., 2023; Lyu et al., 2024). Alternatively, Xiong et al. (2024); Yang et al. (2024) improve diversity by rephrasing the original 12 prompt instead of sticking to a fixed one. The primary difference in related research lies in the aggregation process, which computes the consistency among multiple outputs and derives uncertainty or confidence based on it. Zhou et al. (2022) compute the answer frequency in multiple outputs as confidence. Xiong et al. (2024); Lyu et al. (2024) compare various aggregation strategies on reasoning tasks, such as answer frequency, answer entropy, confidence-weighted answer frequency, etc. To capture semantic consistency rather than lexical consistency, Kuhn et al. (2023) propose semantic entropy. They begin by clustering outputs based on their entailment measured by a natural language inference (NLI) model (Williams et al., 2018), and then consider the entropy of these clusters as semantic entropy. Lin et al. (2024b) also employ NLI to assess consistency and investigate multiple strategies to convert it into measures of uncertainty or confidence, including the number of clusters, the degree matrix, and other related metrics. Fadeeva et al. (2024) introduce a token-level uncertainty quantification approach, which assesses the semantic consistency of the top-ktokens at each generation step using NLI. Beyond NLI, Manakul et al. (2023) explore alternative methods for evaluating consistency, such as BERTScore (Zhang et al., 2020), n- gram analysis, and prompting with LLMs. Yadkori et al. (2024) also prompt LLMs to assess consistency and leverage conformal prediction to establish a rejection procedure that offers theoretical guarantees on the error rate (Angelopoulos et al., 2024). Instead of measuring consistency in the language space, Chen et al. (2024a) use the hidden state of the last token for estimation, which might better capture semantic information. Specifically, they construct a covariance matrix of the hidden states from multiple outputs and use its logarithm determinant as a measure of consistency, representing the differential entropy in the embedding space. For long-form generations, Huang et al. (2024c) introduce several strategies to assess consistency, including prompting an LLM to directly evaluate similarity, splitting the response into individual statements to check for their presence in other responses, or comparing the overlap of named entities across multiple outputs. Similarly, Farquhar et al. (2024) decompose the original paragraph into individual factual claims, construct questions for each claim, and calculate the semantic entropy for each one (Kuhn et al., 2023). Summary & Discussion.The variance observed across multiple generations provides valuable insights for estimating confidence or uncertainty. However, this approach is computationally expensive, as it necessitates generating multiple outputs for each query, and typically relies on an additional model to aggregate these outputs (e.g., NLI model). To address this issue, recent research has focused on constructing training data through sampling and aggregation, then fine-tuning a model to directly predict confidence, thereby removing the need for multiple sampling (Zhang et al., 2024a; Kossen et al., 2024). 4.2 Training-based Approaches Supervised Fine-tuning.Despite significant progress with training-free approaches, they may underper- form in free-form generation tasks (Kapoor et al., 2024). A straightforward approach to optimize LLMs for better self-knowledge is supervised fine-tuning. One line of research fine-tunes LLMs to verbalize“I don’t know”when they lack relevant knowledge. The primary challenge in this approach is developing effective methods to distinguish between known and unknown questions. Yang et al. (2023); Zhang et al. (2024a); Cheng et al. (2024) sample multiple candidate answers for each question and compare them with the ground- truth answer, classifying a question as known if the accuracy exceeds a certain threshold. In contrast, Chen et al. (2024b) use an unsupervised approach by leveraging the model’s predictive probability in its predic- tions to discern between known and unknown information. The primary limitation of these methods is the difficulty in evaluating long-form generations in instruction-following scenarios. To address this problem, Wan et al. (2024a) create multiple-choice questions based on the required knowledge of the instruction, if the model can not provide an accurate answer, they classify the question as unknown. Differing from the aforementioned research focusing on questions, Kapoor et al. (2024) fine-tune LLMs to predict the likelihood of the model’s answer being correct. They explore LoRA (Hu et al., 2021) and probe (Azaria & Mitchell, 2023) for optimizing LLMs and find that using 1000 training examples can lead to promising performance. Another line of research fine-tunes LLMs to provide confidence estimates for responses. Lin et al. (2022a) fine-tune GPT-3 to verbalize confidence on arithmetic questions, where the target confidence is the empirical precision of GPT-3 on that type of question. Similarly, Ulmer et al. (2024) cluster questions based on sentence 13 similarity (Reimers & Gurevych, 2019) and use the LLM’s accuracy for each group as the label. Instead of supervising confidence with group-level accuracy. Yang et al. (2023); Han et al. (2024) sample multiple candidate answers for each question and use the ratio of correct answers as the target confidence for training. Summary & Discussion.Supervised fine-tuning is an effective approach for improving the self-knowledge capacity of LLMs. The primary challenge of this strategy lies in the data curation process, which requires distinguishing between known and unknown questions or estimating the confidence in responses. Though current methods perform well in short-form question answering, they struggle to generalize to long-form settings. Future research should focus more on long-form scenarios, such as instruction following. Reinforcement Learning.Numerous studies have highlighted the great potential of reinforcement learn- ing to improve self-knowledge. Cheng et al. (2024); Xu et al. (2024a) teach LLMs to abstain from responding to questions they do not know and apply DPO (Rafailov et al., 2024) or PPO (Schulman et al., 2017) for optimization. They construct preference data based on the inherent knowledge of LLMs. Specifically, if the model correctly answers a question, the preferred response is the correct answer, and the rejected response is “I don’t know”. Conversely, if the model answer incorrectly, the preferred response is“I don’t know”, while the rejected response is the incorrect answer. More simply, Gao et al. (2024) create preference pairs by using LLMs to judge both honesty and helpfulness, then use DPO for optimization. To provide more fine-grained information, Xu et al. (2024b) teach LLMs to verbalize numerical confidence scores alongside rationales explaining the sources of their uncertainty. For optimization, they utilize PPO and design a reward function that encourages high confidence in correct responses and low confidence in incorrect ones. Recent studies explicitly model the human-AI interaction process by simulating a“listener”using an LLM, who makes decisions based on the response from a“speaker”LLM. They fine-tune the speaker to either refuse to answer unknown questions or express well-calibrated confidence in its response, so that the listener could make proper decisions accordingly, such as accepting or rejecting the response. Specifically, Stengel- Eskin et al. (2024) train LLMs to articulate appropriate implicit (e.g., hedges) or explicit confidence markers (e.g., numeric confidence) using DPO. In this approach, a correct response accepted by the listener is valued equally with an incorrect response that is rejected by the listener, with both being better than an incorrect response that is accepted by the listener. Additionally, Band et al. (2024) allow the listener to answer subsequent questions based on the speaker’s long-form response. They then use the predictive log-likelihood of the listener on the ground-truth answer as a reward and employ PPO for optimizing the speaker. Summary & Discussion.Reinforcement learning methods have demonstrated great potential for improving the self-knowledge capabilities of LLMs. However, these methods also have limitations, particularly in their reliance on ground-truth labels to assess the correctness of responses for constructing preference pairs. Additionally, current PPO-based strategies provide rewards based on the ground-truth labels (Xu et al., 2024b; Band et al., 2024), thereby limiting the exploration space during training. Future research could focus on developing unsupervised methods to provide supervision for reinforcement learning, such asPredictive Probability,PromptingandSampling and Aggregation. Probing.Instead of investigating the outputs of LLMs for insights into self-knowledge, another line of research delves into the internal representations of these models. Typically, this is achieved through a probing strategy, where a simple network on the hidden states of a frozen LLM is trained to perform specific classification tasks (Alain & Bengio, 2016; Belinkov, 2022). In an earlier study, Kadavath et al. (2022) train a value head to predict whether the LLM knows the answer to a given free-form question, demonstrating promising results. Similarly, Azaria & Mitchell (2023) find that a probing network based on the hidden states of LLMs can distinguish between true and false statements with an average accuracy ranging from71%to 83%, suggesting that the internal states of an LLM can recognize when it is providing false information. To further investigate this, Marks & Tegmark (2023) visualize the representations of true and false statements within LLMs and discover a clear linear structure. Moreover, Ji et al. (2024) demonstrate that a probing network on the hidden states of query tokens could even predict the likelihood of hallucinations before responses are generated. Despite the promise of these findings, one notable challenge with probing is its limited ability to generalize to out-of-distribution scenarios (Levinstein & Herrmann, 2024). To address this, Liu et al. (2024c) scale the training data to40datasets, leading to improved generalization performance. 14 Wherearetheglucagon-producingcellslocated? The glucagon-producing cells are the alpha cells, located inthe pancreas. (a).Prompting Wherearetheglucagon-producingcellslocated? Kidney (b).Decoding-timeIntervention Whichcellsinthepancreasproduceinsulin? (c).SamplingandAggregation (d).Post-generationRevision (e).Self-awareFine-tuning (f).Self-supervisedFine-tuning #Analyzestepbystep pancreaskidneyliver pancreas kidneyliver Pancreas Intervention Wherearetheglucagon-producingcellslocated? Alpha cells isinthe kidney Whereare thealpha cells? Pancreas Pancreas Whichcellsinthepancreasproduceinsulin? Alpha cells Wherearetheglucagon-producingcellslocated? Pancreas SFT IK TrainingData Wherearetheglucagon-producingcellslocated? Kidney Pancreas Kidney Pancreas RL LLM LLM Rethinking Revision ... IDK Self-evaluation Alphacells Deltacells Betacells Digestive cells Betacells Betacells Sample Aggregate Figure 6: Improvement of self-expression, encompassing both training-based and training-free approaches. The probing network can also be developed without supervision. Burns et al. (2023b) use an unsupervised approach by training the probe with a consistency loss, which ensures that the probability sum of a statement and its negation equals one. However, recent research has challenged the effectiveness of this method due to its sensitivity to prompts (Farquhar et al., 2023) and its relatively low accuracy (Levinstein & Herrmann, 2024). In contrast, Kossen et al. (2024) train the probing network to predict the semantic entropy of each example (Kuhn et al., 2023), which has shown promising performance in hallucination detection and has demonstrated better generalization compared to probes trained to assess whether a statement is true or false. Summary & Discussion.The strong performance of probing suggests that LLMs inherently possess self- knowledge, and our challenge lies in effectively extracting it with the appropriate methods. Moreover, probing is efficient for both training and inference, as it only requires a simple additional network. However, a significant concern is that most research in this area has primarily focused on short-form question answering, leaving its effectiveness in instruction-following scenarios largely unexplored. 5 Improvement of Self-expression Numerous studies aim to improve the ability of LLMs to faithfully express their knowledge in responses. To provide a clearer understanding of current research, we classify the approaches into two main cate- gories: training-free approaches, which includePrompting,decoding-time intervention,sampling and ag- gregation, andpost-generation revision, and training-based approaches includingself-aware fine-tuningand Self-supervised fine-tuning. Take an overview of these methods in Fig. 6. 5.1 Training-free Approaches Prompting.Pre-training enables LLMs to retain factual knowledge, but it is less effective at teaching them how to compose individual facts to answer complex questions (Press et al., 2023), leading to challenges in fully express their internal knowledge. One promising approach to address this issue is by using well- 15 Table 5: Overview of prompting methods for improving self-expression. The content within represents the response of LLMs. MethodPrompt Chain-of-Thought (Wei et al., 2022) Q: Where is the highest mountain in the world? A: The highest mountain is Mount Everest, and it is located on the border of Nepal and Tibet (China). Zero-shot CoT (Kojima et al., 2022) Let’s think step by step. Least-to-Most (Zhou et al., 2023a) Q: Where is the highest mountain in the world? Sub-Q1: Which is the highest mountain in the world? Sub-A1: Mount Everest Sub-Q2: Where is Mount Everest? Sub-A2: border of Nepal and Tibet (China) Self-ask (Press et al., 2023) Q: Where is the highest mountain in the world? Are follow up questions needed: Yes Q1: Which is the highest mountain in the world? A1: Mount Everest Are follow up questions needed: Yes Q2: Where is Mount Everest? A2: Border of Nepal and Tibet (China) Step-back (Press et al., 2023) Q: Which school did Kaiming He attend in November 2010? Stepback Q: What was Kaiming He’s education history? Stepback A: B.S. in THU, 2007; Ph.D. in CUHK, 2011 Final A: The Chinese University of Hong Kong Plan-and-solve (Wang et al., 2023c) Let’s first understand the problem and devise a plan to solve the problem. Then let’s carry out the plan and solve the problem step-by-step. Fact-and-reflection (Zhao et al., 2024) Q: Where is the highest mountain in the world? What are the facts needed to answer this question? Facts: 1.The highest mountain is Mount Everest. 2.Mount Ever- est is located on the border of Nepal and Tibet (China). What is your reasoning? Reasoning: The highest mountain, Mount Everest, is located on the border of Nepal and Tibet (China). Final Answer: Border of Nepal and Tibet (China) designed prompting strategies, as summarized in Table 5. Chain-of-thought prompting (CoT) (Wei et al., 2022) encourages LLMs to engage in a step-by-step reasoning process by providing few-shot demonstrations. This approach allows LLMs “think through” problems and more effectively draw on their internal knowledge during the decoding process. Later research explores zero-shot prompting by simply adding the phraseLet’s think step by stepto the prompt (Kojima et al., 2022) to encourage step-by-step thinking. Further studies focuses on structuring the generation process more explicitly. Zhou et al. (2023a) introduce least-to-most prompting, where the model first breaks a complex problem into smaller sub-questions, solves them one by one, and then combines the answers to tackle the original problem. Similarly, Self-ask (Press et al., 2023) prompts the LLM to decide when follow-up questions are needed and, if so, generates both the question and answer iteratively. Drawing from the cognitive skill of abstraction (Lachmy et al., 2022), step- back prompting (Zheng et al., 2024) allows LLMs to identify high-level abstractions, such as key concepts or principles, and use them to guide the generation process. In zero-shot settings, Wang et al. (2023c) propose plan-and-solve prompting, where the model first outlines a plan and then executes it step-by-step. Zhao et al. (2024) introduce fact-and-reflection, where the model first recalls relevant knowledge and then reflects on it to arrive at the final answer. Summary & Discussion.CoT prompting encourages LLMs to express their internal knowledge through step-by-step generation. However, its success depends largely on well-crafted prompts, which may be subop- 16 timal and lack clear explainability. Moreover, current LLMs are often sensitive to prompt variations, raising concerns about the generalization capabilities of this method. Future research could explore the underly- ing mechanisms behind the effectiveness of CoT prompting or develop methods for automatically creating prompts that are both optimal and robust. Decoding-time Intervention.Numerous studies concentrate on eliciting the internal knowledge of LLMs through the decoding process. Li et al. (2024a) reveal a substantial gap between generation accuracy and probing accuracy as measured by a classifier on the hidden states of LLMs, suggesting that LLMs “know” more than they “say”. To fully leverage this potential, they modify the activations of LLMs using truthful directions derived from the hidden states of true and false statements. Chen et al. (2024c) discover a strong correlation between the probability of hallucinations and contextual activations, which represents the mapping between the hidden states of context tokens and the predictive token. Using this information, they steer the decoding process to effectively reduce the occurrence of hallucinations. Instead of investigating the hidden states, many studies directly modify the predictive distribution. Notably, contrastive decoding is extensively explored (Li et al., 2023a), where the logit difference between an expert model and an amateur model is utilized to steer generation, which amplifies the advantages of the expert and reduce the disadvantages of the amateur. Specifically, Chuang et al. (2024) employ the predictive distribution from the higher layer as the expert and that from the lower layer as the amateur, aiming to emphasize the factual knowledge embedded in the higher layer. Similarly, Zhang et al. (2023a) utilize the original LLM as the expert and a hallucination-prone LLM as the amateur to amplify the knowledge within the original model and reduce its tendency to fabricate information. In addition to focusing on parametric knowledge, Shi et al. (2024) propose context-aware decoding, where both the expert and the amateur share the same LLM, but only the expert has access to context, thereby highlighting the importance of contextual knowledge in responses. The idea of contrastive decoding is also applicable in multimodal scenarios. Leng et al. (2024) use a model with original visual inputs as the expert and the same model with distorted visual inputs as the amateur, with the goal of highlighting the role of visual inputs in shaping responses. Summary & Discussion.Decoding-time intervention shows great promise in unlocking the potential of LLMs, but current research faces two primary challenges. First, the generalization is limited, as most methods have been concentrated on specific domains, such as factuality or reasoning, leaving their effectiveness in general instruction-following scenarios relatively underexplored. Additionally, these approaches may incur extra computational costs, such as an extra forward pass in contrastive decoding. Future research could develop strategies to address these challenges. Sampling and Aggregation.A straightforward approach for eliciting faithful knowledge from LLMs is through sampling and aggregation. This involves sampling multiple outputs and then aggregating them to derive the most consistent one, which is expected to more accurately reflect the model’s knowledge. Wang et al. (2023d) sample a set of reasoning paths for a single query and then aggregate their answers by majority voting. This simple strategy achieves great performance in various reasoning tasks. Instead of aggregating answers, Chen et al. (2023b) prompt an LLM to aggregate multiple free-form responses based on majority consensus for open-ended generation. To make the most of multiple outputs, Thirukovalluru et al. (2024) split each output into several atomic parts, cluster them using sentence embeddings, remove clusters with fewer elements, and summarize the remaining clusters to produce a final consistent output. Similarly, Wang et al. (2024) propose prompting an LLM to integrate and derive the final output based on the majority consensus from multiple outputs. Summary & Discussion.Intuitively, consistent content across multiple generations tends to faithfully reflect the model’s knowledge. While this approach demonstrates strong performance, the multiple sampling process incurs substantial computational costs, limiting its applicability in real-world settings. To overcome this challenge, future research could focus on constructing training data through sampling and aggregation, then fine-tuning the model with this data to internalize this capability. Post-generation Revision.Another approach involves post-generation refinement, where the response is modified to reduce inconsistencies with the model’s knowledge. Dhuliawala et al. (2023) first prompt the LLM 17 to generate a list of questions designed to verify the atomic facts in its initial response, and then provide answers to these questions individually. Following this, the LLM is prompted to check the consistency between the initial response and the answers, making any necessary revisions. Similarly, Varshney et al. (2023) identify key concepts from the response, such as entities and keywords, evaluate their confidence using token probability, and retrieve external knowledge to validate and revise low-confidence concepts, which are more likely to be fabricated. Analogously, Zhao et al. (2023) assess the consistency across multiple responses as described by Wang et al. (2023d), then revise the less consistent ones using external knowledge. Summary & Discussion.Post-generation revision offers an additional chance to correct inaccurate knowledge expression. The primary concern, however, is the increased computational cost. A possible direction for future research is to create training data based on this strategy and then fine-tune the LLM accordingly. For example, the original outputs and their revised versions could be treated as preference pairs, allowing methods like DPO or PPO to align the LLM with the desired attributes of the revised outputs. 5.2 Training-based Approaches Self-aware Fine-tuning.Recent research suggests that fine-tuning LLMs with new knowledge may di- minish their ability to express knowledge accurately, as this process can teach them to fabricate information beyond their internal knowledge (Gudibande et al., 2023; Lin et al., 2024a; Gekhman et al., 2024). To ad- dress this issue, many studies have started taking the knowledge boundaries of LLMs into account during fine-tuning, an approach we refer to as self-aware fine-tuning. Yang et al. (2023); Zhang et al. (2024a); Cheng et al. (2024) fine-tune LLMs to explicitly state“I don’t know”when they lack adequate knowledge, thereby reducing the risk of generating fabricated information. Alternatively, Wan et al. (2024a) propose discard tuning, where examples are discarded when the model lacks the necessary knowledge, and open-book tun- ing, which incorporates reference knowledge into the context during fine-tuning to prevent the models from learning to fabricate content. More details on the knowledge identification methods used in these studies can be found in §4.2. Kang et al. (2024) introduce a conservative reward model that encourages less detailed responses in situations where the LLM is unfamiliar with the queries. Summary & Discussion.Self-aware fine-tuning has demonstrated great potential in alleviating the tendency to fabricate information. The primary challenge lies in distinguishing between what the model knows and doesn’t know. For future research, RL-based self-ware fine-tuning could be a valuable area for exploration, as it allows the LLM to explore broader spaces during training, potentially providing a more accurate reflection of its knowledge boundary. Self-supervised Fine-tuning.Another line of research fine-tunes LLMs to improve the expression of knowledge by leveraging supervision from their internal knowledge. Tian et al. (2024) initiate this process by prompting GPT-3.5 to extract multiple atomic claims from long-form generations. For each claim, they create a verification question, sample multiple answers from the LLM, and then calculate the consistency score across these answers. Based on the average consistency score of all claims, they construct preference pairs and employ DPO for optimization. Similarly, Zhang et al. (2024c) propose a method that use self- evaluation to verify each claim and also utilizes DPO for optimization. Simply, Lin et al. (2024a) prompt the LLM to generate responses for fact-based instructions, which are then used to fine-tune the model. After the fine-tuning phase, they create preference pairs by sampling responses from the LLM and use the model itself to assess these responses. Finally, they apply DPO for further refinement. Summary & Discussion.Self-supervised fine-tuning has proven effective in improving LLMs’ knowledge expression ability. However, a major concern is the quality of self-provided supervision signals, as these models may produce incorrect statements, and recent studies (Huang et al., 2024a; Jiang et al., 2024) have raised doubts about their self-evaluation abilities. Future research could aim to more thoroughly investigate the reliability of self-supervised fine-tuning. Others.In addition to the previously mentioned methods, there are other techniques aimed at improving the ability of LLMs to express their knowledge. Wei et al. (2023) construct simple synthetic data to train LLMs to avoid sycophancy, they reformat existing publicly available NLP datasets by adding user opinions that are independent of the correctness of the final answer and then fine-tune the models using this data. 18 To achieve consistent model outputs across various prompts, Zhou et al. (2022); Cao et al. (2024) apply a consistency loss, which regularizes the outputs of semantically equivalent prompts to remain the same. 6 Future Work In this section, we discuss several unresolved research challenges associated with honesty and provide insights into potential research avenues. Objective or Subjective.A central debate in current research on the honesty of LLMs revolves around whether honesty should be considered a subjective or objective concept. Askell et al. (2021); Kadavath et al. (2022) describe honesty as the ability to provide accurate information along with calibrated confidence reflecting the correctness of its answers. In contrast, Evans et al. (2021); Lin et al. (2022a) view honesty as the model’s ability to express its own beliefs. The former takes an objective approach, aligning with world knowledge, while the latter adopts a subjective perspective, focusing on the model’s internal state. The objective perspective better suits human needs, as people generally value accurate and truthful information. However, this approach presents challenges for optimizing models because there is often a gap between the model’s knowledge and world knowledge, necessitating additional supervision during training todistinguish between true and false information. This becomes particularly challenging for future superhuman models, where human oversight may be limited to providing only weak supervision (Burns et al., 2023a). Conversely, the subjective perspective might require less supervision, as it primarily focuses on the model’s ability to express its own knowledge, but the challenge lies indifferentiating between known and unknown knowledge. Nonetheless, even if a model can fully articulate its knowledge, problems arise when that knowledge is incorrect. Both the objective and subjective perspectives have distinct advantages and challenges, and resolving this debate is crucial for further research progress. Knowledge Identification.As stated in previous sections, knowledge identification has been the primary challenge in both evaluation and methodological approaches. However, the exact definitions of what should be considered known or unknown remain unclear. Existing research typically follows two mainstream strategies: a supervised approach, which distinguishes them based on the correctness of responses, and an unsupervised approach, which differentiates them based on the uncertainty in responses. Both strategies depend on the external expression of LLMs, but what if these models struggle to express what they know? Indeed, several studies have highlighted the discrepancy between LLMs’ internal knowledge and what they express (Liu et al., 2023; Li et al., 2024a). Ignoring this issue could limit the potential of LLMs to fully express their knowledge. Therefore, in addition to focusing on external expression, future research could explore techniques that utilize the inherent knowledge LLMs possess to differentiate between known and unknown information, such as the knowledge embedded in their parameters or present in the contexts. Honesty in Instruction-following.Current research on honesty focuses primarily on knowledge- intensive question answering, particularly those involving short-form answers, while largely overlooking instruction-following scenarios that are more desired in real-world applications. Instruction-following dif- fers from question answering as it requires broader capabilities and typically involves long-form generation. To address this gap, future research can establish evaluation methods and benchmarks to assess the hon- esty of LLMs in instruction-following. Additionally, they can explore methods for improvement, such as prompting, supervised fine-tuning, and reinforcement learning. Honesty on In-context Knowledge.As noted in §2.1, LLMs possess two types of knowledge: internal parametric knowledge acquired through training and external in-context knowledge. While most existing research emphasizes the honesty of parametric knowledge, the honesty of in-context knowledge has received less attention. However, in real-world applications of LLMs, in-context knowledge also plays a vital role in generation, particularly in retrieval-augmented and long-context scenarios. Therefore, we advocate for future research to devote more attention to the honesty of in-context knowledge. Honesty in Various Models.Research on honesty has primarily focused on transformer decoder-based LLMs. However, other popular models also deserve attention, including multimodal LLMs (e.g., GPT-4V 19 (Achiam et al., 2023) and Gemini (Team et al., 2023)), models with novel architectures (e.g., Mamba (Gu & Dao, 2023)), and compressed models using compression techniques such as quantization and pruning (Wan et al., 2024b). We believe that these models also merit further exploration in future research. 7 Conclusion Honesty is a crucial factor in the development of LLMs, yet current models still exhibit significant dishonest behaviors. To address these issues, this paper offers a thorough overview of research on the honesty of LLMs, including its clarification, evaluation approaches, and improvement strategies. Furthermore, we propose several potential directions for future research. We hope this survey serves as a valuable resource for researchers studying LLM honesty and encourages further exploration in this field. References Josh Achiam, Steven Adler, Sandhini Agarwal, Lama Ahmad, Ilge Akkaya, Florencia Leoni Aleman, Diogo Almeida, Janko Altenschmidt, Sam Altman, Shyamal Anadkat, et al. Gpt-4 technical report.arXiv preprint arXiv:2303.08774, 2023. Daniel Adiwardana, Minh-Thang Luong, David R So, Jamie Hall, Noah Fiedel, Romal Thoppilan, Zi Yang, Apoorv Kulshreshtha, Gaurav Nemade, Yifeng Lu, et al. Towards a human-like open-domain chatbot. arXiv preprint arXiv:2001.09977, 2020. Guillaume Alain and Yoshua Bengio. Understanding intermediate layers using linear classifier probes.arXiv preprint arXiv:1610.01644, 2016. Alfonso Amayuelas, Liangming Pan, Wenhu Chen, and William Wang. Knowledge of knowledge: Exploring known-unknowns uncertainty with large language models.arXiv preprint arXiv:2305.13712, 2023. Anastasios Nikolas Angelopoulos, Stephen Bates, Adam Fisch, Lihua Lei, and Tal Schuster. Conformal risk control. InThe Twelfth International Conference on Learning Representations, 2024. Amanda Askell, Yuntao Bai, Anna Chen, Dawn Drain, Deep Ganguli, Tom Henighan, Andy Jones, Nicholas Joseph, Ben Mann, Nova DasSarma, et al. A general language assistant as a laboratory for alignment. arXiv preprint arXiv:2112.00861, 2021. Amos Azaria and Tom Mitchell. The internal state of an llm knows when it’s lying. InFindings of the Association for Computational Linguistics: EMNLP 2023, p. 967–976, 2023. Yuntao Bai, Andy Jones, Kamal Ndousse, Amanda Askell, Anna Chen, Nova DasSarma, Dawn Drain, Stanislav Fort, Deep Ganguli, Tom Henighan, et al. Training a helpful and harmless assistant with reinforcement learning from human feedback.arXiv preprint arXiv:2204.05862, 2022. Zechen Bai, Pichao Wang, Tianjun Xiao, Tong He, Zongbo Han, Zheng Zhang, and Mike Zheng Shou. Hallucination of multimodal large language models: A survey.arXiv preprint arXiv:2404.18930, 2024. Neil Band, Xuechen Li, Tengyu Ma, and Tatsunori Hashimoto. Linguistic calibration of long-form genera- tions. InForty-first International Conference on Machine Learning, 2024. Yonatan Belinkov. Probing classifiers: Promises, shortcomings, and advances.Computational Linguistics, 48(1):207–219, 2022. Glenn W Brier. Verification of forecasts expressed in terms of probability.Monthly weather review, 78(1): 1–3, 1950. Collin Burns, Pavel Izmailov, Jan Hendrik Kirchner, Bowen Baker, Leo Gao, Leopold Aschenbrenner, Yining Chen, Adrien Ecoffet, Manas Joglekar, Jan Leike, et al. Weak-to-strong generalization: Eliciting strong capabilities with weak supervision.arXiv preprint arXiv:2312.09390, 2023a. 20 Collin Burns, Haotian Ye, Dan Klein, and Jacob Steinhardt. Discovering latent knowledge in language models without supervision. InThe Eleventh International Conference on Learning Representations, 2023b. Bowen Cao, Deng Cai, Zhisong Zhang, Yuexian Zou, and Wai Lam. On the worst prompt performance of large language models.arXiv preprint arXiv:2406.10248, 2024. Nicholas Carlini, Daphne Ippolito, Matthew Jagielski, Katherine Lee, Florian Tramer, and Chiyuan Zhang. Quantifying memorization across neural language models. InThe Eleventh International Conference on Learning Representations, 2023. Chao Chen, Kai Liu, Ze Chen, Yi Gu, Yue Wu, Mingyuan Tao, Zhihang Fu, and Jieping Ye. INSIDE: LLMs’ internal states retain the power of hallucination detection. InThe Twelfth International Conference on Learning Representations, 2024a. Jiefeng Chen, Jinsung Yoon, Sayna Ebrahimi, Sercan Arik, Tomas Pfister, and Somesh Jha. Adaptation with self-evaluation to improve selective prediction in llms. InFindings of the Association for Computational Linguistics: EMNLP 2023, p. 5190–5213, 2023a. Lida Chen, Zujie Liang, Xintao Wang, Jiaqing Liang, Yanghua Xiao, Feng Wei, Jinglei Chen, Zhenghong Hao, Bing Han, and Wei Wang. Teaching large language models to express knowledge boundary from their own signals.arXiv preprint arXiv:2406.10881, 2024b. Shiqi Chen, Miao Xiong, Junteng Liu, Zhengxuan Wu, Teng Xiao, Siyang Gao, and Junxian He. In- context sharpness as alerts: An inner representation perspective for hallucination mitigation. InForty-first International Conference on Machine Learning, 2024c. Xinyun Chen, Renat Aksitov, Uri Alon, Jie Ren, Kefan Xiao, Pengcheng Yin, Sushant Prakash, Charles Sutton, Xuezhi Wang, and Denny Zhou. Universal self-consistency for large language model generation. arXiv preprint arXiv:2311.17311, 2023b. Qinyuan Cheng, Tianxiang Sun, Xiangyang Liu, Wenwei Zhang, Zhangyue Yin, Shimin Li, Linyang Li, Kai Chen, and Xipeng Qiu. Can ai assistants know what they don’t know? InForty-first International Conference on Machine Learning, 2024. Steffi Chern, Zhulin Hu, Yuqing Yang, Ethan Chern, Yuan Guo, Jiahe Jin, Binjie Wang, and Pengfei Liu. Behonest: Benchmarking honesty of large language models.arXiv preprint arXiv:2406.13261, 2024. Yung-Sung Chuang, Yujia Xie, Hongyin Luo, Yoon Kim, James R. Glass, and Pengcheng He. Dola: Decoding by contrasting layers improves factuality in large language models. InThe Twelfth International Conference on Learning Representations, 2024. Karl Cobbe, Vineet Kosaraju, Mohammad Bavarian, Mark Chen, Heewoo Jun, Lukasz Kaiser, Matthias Plappert, Jerry Tworek, Jacob Hilton, Reiichiro Nakano, et al. Training verifiers to solve math word problems.arXiv preprint arXiv:2110.14168, 2021. Matthew Dahl, Varun Magesh, Mirac Suzgun, and Daniel E Ho. Large legal fictions: Profiling legal halluci- nations in large language models.arXiv preprint arXiv:2401.01301, 2024. Morris H DeGroot and Stephen E Fienberg. The comparison and evaluation of forecasters.Journal of the Royal Statistical Society: Series D (The Statistician), 32(1-2):12–22, 1983. Shehzaad Dhuliawala, Mojtaba Komeili, Jing Xu, Roberta Raileanu, Xian Li, Asli Celikyilmaz, and Jason Weston. Chain-of-verification reduces hallucination in large language models.arXiv preprint arXiv:2309.11495, 2023. Oxford English Dictionary. Oxford english dictionary.Simpson, Ja & Weiner, Esc, 3, 1989. 21 Jinhao Duan, Hao Cheng, Shiqi Wang, Alex Zavalny, Chenan Wang, Renjing Xu, Bhavya Kailkhura, and Kaidi Xu. Shifting attention to relevance: Towards the predictive uncertainty quantification of free-form large language models. In Lun-Wei Ku, Andre Martins, and Vivek Srikumar (eds.),Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), p. 5050–5063, 2024. Owain Evans, Owen Cotton-Barratt, Lukas Finnveden, Adam Bales, Avital Balwit, Peter Wills, Luca Righetti, and William Saunders. Truthful ai: Developing and governing ai that does not lie.arXiv preprint arXiv:2110.06674, 2021. Ekaterina Fadeeva, Aleksandr Rubashevskii, Artem Shelmanov, Sergey Petrakov, Haonan Li, Hamdy Mubarak, Evgenii Tsymbalov, Gleb Kuzmin, Alexander Panchenko, Timothy Baldwin, et al. Fact-checking the output of large language models via token-level uncertainty quantification. InFindings of the Associ- ation for Computational Linguistics ACL 2024, p. 9367–9385, 2024. Sebastian Farquhar, Vikrant Varma, Zachary Kenton, Johannes Gasteiger, Vladimir Mikulik, and Rohin Shah. Challenges with unsupervised llm knowledge discovery.arXiv preprint arXiv:2312.10029, 2023. Sebastian Farquhar, Jannik Kossen, Lorenz Kuhn, and Yarin Gal. Detecting hallucinations in large language models using semantic entropy.Nature, 630(8017):625–630, 2024. Shangbin Feng, Weijia Shi, Yike Wang, Wenxuan Ding, Vidhisha Balachandran, and Yulia Tsvetkov. Don’t hallucinate, abstain: Identifying LLM knowledge gaps via multi-LLM collaboration. InProceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), p. 14664–14690, 2024. Chujie Gao, Qihui Zhang, Dongping Chen, Yue Huang, Siyuan Wu, Zhengyan Fu, Yao Wan, Xiangliang Zhang, and Lichao Sun. The best of both worlds: Toward an honest and helpful large language model. arXiv preprint arXiv:2406.00380, 2024. Zorik Gekhman, Gal Yona, Roee Aharoni, Matan Eyal, Amir Feder, Roi Reichart, and Jonathan Herzig. Does fine-tuning llms on new knowledge encourage hallucinations?arXiv preprint arXiv:2405.05904, 2024. Jiahui Geng, Fengyu Cai, Yuxia Wang, Heinz Koeppl, Preslav Nakov, and Iryna Gurevych. A survey of con- fidence estimation and calibration in large language models. InProceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers), p. 6577–6595, 2024. Brie Gertler.Self-knowledge. Routledge, 2010. Albert Gu and Tri Dao. Mamba: Linear-time sequence modeling with selective state spaces.arXiv preprint arXiv:2312.00752, 2023. Jiasheng Gu, Hongyu Zhao, Hanzi Xu, Liangyu Nie, Hongyuan Mei, and Wenpeng Yin. Robustness of learning from task instructions. InFindings of the Association for Computational Linguistics: ACL 2023, 2023. Arnav Gudibande, Eric Wallace, Charlie Snell, Xinyang Geng, Hao Liu, Pieter Abbeel, Sergey Levine, and Dawn Song. The false promise of imitating proprietary llms.arXiv preprint arXiv:2305.15717, 2023. Chuan Guo, Geoff Pleiss, Yu Sun, and Kilian Q Weinberger. On calibration of modern neural networks. In International conference on machine learning, p. 1321–1330. PMLR, 2017. Neha Gupta, Harikrishna Narasimhan, Wittawat Jitkrittum, Ankit Singh Rawat, Aditya Krishna Menon, and Sanjiv Kumar. Language model cascades: Token-level uncertainty and beyond.arXiv preprint arXiv:2404.10136, 2024. Haixia Han, Tingyun Li, Shisong Chen, Jie Shi, Chengyu Du, Yanghua Xiao, Jiaqing Liang, and Xin Lin. Enhancing confidence expression in large language models through learning from past experience.arXiv preprint arXiv:2404.10315, 2024. 22 Edward J Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen. Lora: Low-rank adaptation of large language models.arXiv preprint arXiv:2106.09685, 2021. Shengding Hu, Yifan Luo, Huadong Wang, Xingyi Cheng, Zhiyuan Liu, and Maosong Sun. Won’t get fooled again: Answering questions with false premises. InProceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), p. 5626–5643, 2023. Jie Huang, Xinyun Chen, Swaroop Mishra, Huaixiu Steven Zheng, Adams Wei Yu, Xinying Song, and Denny Zhou. Large language models cannot self-correct reasoning yet. InThe Twelfth International Conference on Learning Representations, 2024a. Yue Huang, Lichao Sun, Haoran Wang, Siyuan Wu, Qihui Zhang, Yuan Li, Chujie Gao, Yixin Huang, Wenhan Lyu, Yixuan Zhang, Xiner Li, Hanchi Sun, Zhengliang Liu, Yixin Liu, Yijue Wang, Zhikun Zhang, Bertie Vidgen, Bhavya Kailkhura, Caiming Xiong, Chaowei Xiao, Chunyuan Li, Eric P. Xing, Furong Huang, Hao Liu, Heng Ji, Hongyi Wang, Huan Zhang, Huaxiu Yao, Manolis Kellis, Marinka Zitnik, Meng Jiang, Mohit Bansal, James Zou, Jian Pei, Jian Liu, Jianfeng Gao, Jiawei Han, Jieyu Zhao, Jiliang Tang, Jindong Wang, Joaquin Vanschoren, John Mitchell, Kai Shu, Kaidi Xu, Kai-Wei Chang, Lifang He, Lifu Huang, Michael Backes, Neil Zhenqiang Gong, Philip S. Yu, Pin-Yu Chen, Quanquan Gu, Ran Xu, Rex Ying, Shuiwang Ji, Suman Jana, Tianlong Chen, Tianming Liu, Tianyi Zhou, William Yang Wang, Xiang Li, Xiangliang Zhang, Xiao Wang, Xing Xie, Xun Chen, Xuyu Wang, Yan Liu, Yanfang Ye, Yinzhi Cao, Yong Chen, and Yue Zhao. Trustllm: Trustworthiness in large language models. InForty-first International Conference on Machine Learning, 2024b. Yukun Huang, Yixin Liu, Raghuveer Thirukovalluru, Arman Cohan, and Bhuwan Dhingra. Calibrating long-form generations from large language models.arXiv preprint arXiv:2402.06544, 2024c. Ziwei Ji, Delong Chen, Etsuko Ishii, Samuel Cahyawijaya, Yejin Bang, Bryan Wilie, and Pascale Fung. Llm internal states reveal hallucination risk faced with a query.arXiv preprint arXiv:2407.03282, 2024. Dongwei Jiang, Jingyu Zhang, Orion Weller, Nathaniel Weir, Benjamin Van Durme, and Daniel Khashabi. Self-[in] correct: Llms struggle with refining self-generated responses.arXiv preprint arXiv:2404.04298, 2024. Zhengbao Jiang, Frank F Xu, Luyu Gao, Zhiqing Sun, Qian Liu, Jane Dwivedi-Yu, Yiming Yang, Jamie Callan, and Graham Neubig. Active retrieval augmented generation. InProceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, p. 7969–7992, 2023. Mandar Joshi, Eunsol Choi, Daniel S Weld, and Luke Zettlemoyer. Triviaqa: A large scale distantly su- pervised challenge dataset for reading comprehension. InProceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), p. 1601–1611, 2017. Jaehun Jung, Faeze Brahman, and Yejin Choi. Trust or escalate: Llm judges with provable guarantees for human agreement.arXiv preprint arXiv:2407.18370, 2024. Saurav Kadavath, Tom Conerly, Amanda Askell, Tom Henighan, Dawn Drain, Ethan Perez, Nicholas Schiefer, Zac Hatfield-Dodds, Nova DasSarma, Eli Tran-Johnson, et al. Language models (mostly) know what they know.arXiv preprint arXiv:2207.05221, 2022. Katie Kang, Eric Wallace, Claire Tomlin, Aviral Kumar, and Sergey Levine. Unfamiliar finetuning examples control how language models hallucinate.arXiv preprint arXiv:2403.05612, 2024. Sanyam Kapoor, Nate Gruver, Manley Roberts, Katherine Collins, Arka Pal, Umang Bhatt, Adrian Weller, Samuel Dooley, Micah Goldblum, and Andrew Gordon Wilson. Large language models must be taught to know what they don’t know.arXiv preprint arXiv:2406.08391, 2024. Heejung S Kim and Deborah Ko. Culture and self-expression. InThe self, p. 325–342. Psychology Press, 2011. 23 Takeshi Kojima, Shixiang Shane Gu, Machel Reid, Yutaka Matsuo, and Yusuke Iwasawa. Large language models are zero-shot reasoners.Advances in neural information processing systems, 35:22199–22213, 2022. Jannik Kossen, Jiatong Han, Muhammed Razzak, Lisa Schut, Shreshth Malik, and Yarin Gal. Semantic entropy probes: Robust and cheap hallucination detection in llms.arXiv preprint arXiv:2406.15927, 2024. Lorenz Kuhn, Yarin Gal, and Sebastian Farquhar. Semantic uncertainty: Linguistic invariances for uncer- tainty estimation in natural language generation. InThe Eleventh International Conference on Learning Representations, 2023. Meelis Kull, Miquel Perello Nieto, Markus Kängsepp, Telmo Silva Filho, Hao Song, and Peter Flach. Be- yond temperature scaling: Obtaining well-calibrated multi-class probabilities with dirichlet calibration. Advances in neural information processing systems, 32, 2019. Tom Kwiatkowski, Jennimaria Palomaki, Olivia Redfield, Michael Collins, Ankur Parikh, Chris Alberti, Danielle Epstein, Illia Polosukhin, Jacob Devlin, Kenton Lee, et al. Natural questions: a benchmark for question answering research.Transactions of the Association for Computational Linguistics, 7:453–466, 2019. Royi Lachmy, Valentina Pyatkin, Avshalom Manevich, and Reut Tsarfaty. Draw me a flower: Processing and grounding abstraction in natural language.Transactions of the Association for Computational Linguistics, 10:1341–1356, 2022. Sicong Leng, Hang Zhang, Guanzheng Chen, Xin Li, Shijian Lu, Chunyan Miao, and Lidong Bing. Mitigating object hallucinations in large vision-language models through visual contrastive decoding. InProceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, p. 13872–13882, 2024. Benjamin A Levinstein and Daniel A Herrmann. Still no lie detector for language models: Probing empirical and conceptual roadblocks.Philosophical Studies, p. 1–27, 2024. Kenneth Li, Oam Patel, Fernanda Viégas, Hanspeter Pfister, and Martin Wattenberg. Inference-time inter- vention: Eliciting truthful answers from a language model.Advances in Neural Information Processing Systems, 36, 2024a. Xiang Lisa Li, Ari Holtzman, Daniel Fried, Percy Liang, Jason Eisner, Tatsunori B Hashimoto, Luke Zettle- moyer, and Mike Lewis. Contrastive decoding: Open-ended text generation as optimization. InProceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), p. 12286–12312, 2023a. Xiang Lisa Li, Vaishnavi Shrivastava, Siyan Li, Tatsunori Hashimoto, and Percy Liang. Benchmarking and improving generator-validator consistency of language models. InThe Twelfth International Conference on Learning Representations, 2024b. Yinheng Li, Shaofei Wang, Han Ding, and Hang Chen. Large language models in finance: A survey. In Proceedings of the fourth ACM international conference on AI in finance, p. 374–382, 2023b. Sheng-Chieh Lin, Luyu Gao, Barlas Oguz, Wenhan Xiong, Jimmy Lin, Wen-tau Yih, and Xilun Chen. Flame: Factuality-aware alignment for large language models.arXiv preprint arXiv:2405.01525, 2024a. Stephanie Lin, Jacob Hilton, and Owain Evans. Teaching models to express their uncertainty in words. Transactions on Machine Learning Research, 2022a. ISSN 2835-8856. Stephanie Lin, Jacob Hilton, and Owain Evans. Truthfulqa: Measuring how models mimic human falsehoods. InProceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), p. 3214–3252, 2022b. Zhen Lin, Shubhendu Trivedi, and Jimeng Sun. Generating with confidence: Uncertainty quantification for black-box large language models.Transactions on Machine Learning Research, 2024b. ISSN 2835-8856. 24 Genglin Liu, Xingyao Wang, Lifan Yuan, Yangyi Chen, and Hao Peng. Examining llms’ uncertainty expres- sion towards questions outside parametric knowledge, 2024a. Huanshuo Liu, Hao Zhang, Zhijiang Guo, Kuicai Dong, Xiangyang Li, Yi Quan Lee, Cong Zhang, and Yong Liu. Ctrla: Adaptive retrieval-augmented generation via probe-guided control.arXiv preprint arXiv:2405.18727, 2024b. Junteng Liu, Shiqi Chen, Yu Cheng, and Junxian He. On the universal truthfulness hyperplane inside llms. arXiv preprint arXiv:2407.08582, 2024c. Kevin Liu, Stephen Casper, Dylan Hadfield-Menell, and Jacob Andreas. Cognitive dissonance: Why do language model outputs disagree with internal representations of truthfulness? InProceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, p. 4791–4797, 2023. Nelson F Liu, Kevin Lin, John Hewitt, Ashwin Paranjape, Michele Bevilacqua, Fabio Petroni, and Percy Liang. Lost in the middle: How language models use long contexts.Transactions of the Association for Computational Linguistics, 12:157–173, 2024d. Qing Lyu, Kumar Shridhar, Chaitanya Malaviya, Li Zhang, Yanai Elazar, Niket Tandon, Marianna Apid- ianaki, Mrinmaya Sachan, and Chris Callison-Burch. Calibrating large language models with sample consistency.arXiv preprint arXiv:2402.13904, 2024. Matéo Mahaut, Laura Aina, Paula Czarnowska, Momchil Hardalov, Thomas Müller, and Lluis Marquez. Factual confidence of LLMs: on reliability and robustness of current estimators. In Lun-Wei Ku, An- dre Martins, and Vivek Srikumar (eds.),Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), p. 4554–4570, 2024. Andrey Malinin and Mark Gales. Uncertainty estimation in autoregressive structured prediction. InThe Ninth International Conference on Learning Representations, 2021. Potsawee Manakul, Adian Liusie, and Mark Gales. Selfcheckgpt: Zero-resource black-box hallucination detection for generative large language models. InProceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, p. 9004–9017, 2023. Samuel Marks and Max Tegmark. The geometry of truth: Emergent linear structure in large language model representations of true/false datasets.arXiv preprint arXiv:2310.06824, 2023. Moran Mizrahi, Guy Kaplan, Dan Malkin, Rotem Dror, Dafna Shahaf, and Gabriel Stanovsky. State of what art? a call for multi-prompt llm evaluation.arXiv preprint arXiv:2401.00595, 2023. Mahdi Pakdaman Naeini, Gregory Cooper, and Milos Hauskrecht. Obtaining well calibrated probabilities using bayesian binning. InProceedings of the AAAI conference on artificial intelligence, volume 29, 2015. Shiyu Ni, Keping Bi, Jiafeng Guo, and Xueqi Cheng. When do LLMs need retrieval augmentation? mitigating LLMs’ overconfidence helps retrieval augmentation. InFindings of the Association for Computational Linguistics ACL 2024, p. 11375–11388, 2024. Jeremy Nixon, Michael W Dusenberry, Linchuan Zhang, Ghassen Jerfel, and Dustin Tran. Measuring calibration in deep learning. InCVPR workshops, volume 2, 2019. Long Ouyang, Jeffrey Wu, Xu Jiang, Diogo Almeida, Carroll Wainwright, Pamela Mishkin, Chong Zhang, Sandhini Agarwal, Katarina Slama, Alex Ray, et al. Training language models to follow instructions with human feedback.Advances in neural information processing systems, 35:27730–27744, 2022. Arkil Patel, Satwik Bhattamishra, and Navin Goyal. Are nlp models really able to solve simple math word problems? InProceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, p. 2080–2094, 2021. 25 Ofir Press, Muru Zhang, Sewon Min, Ludwig Schmidt, Noah A Smith, and Mike Lewis. Measuring and narrowing the compositionality gap in language models. InFindings of the Association for Computational Linguistics: EMNLP 2023, p. 5687–5711, 2023. Rafael Rafailov, Archit Sharma, Eric Mitchell, Christopher D Manning, Stefano Ermon, and Chelsea Finn. Direct preference optimization: Your language model is secretly a reward model.Advances in Neural Information Processing Systems, 36, 2024. Pranav Rajpurkar, Jian Zhang, Konstantin Lopyrev, and Percy Liang. Squad: 100,000+ questions for machine comprehension of text. InProceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, p. 2383–2392, 2016. Guillem Ramírez, Alexandra Birch, and Ivan Titov. Optimising calls to large language models with uncertainty-based two-tier selection.arXiv preprint arXiv:2405.02134, 2024. Nils Reimers and Iryna Gurevych. Sentence-bert: Sentence embeddings using siamese bert-networks. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), p. 3982–3992, 2019. Jie Ren, Jiaming Luo, Yao Zhao, Kundan Krishna, Mohammad Saleh, Balaji Lakshminarayanan, and Peter J Liu. Out-of-distribution detection and selective generation for conditional language models. InThe Eleventh International Conference on Learning Representations, 2023a. Jie Ren, Yao Zhao, Tu Vu, Peter J Liu, and Balaji Lakshminarayanan. Self-evaluation improves selective generation in large language models. InProceedings on "I Can’t Believe It’s Not Better: Failure Modes in the Age of Foundation Models" at NeurIPS 2023 Workshops, p. 49–64, 2023b. John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimiza- tion algorithms.arXiv preprint arXiv:1707.06347, 2017. Melanie Sclar, Yejin Choi, Yulia Tsvetkov, and Alane Suhr. Quantifying language models’ sensitivity to spurious features in prompt design or: How i learned to start worrying about prompt formatting. InThe Twelfth International Conference on Learning Representations, 2024. Mrinank Sharma, Meg Tong, Tomasz Korbak, David Duvenaud, Amanda Askell, Samuel R. Bowman, Esin DURMUS, Zac Hatfield-Dodds, Scott R Johnston, Shauna M Kravec, Timothy Maxwell, Sam McCandlish, Kamal Ndousse, Oliver Rausch, Nicholas Schiefer, Da Yan, Miranda Zhang, and Ethan Perez. Towards understanding sycophancy in language models. InThe Twelfth International Conference on Learning Representations, 2024. Weijia Shi, Xiaochuang Han, Mike Lewis, Yulia Tsvetkov, Luke Zettlemoyer, and Wen-tau Yih. Trusting your evidence: Hallucinate less with context-aware decoding. InProceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 2: Short Papers), p. 783–791, 2024. Chenglei Si, Zhe Gan, Zhengyuan Yang, Shuohang Wang, Jianfeng Wang, Jordan Boyd-Graber, and Lijuan Wang. Prompting gpt-3 to be reliable. InThe Eleventh International Conference on Learning Represen- tations, 2023a. Chenglei Si, Weijia Shi, Chen Zhao, Luke Zettlemoyer, and Jordan Boyd-Graber. Getting more out of mixture of language model reasoning experts. InFindings of the Association for Computational Linguistics: EMNLP 2023, p. 8234–8249, 2023b. Elias Stengel-Eskin, Peter Hase, and Mohit Bansal. Lacie: Listener-aware finetuning for confidence calibra- tion in large language models.arXiv preprint arXiv:2405.21028, 2024. Lichao Sun, Yue Huang, Haoran Wang, Siyuan Wu, Qihui Zhang, Chujie Gao, Yixin Huang, Wenhan Lyu, Yixuan Zhang, Xiner Li, et al. Trustllm: Trustworthiness in large language models.arXiv preprint arXiv:2401.05561, 2024. 26 Gemini Team, Rohan Anil, Sebastian Borgeaud, Yonghui Wu, Jean-Baptiste Alayrac, Jiahui Yu, Radu Sori- cut, Johan Schalkwyk, Andrew M Dai, Anja Hauth, et al. Gemini: a family of highly capable multimodal models.arXiv preprint arXiv:2312.11805, 2023. Raghuveer Thirukovalluru, Yukun Huang, and Bhuwan Dhingra. Atomic self-consistency for better long form generations.arXiv preprint arXiv:2405.13131, 2024. Arun James Thirunavukarasu, Darren Shu Jeng Ting, Kabilan Elangovan, Laura Gutierrez, Ting Fang Tan, and Daniel Shu Wei Ting. Large language models in medicine.Nature medicine, 29(8):1930–1940, 2023. Katherine Tian, Eric Mitchell, Allan Zhou, Archit Sharma, Rafael Rafailov, Huaxiu Yao, Chelsea Finn, and Christopher D Manning. Just ask for calibration: Strategies for eliciting calibrated confidence scores from language models fine-tuned with human feedback. InProceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, p. 5433–5442, 2023. Katherine Tian, Eric Mitchell, Huaxiu Yao, Christopher D Manning, and Chelsea Finn. Fine-tuning language models for factuality. InThe Twelfth International Conference on Learning Representations, 2024. Christian Tomani, Kamalika Chaudhuri, Ivan Evtimov, Daniel Cremers, and Mark Ibrahim. Uncertainty- based abstention in llms improves safety and reduces hallucinations.arXiv preprint arXiv:2404.10960, 2024. Hugo Touvron, Louis Martin, Kevin Stone, Peter Albert, Amjad Almahairi, Yasmine Babaei, Nikolay Bash- lykov, Soumya Batra, Prajjwal Bhargava, Shruti Bhosale, et al. Llama 2: Open foundation and fine-tuned chat models.arXiv preprint arXiv:2307.09288, 2023. Dennis Ulmer, Martin Gubri, Hwaran Lee, Sangdoo Yun, and Seong Joon Oh. Calibrating large language models using their generations only.arXiv preprint arXiv:2403.05973, 2024. Neeraj Varshney, Wenlin Yao, Hongming Zhang, Jianshu Chen, and Dong Yu. A stitch in time saves nine: Detecting and mitigating hallucinations of llms by validating low-confidence generation.arXiv preprint arXiv:2307.03987, 2023. Fanqi Wan, Xinting Huang, Leyang Cui, Xiaojun Quan, Wei Bi, and Shuming Shi. Knowledge verification to nip hallucination in the bud.arXiv preprint arXiv:2401.10768, 2024a. Zhongwei Wan, Xin Wang, Che Liu, Samiul Alam, Yu Zheng, Jiachen Liu, Zhongnan Qu, Shen Yan, Yi Zhu, Quanlu Zhang, Mosharaf Chowdhury, and Mi Zhang. Efficient large language models: A survey.Trans- actions on Machine Learning Research, 2024b. ISSN 2835-8856. Boshi Wang, Xiang Yue, and Huan Sun. Can chatgpt defend its belief in truth? evaluating llm reasoning via debate. InFindings of the Association for Computational Linguistics: EMNLP 2023, p. 11865–11881, 2023a. Jindong Wang, Xixu Hu, Wenxin Hou, Hao Chen, Runkai Zheng, Yidong Wang, Linyi Yang, Haojun Huang, Wei Ye, Xiubo Geng, et al. On the robustness of chatgpt: An adversarial and out-of-distribution perspec- tive.arXiv preprint arXiv:2302.12095, 2023b. Lei Wang, Wanyu Xu, Yihuai Lan, Zhiqiang Hu, Yunshi Lan, Roy Ka-Wei Lee, and Ee-Peng Lim. Plan-and- solve prompting: Improving zero-shot chain-of-thought reasoning by large language models. InProceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), p. 2609–2634, 2023c. Xinglin Wang, Yiwei Li, Shaoxiong Feng, Peiwen Yuan, Boyuan Pan, Heda Wang, Yao Hu, and Kan Li. Integrate the essence and eliminate the dross: Fine-grained self-consistency for free-form language genera- tion. In Lun-Wei Ku, Andre Martins, and Vivek Srikumar (eds.),Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), p. 11782–11794, 2024. 27 Xuezhi Wang, Jason Wei, Dale Schuurmans, Quoc V Le, Ed H. Chi, Sharan Narang, Aakanksha Chowdhery, and Denny Zhou. Self-consistency improves chain of thought reasoning in language models. InThe Eleventh International Conference on Learning Representations, 2023d. Yile Wang, Peng Li, Maosong Sun, and Yang Liu. Self-knowledge guided retrieval augmentation for large language models. InFindings of the Association for Computational Linguistics: EMNLP 2023, p. 10303– 10315, 2023e. Jason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma, Fei Xia, Ed Chi, Quoc V Le, Denny Zhou, et al. Chain-of-thought prompting elicits reasoning in large language models.Advances in neural information processing systems, 35:24824–24837, 2022. Jerry Wei, Da Huang, Yifeng Lu, Denny Zhou, and Quoc V Le. Simple synthetic data reduces sycophancy in large language models.arXiv preprint arXiv:2308.03958, 2023. Bingbing Wen, Jihan Yao, Shangbin Feng, Chenjun Xu, Yulia Tsvetkov, Bill Howe, and Lucy Lu Wang. The art of refusal: A survey of abstention in large language models.arXiv preprint arXiv:2407.18418, 2024. Adina Williams, Nikita Nangia, and Samuel Bowman. A broad-coverage challenge corpus for sentence understanding through inference. InProceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers), p. 1112–1122, 2018. Yonghui Wu, Mike Schuster, Zhifeng Chen, Quoc V Le, Mohammad Norouzi, Wolfgang Macherey, Maxim Krikun, Yuan Cao, Qin Gao, Klaus Macherey, et al. Google’s neural machine translation system: Bridging the gap between human and machine translation.arXiv preprint arXiv:1609.08144, 2016. Yijun Xiao and William Yang Wang. On hallucination and predictive uncertainty in conditional language generation.arXiv preprint arXiv:2103.15025, 2021. Yuxin Xiao, Paul Pu Liang, Umang Bhatt, Willie Neiswanger, Ruslan Salakhutdinov, and Louis-Philippe Morency. Uncertainty quantification with pre-trained language models: A large-scale empirical analysis. InFindings of the Association for Computational Linguistics: EMNLP 2022, p. 7273–7284, 2022. Miao Xiong, Zhiyuan Hu, Xinyang Lu, YIFEI LI, Jie Fu, Junxian He, and Bryan Hooi. Can llms express their uncertainty? an empirical evaluation of confidence elicitation in llms. InThe Twelfth International Conference on Learning Representations, 2024. Hongshen Xu, Zichen Zhu, Da Ma, Situo Zhang, Shuai Fan, Lu Chen, and Kai Yu. Rejection improves reliability: Training llms to refuse unknown questions using rl from knowledge feedback.arXiv preprint arXiv:2403.18349, 2024a. Tianyang Xu, Shujin Wu, Shizhe Diao, Xiaoze Liu, Xingyao Wang, Yangyi Chen, and Jing Gao. Sayself: Teaching llms to express confidence with self-reflective rationales.arXiv preprint arXiv:2405.20974, 2024b. Yasin Abbasi Yadkori, Ilja Kuzborskij, David Stutz, András György, Adam Fisch, Arnaud Doucet, Iuliya Beloshapka, Wei-Hung Weng, Yao-Yuan Yang, Csaba Szepesvári, et al. Mitigating llm hallucinations via conformal abstention.arXiv preprint arXiv:2405.01563, 2024. Adam Yang, Chen Chen, and Konstantinos Pitas. Just rephrase it! uncertainty estimation in closed-source language models via multiple rephrased queries.arXiv preprint arXiv:2405.13907, 2024. Yuqing Yang, Ethan Chern, Xipeng Qiu, Graham Neubig, and Pengfei Liu. Alignment for honesty.arXiv preprint arXiv:2312.07000, 2023. Zhilin Yang, Peng Qi, Saizheng Zhang, Yoshua Bengio, William Cohen, Ruslan Salakhutdinov, and Christo- pher D Manning. Hotpotqa: A dataset for diverse, explainable multi-hop question answering. InPro- ceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, p. 2369–2380, 2018. 28 Zijun Yao, Weijian Qi, Liangming Pan, Shulin Cao, Linmei Hu, Weichuan Liu, Lei Hou, and Juanzi Li. Seakr: Self-aware knowledge retrieval for adaptive retrieval augmented generation.arXiv preprint arXiv:2406.19215, 2024. Zhangyue Yin, Qiushi Sun, Qipeng Guo, Jiawen Wu, Xipeng Qiu, and Xuan-Jing Huang. Do large language models know what they don’t know? InFindings of the Association for Computational Linguistics: ACL 2023, p. 8653–8665, 2023. Murong Yue, Jie Zhao, Min Zhang, Liang Du, and Ziyu Yao. Large language model cascades with mixture of thought representations for cost-efficient reasoning. InThe Twelfth International Conference on Learning Representations, 2024. Hanning Zhang, Shizhe Diao, Yong Lin, Yi Fung, Qing Lian, Xingyao Wang, Yangyi Chen, Heng Ji, and Tong Zhang. R-tuning: Instructing large language models to say ‘i don’t know’. InProceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers), p. 7106–7132, 2024a. Muru Zhang, Ofir Press, William Merrill, Alisa Liu, and Noah A. Smith. How language model hallucinations can snowball. InForty-first International Conference on Machine Learning, 2024b. Tianyi Zhang, Varsha Kishore, Felix Wu, Kilian Q. Weinberger, and Yoav Artzi. Bertscore: Evaluating text generation with bert. InInternational Conference on Learning Representations, 2020. Xiaoying Zhang, Baolin Peng, Ye Tian, Jingyan Zhou, Lifeng Jin, Linfeng Song, Haitao Mi, and Helen Meng. Self-alignment for factuality: Mitigating hallucinations in LLMs via self-evaluation. InProceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), p. 1946–1965. Association for Computational Linguistics, 2024c. Yue Zhang, Leyang Cui, Wei Bi, and Shuming Shi. Alleviating hallucinations of large language models through induced hallucinations.arXiv preprint arXiv:2312.15710, 2023a. Yue Zhang, Yafu Li, Leyang Cui, Deng Cai, Lemao Liu, Tingchen Fu, Xinting Huang, Enbo Zhao, Yu Zhang, Yulong Chen, et al. Siren’s song in the ai ocean: a survey on hallucination in large language models.arXiv preprint arXiv:2309.01219, 2023b. Yuji Zhang, Sha Li, Jiateng Liu, Pengfei Yu, Yi R Fung, Jing Li, Manling Li, and Heng Ji. Knowledge over- shadowing causes amalgamated hallucination in large language models.arXiv preprint arXiv:2407.08039, 2024d. Ruochen Zhao, Xingxuan Li, Shafiq Joty, Chengwei Qin, and Lidong Bing. Verify-and-edit: A knowledge- enhanced chain-of-thought framework. InProceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), p. 5823–5840, 2023. Xinran Zhao, Hongming Zhang, Xiaoman Pan, Wenlin Yao, Dong Yu, Tongshuang Wu, and Jianshu Chen. Fact-and-reflection (FaR) improves confidence calibration of large language models. In Lun-Wei Ku, Andre Martins, and Vivek Srikumar (eds.),Findings of the Association for Computational Linguistics ACL 2024, p. 8702–8718, 2024. Huaixiu Steven Zheng, Swaroop Mishra, Xinyun Chen, Heng-Tze Cheng, Ed H. Chi, Quoc V Le, and Denny Zhou. Take a step back: Evoking reasoning via abstraction in large language models. InThe Twelfth International Conference on Learning Representations, 2024. Chunting Zhou, Junxian He, Xuezhe Ma, Taylor Berg-Kirkpatrick, and Graham Neubig. Prompt consistency for zero-shot task generalization. InFindings of the Association for Computational Linguistics: EMNLP 2022, p. 2613–2626, 2022. Denny Zhou, Nathanael Schärli, Le Hou, Jason Wei, Nathan Scales, Xuezhi Wang, Dale Schuurmans, Claire Cui, Olivier Bousquet, Quoc V Le, and Ed H. Chi. Least-to-most prompting enables complex reasoning in large language models. InThe Eleventh International Conference on Learning Representations, 2023a. 29 Kaitlyn Zhou, Dan Jurafsky, and Tatsunori B Hashimoto. Navigating the grey area: How expressions of uncertainty and overconfidence affect language models. InProceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, p. 5506–5524, 2023b. Chiwei Zhu, Benfeng Xu, Quan Wang, Yongdong Zhang, and Zhendong Mao. On the calibration of large language models and alignment. In Houda Bouamor, Juan Pino, and Kalika Bali (eds.),Findings of the Association for Computational Linguistics: EMNLP 2023, 2023. Zeyuan Allen Zhu and Yuanzhi Li. Physics of language models: Part 3.1, knowledge storage and extraction. arXiv preprint arXiv:2309.14316, 2023. 30