Organizations: Lattice Lab, Toyota Motor Corporation, Japan · Department of Computer Science, University of Tokyo, Japan · Rational Intelligence Lab, CISPA, Helmholtz Center for Information Security, Germany · Department of Computer Science, University of Manchester, United Kingdom · Manchester Centre for AI Fundamentals, United Kingdom · EPIC Lab, College of Computing & Data Science, Nanyang Technological University, Singapore
Despite the growing demand for eliciting uncertainty from large language models (LLMs), empirical evidence suggests that LLM behavior is not always adequately captured by the elicitation techniques developed under the classical probabilistic uncertainty framework. This mismatch leads to systematic failure modes, particularly in settings that involve ambiguous question-answering, in-context learning, and self-reflection. To address this, we propose novel prompt-based uncertainty elicitation techniques grounded in imprecise probabilities, a principled framework for repesenting and eliciting higher-order uncertainty. Here, first-order uncertainty captures uncertainty over possible responses to a prompt, while second-order uncertainty (uncertainty about uncertainty) quantifies indeterminacy in the underlying probability model itself. We introduce general-purpose prompting and post-processing procedures to directly elicit and quantify both orders of uncertainty, and demonstrate their effectiveness across diverse settings. Our approach enables more faithful uncertainty reporting from LLMs, improving credibility and supporting downstream decision-making.
Figures & tables
Figure 1: Collection of failure modes in prior verbalized uncertainty scores. (a) Example of an ambiguous question. (b) The prior uncertainty score fails to distinguish between clear and ambiguous question distributions. (c) The prior score also fails to track the decrease in prediction error, which should reflect reduced uncertainty as more in-context examples are provided. (d) Self-reflection on answer-wise probability/uncertainty should explain the rationale behind answer selection, but it often fails to do so.
Figure 2: Our imprecise probabilities–based approach. (a) Classical precise probability provides point estimates. (b) Imprecise probabilities instead represents uncertainty as intervals. (c) This enables more reasonable elicitation of question ambiguity. (d) It more closely tracks predictive error. (e) It aligns the LLM’s answer selection with the selection implied by its imprecise probability estimates.
Figure 3Figure 4
Figure 3: Learnable vs. noisy transforms.
Figure 4: (a) For first-order uncertainty estimation, both vanilla and De Finetti capture the underlying ambiguity noise p , but (b) for second-order, our methods stay flat, supporting the disentanglement of uncertainty source.
Figure 5: (a) For individual EU elicitation, vanilla incorrectly increases uncertainty, whereas ProbInt-EU tracks prediction error. (b) For group EU elicitation, our Credal-EU substantially improves AUROC.
GPT-5
gemini-2.5-pro
Method
MMLU-Pro
Non-MAQA
Non-AmbigQA
MMLU-Pro
Non-MAQA
Non-AmbigQA
Avg. Rank
Is true prob.
0.6850 ± 0.0238
0.5835 ± 0.0041
0.5584 ± 0.0157
0.6583 ± 0.0197
0.6296 ± 0.0068
0.5897 ± 0.0057
8.67
Label prob.
0.7649 ± 0.0220
0.6430 ± 0.0062
0.5876 ± 0.0176
0.6377 ± 0.0153
0.6483 ± 0.0126
0.5582 ± 0.0319
7.83
MI-Clarifications
0.7790 ± 0.0114
0.6528 ± 0.0080
0.5840 ± 0.0107
0.6348 ± 0.0144
0.6546 ± 0.0104
0.5497 ± 0.0267
7.83
DiNCO
0.7087 ± 0.0214
0.5642 ± 0.0066
0.5219 ± 0.0035
0.7133 ± 0.0167
0.5749 ± 0.0224
0.5275 ± 0.0190
9.17
Vanilla
0.8587 ± 0.0192
0.7577 ± 0.0194
0.7756 ± 0.0138
0.7326 ± 0.0221
0.6889 ± 0.0263
0.6688 ± 0.0209
4.17
Table 1: AUROC for correctness detection without ambiguity. Best result bolded in blue , second best in orange .
Figure 6: Credal-set from LLM ensemble: model disagreement induces lower/upper probability bounds for each output, which are used to compute MMI.
Figure 7: AUROC for ambiguity detection.
Figure 8: AUROC for correctness with ambiguity.
Figure 9: API cost on MMLU-Pro across all methods.
Figure 10: ProbInt more closely matches the KL metric.
Figure 11: Concordance index ( ↑ better) between uncertainty scores and the KL metric.
Figure 12: The LLM’s prediction y^LLM aligns with the IP-rational decision.
Appendix figures & tables11 assets
Supplementary material from the paper’s appendix.
Appendix
Figure 16Figure 17Figure 18Figure 19
Figure 15: First- and second-order uncertainty can be computed either for the (i) correctness of a specific answer y , or (ii) over the candidate answers set Y
Figure 16: Approximations of second-order uncertainty with fixed first-order noise (lower-case probability p=0.25 ) (with moving average window of 10). Both Pos and Credal generally match shape of the error.
Figure 22Figure 23Figure 24
Figure 17: Second-order uncertainty estimates elicited by variants of the ProbInt prompt consistently track the overall error trend.
Figure 18: DeFinetti best aligns with the proxy for first-order uncertainty
Understanding why a large language model (LLM) is uncertain about the response is important for their reliable deployment. Current approaches, which either provide a single uncertainty score or rely on the classical aleatoric-epistemic dichotomy, fail to offer actionable insights for improving the generative model. Recent studies have also shown that such methods are not enough for understanding uncertainty in LLMs. In this work, we advocate for an uncertainty decomposition framework that dissects LLM uncertainty into three distinct semantic components: (i) input ambiguity, arising from ambiguous prompts; (ii) knowledge gaps, caused by insufficient parametric evidence; and (iii) decoding randomness, stemming from stochastic sampling. Through a series of experiments we demonstrate that the dominance of these components can shift across model size and task. Our framework provides a better understanding to audit LLM reliability and detect hallucinations, paving the way for targeted interventions and more trustworthy systems.
Large language models (LLMs) often produce confident yet incorrect answers, which can lead to risky failures in real-world applications. We study whether post-training can make a model's self-assessment explicit: when the model is uncertain, can it be trained to signal so within its own response? A central design question is where in the response this signal should be exposed -- during reasoning, while the answer is still being formed, or at the end, once the answer has been produced. We study both. For end-of-reasoning self-assessment, we train the model to verbalize a confidence score for its response, with the aim of high confidence on correct answers and low confidence on incorrect ones. For during-reasoning self-assessment, we train the model to emit the marker <uncertain> whenever its current reasoning state appears unreliable. Across factual reasoning tasks, both forms sharply reduce overconfident errors while improving answer quality, and both can be used as triggers for retrieval augmented generation (RAG) to improve the final response. We further analyze their internal mechanisms: end-of-reasoning verbalized confidence sharpens a confidence-related structure already present in the pretrained model, whereas during-reasoning <uncertain> emission teaches the model to mark high-risk reasoning steps, with parameter changes concentrated in the model's late layers.
Junyu Guo, Shangding Gu, Ming Jin +2
University of California, Berkeley · Virginia Tech
Reliable deployment of large language models (LLMs) requires accurate uncertainty estimation. Existing methods are predominantly answer-first, producing confidence only after generating an answer, which measure the correctness of a specific response and limits practical usability. We study a confidence-first paradigm, where the model outputs its confidence before answering, interpreting this score as the model's probability of answering the question correctly under its current policy. We propose CoCA(Co-optimized Confidence and Answers), a GRPO reinforcement learning framework that jointly optimizes confidence calibration and answer accuracy via segmented credit assignment. By assigning separate rewards and group-relative advantages to confidence and answer segments, CoCA enables stable joint optimization and avoids reward hacking. Experiments across math, code, and factual QA benchmarks show improved calibration and uncertainty discrimination while preserving answer quality, thereby enabling a broader range of downstream applications.
Changcheng Li, Jiancan Wu, Hengheng Zhang +5
University of Science and Technology of China · Huawei Inc.