English

Semantic Token Clustering for Efficient Uncertainty Quantification in Large Language Models

Computation and Language 2026-03-23 v1 Artificial Intelligence Machine Learning

Abstract

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.

Keywords

Cite

@article{arxiv.2603.20161,
  title  = {Semantic Token Clustering for Efficient Uncertainty Quantification in Large Language Models},
  author = {Qi Cao and Andrew Gambardella and Takeshi Kojima and Yutaka Matsuo and Yusuke Iwasawa},
  journal= {arXiv preprint arXiv:2603.20161},
  year   = {2026}
}

Comments

EACL 2026

R2 v1 2026-07-01T11:30:07.747Z