Graph-based Confidence Calibration for Large Language Models
Yukun Li, Sijia Wang, Lifu Huang, Li-Ping Liu
TL;DR
The paper addresses the challenge of calibrating LLM confidence by leveraging self-consistency across multiple responses. It proposes a learning-based framework that constructs a consistency graph from candidate answers and uses a graph neural network to estimate the correctness probability for each response, with edge weights based on semantic similarity. The approach demonstrates strong calibration gains (lower ECE, higher AUROC) across multiple QA datasets and shows robust out-of-domain generalization, outperforming several baselines including APRICOT and GraphSpectral variants. This graph-based auxiliary calibration enables more trustworthy LLM deployments by providing reliable confidence estimates and supporting abstention for uncertain cases.
Abstract
Reliable confidence estimation is essential for enhancing the trustworthiness of large language models (LLMs), especially in high-stakes scenarios. Despite its importance, accurately estimating confidence in LLM responses remains a significant challenge. In this work, we propose using an auxiliary learning model to assess response correctness based on the self-consistency of multiple outputs generated by the LLM. Our method builds a consistency graph to represent the agreement among multiple responses and uses a graph neural network (GNN) to estimate the likelihood that each response is correct. Experiments demonstrate that this method has strong calibration performance on various benchmark datasets and generalizes well to out-of-domain cases.
