The reviewed record of science sign in
Pith

arxiv: 2305.14975 · v2 · pith:F34ZUHHX · submitted 2023-05-24 · cs.CL

Just Ask for Calibration: Strategies for Eliciting Calibrated Confidence Scores from Language Models Fine-Tuned with Human Feedback

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:F34ZUHHXrecord.jsonopen to challenge →

classification cs.CL
keywords confidencerlhf-lmsconditionalprobabilitiesscoresanswercalibratedcalibration
0
0 comments X
read the original abstract

A trustworthy real-world prediction system should produce well-calibrated confidence scores; that is, its confidence in an answer should be indicative of the likelihood that the answer is correct, enabling deferral to an expert in cases of low-confidence predictions. Recent studies have shown that unsupervised pre-training produces large language models (LMs) whose conditional probabilities are remarkably well-calibrated. However, the most widely-used LMs are fine-tuned with reinforcement learning from human feedback (RLHF-LMs), and some studies have suggested that RLHF-LMs produce conditional probabilities that are very poorly calibrated. In light of this perceived weakness, we conduct a broad evaluation of methods for extracting confidence scores from RLHF-LMs. For RLHF-LMs such as ChatGPT, GPT-4, and Claude, we find that verbalized confidences emitted as output tokens are typically better-calibrated than the model's conditional probabilities on the TriviaQA, SciQ, and TruthfulQA benchmarks, often reducing the expected calibration error by a relative 50%.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 31 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Reported Confidence in LLMs Tracks Commitment More Than Correctness

    cs.LG 2026-06 unverdicted novelty 8.0

    Verbal confidence in LLMs tracks future commit/abstain decisions more than answer correctness, while log-probabilities track correctness.

  2. Can LLM Rerankers Predict Their Own Ranking Performance?

    cs.IR 2026-06 unverdicted novelty 7.0

    LLM rerankers can internally predict ranking quality via self-consistency of sampled outputs, matching SOTA external QPP while direct confidence is overconfident; supervised token-efficient methods improve calibration.

  3. MARGIN: Runtime Confidence Calibration for Multi-Agent Foundation Model Coordination

    cs.LG 2026-05 unverdicted novelty 7.0

    MARGIN is an online per-agent per-band calibration method using symmetric exponentially weighted moving averages with Bayesian shrinkage that reduces calibration error 3-6x under distribution shift and improves multi-...

  4. Inducing Artificial Uncertainty in Language Models

    cs.CL 2026-05 unverdicted novelty 7.0

    Inducing artificial uncertainty on trivial tasks allows training probes that achieve higher calibration on hard data than standard approaches while retaining performance on easy data.

  5. UsefulBench: Towards Decision-Useful Information as a Target for Information Retrieval

    cs.IR 2026-04 unverdicted novelty 7.0

    UsefulBench is a new benchmark dataset that separates relevance from usefulness in information retrieval, revealing that similarity-based systems and current LLMs fall short on decision-useful content.

  6. Functional-level Uncertainty Quantification for Calibrated Fine-tuning on LLMs

    cs.LG 2024-10 unverdicted novelty 7.0

    UQ4CT integrates functional-level uncertainty calibration into mixture-of-experts LoRA fine-tuning via a dedicated loss, cutting expected calibration error by over 25% on multiple-choice and generative QA tasks.

  7. Estimating Uncertainty from Reasoning: A Large-Scale Study of Multi- and Crosslingual MCQA Performance in LLMs

    cs.CL 2026-07 conditional novelty 6.0

    A large-scale multilingual evaluation of LLM uncertainty estimation methods across 22 languages and 9 models finds that English reasoning closes the UE gap for low-resource languages and that optimal UE method choice ...

  8. Just how sure are you? Improving Verbalized Uncertainty Calibration in Medical VQA

    cs.LG 2026-06 unverdicted novelty 6.0

    A composite loss with Brier calibration, anchor regularization, contrastive alignment from 2x2 perturbations, and KL stabilization reduces calibration error by over 60% in medical VQA while preserving accuracy.

  9. Beyond Logprobs: A Multi-Signal Confidence Engine for LLM-Based Document Field Extraction

    cs.CL 2026-06 unverdicted novelty 6.0

    ExtractConf fuses Hunter-Mapper disagreement with LLM uncertainty, OCR, image quality and layout into a classifier that reaches 0.928 ROC AUC on DocILE invoices and 0.858 on CORD receipts, cutting selective prediction...

  10. NBQ: Next-Best-Question for Dynamic Profiling

    cs.AI 2026-05 unverdicted novelty 6.0

    NBQ is a plug-and-play framework for adaptive question selection in conversations to produce structured user profiles, with QuickMatch enabling scalable reciprocal matching through approximate vector search.

  11. Beyond Agreement: Scoring Panel-Surfaced Biomedical Entity Candidates for Curator Triage

    cs.CL 2026-05 unverdicted novelty 6.0

    BioConCal raises AUROC for selecting correct biomedical NER candidates from a multi-LLM panel from 0.753 to 0.910 and selects over four times as many candidates at 0.95 precision compared to raw agreement.

  12. VLAConf: Calibrated Task-Success Confidence for Vision-Language-Action Models

    cs.RO 2026-05 unverdicted novelty 6.0

    VLAConf is a one-class discriminative method that estimates step-wise task-success confidence for VLA models via anomaly scoring on frozen representations plus step-conditioned modeling, shown to be more efficient tha...

  13. Functional Entropy: Predicting Functional Correctness in LLM-Generated Code with Uncertainty Quantification

    cs.CL 2026-05 unverdicted novelty 6.0

    Introduces functional equivalence methods and functional entropy to predict functional correctness of LLM-generated code via uncertainty quantification, outperforming NLI-based baselines in most tested settings.

  14. MARGIN: Runtime Confidence Calibration for Multi-Agent Foundation Model Coordination

    cs.LG 2026-05 unverdicted novelty 6.0

    MARGIN is an online calibration technique using symmetric EWMA and Bayesian shrinkage that learns per-agent per-band factors from the task stream, cutting calibration error 3-6x versus design-time baselines and liftin...

  15. LLMs are not (consistently) Bayesian: Quantifying internal (in)consistencies of LLMs' probabilistic beliefs

    cs.LG 2026-05 unverdicted novelty 6.0

    LLMs show inconsistent belief updates from evidence, with learned heuristics sometimes beating exact Bayesian computation due to misspecified world models.

  16. LLMs are not (consistently) Bayesian: Quantifying internal (in)consistencies of LLMs' probabilistic beliefs

    cs.LG 2026-05 unverdicted novelty 6.0

    LLMs do not consistently perform Bayesian updates on probabilistic beliefs; heuristic approaches often outperform exact Bayesian computation on downstream tasks, indicating misspecified internal models of the world.

  17. Zero-Shot Confidence Estimation for Small LLMs: When Supervised Baselines Aren't Worth Training

    cs.AI 2026-05 conditional novelty 6.0

    Average token log-probability provides a zero-shot confidence signal for small LLMs that matches supervised baselines in-distribution and outperforms them out-of-distribution, with a new retrieval-conditional variant ...

  18. Confidence Estimation in Automatic Short Answer Grading with LLMs

    cs.CL 2026-04 unverdicted novelty 6.0

    A hybrid confidence framework for LLM-based short answer grading combines model signals with aleatoric uncertainty from semantic clustering of responses and improves selective grading reliability over single-source methods.

  19. How LLMs Detect and Correct Their Own Errors: The Role of Internal Confidence Signals

    cs.LG 2026-04 unverdicted novelty 6.0

    LLMs implement a second-order confidence architecture where the PANL activation encodes both error likelihood and the ability to correct it, beyond verbal confidence or log-probabilities.

  20. Verbal Confidence Saturation in 3-9B Open-Weight Instruction-Tuned LLMs: A Pre-Registered Psychometric Validity Screen

    cs.CL 2026-04 conditional novelty 6.0

    Seven 3-9B instruction-tuned LLMs produce verbal confidence that saturates at high values and fails psychometric validity criteria for Type-2 discrimination under minimal elicitation.

  21. SELFDOUBT: Uncertainty Quantification for Reasoning LLMs via the Hedge-to-Verify Ratio

    cs.AI 2026-04 unverdicted novelty 6.0

    SELFDOUBT introduces the Hedge-to-Verify Ratio from reasoning traces as a single-pass uncertainty signal, with no-hedge traces correct 96% of the time and outperforming semantic entropy at 10x lower cost.

  22. Causal Evidence that Language Models use Confidence to Drive Behavior

    cs.LG 2026-03 unverdicted novelty 6.0

    Language models deploy multidimensional internal confidence representations and threshold-based policies to control abstention behavior, with causal support from activation steering experiments.

  23. How do LLMs Compute Verbal Confidence

    cs.CL 2026-03 unverdicted novelty 6.0

    Mechanistic experiments on Gemma 3 27B, Qwen 2.5 7B and Magistral Small 24B show verbal confidence is cached at post-answer positions from answer tokens and captures richer answer-quality information beyond token log-...

  24. Can LLMs Estimate Student Struggles? Human-AI Difficulty Alignment with Proficiency Simulation for Item Difficulty Prediction

    cs.CL 2025-12 unverdicted novelty 6.0

    LLMs systematically misalign with human student difficulty perceptions, converging to a machine consensus rather than simulating human cognitive limits across medical and math domains.

  25. Scaling with Confidence: Calibrating Confidence of LLMs for Adaptive Test Time Scaling

    cs.AI 2026-07 unverdicted novelty 5.0

    C3RL is a new RL algorithm combining correctness, calibration, and reference accuracy rewards to improve LLM confidence calibration, enabling CAS to outperform majority voting with up to 12.33x lower inference cost.

  26. The Measurement Gap in the Automation of EU Law: Benchmarking Doctrinal Legal Reasoning under the EU AI Act

    cs.CY 2026-06 unverdicted novelty 5.0

    No benchmark exists for doctrinal legal reasoning in LLMs, leaving the EU AI Act's accuracy mandate for judicial AI without an operational test.

  27. Margin-Adaptive Confidence Ranking for Reliable LLM Judgement

    cs.LG 2026-05 unverdicted novelty 5.0

    Introduces a margin-adaptive confidence ranking method that learns an estimator from simulated diversity and derives margin-dependent generalization bounds for use in fixed-sequence testing of LLM-human agreement.

  28. Confidence Estimation in Automatic Short Answer Grading with LLMs

    cs.CL 2026-04 unverdicted novelty 5.0

    A hybrid confidence framework for LLM-based automatic short answer grading integrates model-based signals with aleatoric uncertainty from semantic clustering of responses and yields more reliable estimates than single...

  29. Act or Escalate? Evaluating Escalation Behavior in Automation with Language Models

    cs.LG 2026-03 unverdicted novelty 5.0

    Language models display model-specific escalation thresholds in uncertain decisions that are not explained by scale or architecture, and supervised fine-tuning on explicit uncertainty reasoning produces robust, genera...

  30. Confidence Calibration for Multimodal LLMs: An Empirical Study through Medical VQA

    cs.CV 2026-06 unverdicted novelty 4.0

    A multi-strategy interrogation method with auxiliary expert assessment reduces expected calibration error by 40% on average across three medical VQA datasets for MLLMs.

  31. Margin-Adaptive Confidence Ranking for Reliable LLM Judgement

    cs.LG 2026-05 unverdicted novelty 4.0

    Develops a margin-adaptive learned confidence estimator for LLMs with generalization guarantees to improve agreement rates with human judgments over heuristic baselines.