HackerPapers

arXiv:2404.15993cs.LG

Uncertainty Estimation and Quantification for LLMs: A Simple Supervised Approach

Linyu Liu, Yu Pan, Xiaocheng Li, Guanting Chen

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

In this paper, we study the problem of uncertainty estimation and calibration for LLMs. We begin by formulating the uncertainty estimation problem, a relevant yet underexplored area in existing literature. We then propose a supervised approach that leverages labeled datasets to estimate the uncertainty in LLMs' responses. Based on the formulation, we illustrate the difference between the uncertainty estimation for LLMs and that for standard ML models and explain why the hidden neurons of the LLMs may contain uncertainty information. Our designed approach demonstrates the benefits of utilizing hidden activations to enhance uncertainty estimation across various tasks and shows robust transferability in out-of-distribution settings. We distinguish the uncertainty estimation task from the uncertainty calibration task and show that better uncertainty estimation leads to better calibration performance. Furthermore, our method is easy to implement and adaptable to different levels of model accessibility including black box, grey box, and white box.

arXiv comments
29 pages, 14 figures
Journal reference
DOI
Subjects
cs.LGMachine Learning cs.CLComputation and Language

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Dec 2024 to Dec 2024.

Comments linking this paper, per year.

Discussed in comments1 thread

    • "It doesn't" depends on specific implementation. "It can't" is wrong. https://arxiv.org/abs/2404.15993 "Uncertainty Estimation and Quantification for LLMs: A Simple Supervised Approach (...) our method is easy to implement and adaptable to different levels of model accessibility…

      viraptorView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.