Skip to content

Popular but Wrong: Understanding and Mitigating LLM Overconfidence through Knowledge Popularity

May 2025 · 6 citations · 34 references
Computer Science

TL;DR

It is shown that popularity-related signals can mitigate overconfidence and improve overall confidence estimation, and incorporate knowledge popularity reduces average confidence on incorrect answers and improves overall confidence estimation.

Abstract

Large language models (LLMs) often produce incorrect answers with high confidence, yet the factors associated with such overconfidence remain insufficiently understood. We study this problem through the lens of knowledge popularity. Using entity-centric factual QA derived from Wikidata triplets, we characterize popularity through question entity popularity, answer popularity, and question-answer co-occurrence. We find two consistent patterns. First, hallucinated answers are far from random: compared with ground-truth answers, they tend to be more popular or more frequently associated with the question entity. Second, confidence is strongly tied to the popularity of generated answers: even among incorrect predictions, more popular answers or those with higher question-answer co-occurrence receive higher confidence. Together, these findings suggest that popular but wrong alternatives may contribute to overconfidence. We further show that popularity-related signals can mitigate overconfidence and improve overall confidence estimation. Across six models and three datasets, incorporating knowledge popularity reduces average confidence on incorrect answers from 0.765 to 0.254 and overall ECE from 0.356 to 0.050, while improving Alignment from 77.08% to 83.72%.

View source

Similar papers

#natural language process... Preprint Aug 2026

Large Language Models Systematically Favor Popular Options: Evidence and Mitigation Across MCQs

A lightweight inference-time correction that estimates and removes a popularity prior from model predictions is proposed, which requires no fine-tuning, is label-free at test time, and adds negligible computational cost.

Abdelrahman Abdallah, Mohammed Ali, Bhawna Piryani et al. · 0 citations
Review Aug 2026

POOL: Propagated Uncertainty Over Lookalikes

This work instantiate this framework with p, a hybrid estimator that combines verbal confidence with spectral answer diversity computed from the negative von Neumann entropy of sampled answer embeddings, and achieves higher average AUROC than verbal confidence and sampling-based uncertainty while using half as many sam...

Rounak Sharma, Ananya B. Sai, Soumyabrata Pal · 0 citations

Blind Men and the Elephant: Probing the Epistemic Myopia of LLMs under Long-Tail Divergent Knowledge

Factual question answering (QA) typically assumes a single canonical answer, obscuring whether large language models (LLMs) retain divergent accounts of long-tail facts. To address this gap, we introduce ElephantBench, a closed-book knowledge probe comprising 1,094 questions generated through an auditable graph-based p...

Zhuo-Shi Pan, Jun-Ru Lu, Yan-Fei Qian et al. · 0 citations
Preprint Aug 2026

From token probabilities to calibrated confidence: An empirical study of mathematical question answering

This work compares single-pass estimators, which reuse token probabilities from the original generation, with multi-pass estimators, which obtain additional confidence signals through verification or stochastic forward passes, and finds that aggregating token probabilities over the full sequence captures small but cons...

A. Ma, Lorne Schell, Vin Bhaskara et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.