Challenge: Existing uncertainty metrics for LLM search methods do not capture the diverse types of uncertainty needed to guide different optimization goals.
Approach: They propose a framework for uncertainty benchmarking that captures four different uncertainty types . the uncertainty types Answer, Correctness, Aleatoric, and Epistemic serve different optimization goals .
Outcome: The proposed framework identifies four different uncertainty types . the uncertainty types serve different optimization goals in LLM search .

Similar Papers

CoT-UQ: Improving Response-wise Uncertainty Quantification in LLMs with Chain-of-Thought (2025.findings-acl)

Copied to clipboard

Challenge: Existing uncertainty quantification methods for Large language models are primarily prompt-wise rather than response-wise, which leads to inefficiency.
Approach: They propose a new approach to quantify response-wise uncertainty by integrating LLMs’ inherent reasoning capabilities through Chain-of-Thought (CoT) into the UQ process.
Outcome: The proposed framework outperforms existing uncertainty quantification methods and achieves an average improvement of 5.9% AUROC compared to existing methods.
UBench: Benchmarking Uncertainty in Large Language Models with Multiple Choice Questions (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for benchmarking the uncertainty of large language models face challenges . existing methods require internal model access, additional training, or high computational costs .
Approach: They propose a new benchmark for evaluating the uncertainty of large language models based on confidence intervals . UBench encompasses 11,978 multiple choice questions spanning knowledge, language, understanding, and reasoning capabilities.
Outcome: The proposed method outperforms existing methods for benchmarking the uncertainty of large language models.
Rethinking LLM Uncertainty: A Multi-Agent Approach to Estimating Black-Box Model Uncertainty (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to gauge model’s uncertainty through self-consistency in responses to the target query are misleading: an LLM may confidently provide an incorrect answer to a target query, yet give a confident and accurate answer to that same query when answering a knowledge-preserving perturbation of the query.
Approach: They propose a method that uses multi-agent interaction to estimate black-box LLMs' uncertainty.
Outcome: The proposed method outperforms existing self-consistency based methods and improves hallucination detection.
Are LLM-Judges Robust to Expressions of Uncertainty? Investigating the effect of Epistemic Markers on LLM-based Evaluation (2025.naacl-long)

Copied to clipboard

Challenge: Existing efforts to train large language models to generate outputs containing epistemic markers have been largely overlooked.
Approach: They propose a benchmark to assess the robustness of LLM-judges to epistemic markers.
Outcome: EMBER benchmarks show that LLM-judges lack robustness in presence of epistemic markers . EMber QA (2,000 instances) and IF (2823 instances) are used to evaluate outputs containing epistemological markers.
MAQA: Evaluating Uncertainty Quantification in LLMs Regarding Data Uncertainty (2025.findings-naacl)

Copied to clipboard

Challenge: despite advances in large language models, they still produce false but incorrect responses.
Approach: They propose a new benchmark for large language models that requires more than two unambiguous answers . they also assess 5 different uncertainty quantification methods in the presence of data uncertainty.
Outcome: The proposed method fails in multi-answer question answering tasks compared to single-answered questions . entropy- and consistency-based methods effectively estimate model uncertainty, the authors show .
Reconsidering LLM Uncertainty Estimation Methods in the Wild (2025.acl-long)

Copied to clipboard

Challenge: Existing studies evaluate UE methods in short-form QA settings, but real-world deployment presents several challenges.
Approach: They examine UE methods' sensitivity to decision threshold selection and their robustness to query transformations such as typos and adversarial prompts.
Outcome: The proposed methods exhibit robustness against typos, adversarial prompts, and prior chat history, and are highly susceptible to adversarials.
Calibrating LLM Judges: Linear Probes for Fast and Reliable Uncertainty Estimation (2026.acl-industry)

Copied to clipboard

Challenge: Existing methods for obtaining well-calibrated uncertainty estimates are poorly calibrated or computationally expensive.
Approach: They propose a linear probe that provides calibrated uncertainty estimates from reasoning judges’ hidden states, requiring no additional model training.
Outcome: The proposed method achieves superior calibration compared to existing methods with x computational savings, generalizes robustly to unseen evaluation domains, and delivers higher accuracy on high-confidence predictions.
Beyond "I Don’t Know": Evaluating LLM Self-Awareness in Discriminating Data and Model Uncertainty (2026.acl-long)

Copied to clipboard

Challenge: Prior studies treat refusal as a generic "I don't know" lack of distinction limits downstream action decisions like requesting clarification or invoking external tools.
Approach: They propose a benchmark to evaluate explicit uncertainty attribution in large language models.
Outcome: The proposed method improves uncertainty attribution while preserving answer accuracy.
LLMs Are Not Intelligent Thinkers: Introducing Mathematical Topic Tree Benchmark for Comprehensive Evaluation of LLMs (2025.naacl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have impressive capabilities in mathematical reasoning, but their effectiveness is limited to specific mathematical topics.
Approach: They propose to use the MaTT benchmark to assess large language models' accuracy in multiple-choice scenarios.
Outcome: The proposed model achieved 54% accuracy in a multiple-choice scenario, while the Chain-of-Thought prompting did not improve.
Disentangling Uncertainty in Machine Translation Evaluation (2022.emnlp-main)

Copied to clipboard

Challenge: Trainable evaluation metrics for machine translation (MT) exhibit strong correlation with human judgements, but they are often hard to interpret and might produce unreliable scores under noisy or out-of-domain data.
Approach: They propose to use Monte Carlo dropout and deep ensembles to quantify uncertainty in machine translation and assess their ability to target different sources of aleatoric and epistemic uncertainty.
Outcome: The proposed measures can target different sources of aleatoric and epistemic uncertainty, with a reduction in computational costs.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations