|
Calibration
the question How well do people, and models, know how much they know? And can a system be built to say "I am not sure" at the right times? the classic findings Brier (1950) gave weather forecasting a scoring rule, the Brier score: the mean squared difference between the forecast probability and what happened. It rewards both calibration and sharpness, and it cannot be gamed by saying something other than what you believe. Murphy & Winkler (1977) then showed that US weather forecasters' probability-of-precipitation forecasts were remarkably well calibrated, a rare case of a profession getting this right, helped by fast, unambiguous feedback every day. Most people in most studies are not. Lichtenstein, Fischhoff & Phillips (1982) reviewed the early work: on general-knowledge questions, stated confidence usually exceeds accuracy, most of all on hard items, and the "hard–easy effect" flips toward underconfidence on easy ones. Tetlock (2005) tracked thousands of expert political forecasts over years and found them poorly calibrated and often hardly better than simple baselines. in machines Guo et al. (2017) found that modern deep networks were much more overconfident than older, smaller ones, and that a single learned temperature on the outputs fixed most of it. For language models, Kadavath et al. (2022) found that large pretrained models were fairly well calibrated on multiple-choice and true/false questions in the right format, and could be trained to predict whether they knew an answer [paraphrase, not a quotation]. Later reports describe calibration getting worse after preference tuning, which links this page to sycophancy. The engineering response is old. Chow (1970) worked out the optimal trade-off for a classifier that may decline to decide: the reject option. Refuse when the best class is not probable enough, and you trade coverage for fewer errors along a curve you can compute. what is not settled For people, how much of overconfidence is a real bias and how much comes from how questions are selected and scored is still argued. For models, calibration on multiple-choice benchmarks says little about calibration in free-form answers, where there is no single probability to read off. live debates Is human overconfidence real? Gigerenzer, Hoffrage & Kleinbölting (1991) and Juslin (1994) argued that much of the classic overconfidence came from how general-knowledge items were selected; with representatively sampled items it shrinks. Erev, Wallsten & Budescu (1994) showed that random error alone can produce over- and underconfidence in the same data, depending on how it is analysed. Moore & Healy (2008) separate three things all called overconfidence: overestimation, overplacement and overprecision [paraphrase, not a quotation]. Machines. After Guo et al. (2017) reported that modern networks were badly calibrated, Minderer et al. (2021) found that newer, non-convolutional architectures were among the best calibrated, so the trend was not general. For language models, the GPT-4 report showed calibration of the pretrained model degraded after post-training, Tian et al. (2023) found verbalised confidence could be better calibrated than token probabilities in such models, and Xiong et al. (2023) found verbalised confidence generally overconfident. methodological critiques ECE is an estimator, not a fact. Nixon et al. (2019) showed that expected calibration error depends on binning choices and can rank models differently, and Kumar, Liang & Ma (2019) showed binned estimates can understate the true error. A calibration claim needs its estimator, bin scheme and test distribution stated. the open problem A calibrated system is only useful if the people relying on it can use its confidence. That turns a statistical property into a question about reliance and teamwork. Reading list
see also
|
![]()
rev. Oct 24 2026