The Computational Basis of Confidence in Large Language Models
- URL: http://arxiv.org/abs/2607.12447v1
- Date: Tue, 14 Jul 2026 07:24:32 GMT
- Title: The Computational Basis of Confidence in Large Language Models
- Abstract summary: We use statistical decision confidence to study confidence in language models.<n>We show that answer logits behave as monotonic readouts of a latent decision variable.<n>These results establish SDC as a unifying framework for studying confidence across biological and artificial intelligence.
- Score: 2.8220151940446425
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Reliable confidence -- the probability that a model's own answer is correct -- is essential for the trustworthy deployment of language models. Existing work has largely evaluated confidence by how well it predicts correctness and whether it is calibrated, leaving open a more fundamental question: what does the confidence signal itself represent? Answer logits may reflect a latent decision variable sufficient to compute normative confidence, or instead a heuristic preference signal that combines the available evidence in a non-Bayesian manner. We address this using statistical decision confidence (SDC), a normative framework from computational neuroscience. Treating the answer-logit difference (LD) as a candidate readout of the latent decision variable, we test the qualitative signatures predicted by SDC. Across three perceptual discrimination tasks and a memory-based decision task, spanning three multimodal non-reasoning models and one reasoning model, LD satisfied these signatures -- including the diagnostic correct/error folded-X pattern -- showing that, in these settings, answer logits behave as monotonic readouts of a latent decision variable rather than heuristic preference scores. In complex visual reasoning, LD continued to predict correctness beyond objective task difficulty, but the full geometric signatures of SDC were absent, illustrating the current boundary of the framework when explicit normative process models are unavailable. These results provide a computational account of confidence in multimodal language models, delineate when answer logits behave as readouts of a latent decision variable, and establish SDC as a unifying framework for studying confidence across biological and artificial intelligence.
Related papers
- DirEAG: Dirichlet Evidence Aggregation for Calibrating Verbalized Confidence in Mathematical Reasoning [2.867517731896504]
Black-box verbalized confidence is difficult to calibrate in large language models.<n>We propose DirEAG, a Dirichlet Evidence Aggregation method that converts each elicited answer-confidence observation into calibrated soft evidence.
arXiv Detail & Related papers (2026-08-21T03:48:25Z) - Reported Confidence in LLMs Tracks Commitment More Than Correctness [0.7783842564949857]
Confidence is an estimate of the probability that a chosen answer is correct.<n>We test this with a two-stage abstention paradigm from the neuroscience of perceptual decision making.<n> verbal confidence predicted the commit/abstain decision substantially better than whether the answer was correct.
arXiv Detail & Related papers (2026-06-28T16:39:18Z) - Latent Confidence Alignment for LLM Self-Assessment [8.73168195475753]
We propose a Rasch model-based latent ability framework and a metacognitive perspective to measure the consistency between model self-assessment and the latent error probability implied by model ability and item difficulty.<n> Experiments on a medical-domain dataset with 20 models show that the proposed approach improves self-assessment quality without affecting model ability.
arXiv Detail & Related papers (2026-06-20T08:13:31Z) - LLMs Show No Signs Of Individuated Metacognition [0.023227405857540805]
We decompose binary confidence judgements from 20 Large Language Models.<n>We ask whether two models that differ in confidence also differ in performance.<n>We find no evidence for significant verbalised individuated metacognition in any tested domain.
arXiv Detail & Related papers (2026-05-22T23:54:33Z) - Diagnosing Multi-step Reasoning Failures in Black-box LLMs via Stepwise Confidence Attribution [12.955460962298588]
We introduce Stepwise Confidence Attribution (SCA), a framework for closed-source LLMs that assigns step-level confidence based only on generated reasoning traces.<n>SCA reliably identifies low-confidence steps strongly correlated with reasoning errors.<n>Using step-level confidence to guide self-correction improves the correction success rate by up to 13.5% over answer-level feedback.
arXiv Detail & Related papers (2026-05-19T00:57:51Z) - Confidence-Aware Alignment Makes Reasoning LLMs More Reliable [65.44962502963378]
We introduce CASPO, a framework that aligns token-level confidence with step-wise logical correctness without training a separate reward model.<n>During inference, we propose Confidence-aware Thought (CaT), which dynamically prunes uncertain reasoning branches with negligible O(V) latency.<n>Experiments across ten benchmarks and multiple model families show that CASPO consistently improves reasoning reliability and inference efficiency.
arXiv Detail & Related papers (2026-05-08T07:08:25Z) - Sensitivity Uncertainty Alignment in Large Language Models [0.0]
We propose a framework for analyzing failures of large language models under adversarial and ambiguous inputs.<n>We define a scalar score, SUA_theta(x), capturing the difference between distributional sensitivity and predictive entropy.<n>We introduce SUA-TR, a training method combining consistency regularization and entropy alignment, along with an abstention rule for safer inference.
arXiv Detail & Related papers (2026-04-21T17:53:12Z) - On Calibration of Large Language Models: From Response To Capability [66.59139960234326]
Large language models (LLMs) are widely deployed as general-purpose problem solvers.<n>We introduce capability calibration, which targets the model's expected accuracy on a query.<n>Our results demonstrate that capability-calibrated confidence improves pass@$k$ prediction and inference budget allocation.
arXiv Detail & Related papers (2026-02-14T01:07:45Z) - Cycles of Thought: Measuring LLM Confidence through Stable Explanations [53.15438489398938]
Large language models (LLMs) can reach and even surpass human-level accuracy on a variety of benchmarks, but their overconfidence in incorrect responses is still a well-documented failure mode.
We propose a framework for measuring an LLM's uncertainty with respect to the distribution of generated explanations for an answer.
arXiv Detail & Related papers (2024-06-05T16:35:30Z) - Uncertainty-aware Language Modeling for Selective Question Answering [107.47864420630923]
We present an automatic large language model (LLM) conversion approach that produces uncertainty-aware LLMs.
Our approach is model- and data-agnostic, is computationally-efficient, and does not rely on external models or systems.
arXiv Detail & Related papers (2023-11-26T22:47:54Z) - Decomposing Uncertainty for Large Language Models through Input Clarification Ensembling [69.83976050879318]
In large language models (LLMs), identifying sources of uncertainty is an important step toward improving reliability, trustworthiness, and interpretability.
In this paper, we introduce an uncertainty decomposition framework for LLMs, called input clarification ensembling.
Our approach generates a set of clarifications for the input, feeds them into an LLM, and ensembles the corresponding predictions.
arXiv Detail & Related papers (2023-11-15T05:58:35Z) - Improving the Reliability of Large Language Models by Leveraging
Uncertainty-Aware In-Context Learning [76.98542249776257]
Large-scale language models often face the challenge of "hallucination"
We introduce an uncertainty-aware in-context learning framework to empower the model to enhance or reject its output in response to uncertainty.
arXiv Detail & Related papers (2023-10-07T12:06:53Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.