Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

Semantic Token Clustering for Efficient Uncertainty Quantification in Large Language Models

About

Large language models (LLMs) have demonstrated remarkable capabilities across diverse tasks. However, the truthfulness of their outputs is not guaranteed, and their tendency toward overconfidence further limits reliability. Uncertainty quantification offers a promising way to identify potentially unreliable outputs, but most existing methods rely on repeated sampling or auxiliary models, introducing substantial computational overhead. To address these limitations, we propose Semantic Token Clustering (STC), an efficient uncertainty quantification method that leverages the semantic information inherently encoded in LLMs. Specifically, we group tokens into semantically consistent clusters using embedding clustering and prefix matching, and quantify uncertainty based on the probability mass aggregated over the corresponding semantic cluster. Our approach requires only a single generation and does not depend on auxiliary models. Experimental results show that STC achieves performance comparable to state-of-the-art baselines while substantially reducing computational overhead.

Qi Cao, Andrew Gambardella, Takeshi Kojima, Yutaka Matsuo, Yusuke Iwasawa• 2026

Related benchmarks

TaskDatasetResultRank
Question AnsweringNQ
PRR0.65
90
Question AnsweringTQA
PRR86.1
90
Question AnsweringWQ
PRR62.8
90
Question AnsweringTQA (test)
AUROC90.2
90
Question AnsweringWQ (test)
AUROC76.6
90
Question AnsweringNQ (test)
AUROC82.7
90
Inference EfficiencyNatural Questions (NQ)
Relative Overhead (%)0.529
90
Question AnsweringNQ
Absolute Execution Time Overhead (s)3.028
90
Question AnsweringTQA
Absolute Execution Time Overhead (s)6.138
90
Question AnsweringWQ
Absolute Execution Time Overhead (s)3.106
90
Showing 10 of 12 rows

Other info

Follow for update