Specification-Aware Predictive Uncertainty Decomposition
Roman Vashurin, Mikhail Seleznyov, Assel Yermekova, Fedor Chernogorskii, Danila Zykov, Elena Tutubalina, Alexander Panchenko, Preslav Nakov, Nikita Kotelevskii, Maxim Panov
Abstract
Classical decompositions of predictive uncertainty, such as the information-theoretic one, are defined for a fixed representation x of the input object. They do not consider that x may be incomplete, nor do they measure how much the missing information can affect the prediction. In Large Language Models, users can clarify an underspecified input without any retraining. The clarified input can describe the user's unobserved intent z* more accurately and change the predictive uncertainty about the outcome. In this paper, we formalize this setting probabilistically and derive a three-term decomposition of prediction risk into specification, residual aleatoric, and epistemic uncertainties. We show that at the original information level, when only x is available, the aleatoric uncertainty, represented by a Bayes risk, has two components. The first, which we call specification uncertainty, is the expected reduction in this Bayes risk from revealing the intent. The second is the residual aleatoric uncertainty, i.e., the Bayes risk that remains once the intent is known, averaged over its possible values z given x. The distinction is important, as specification uncertainty informs the decision to request clarification before making a prediction. We build approximations of these components and connect them to existing uncertainty measures. Our experiments across different domains and modalities show distinct roles for the three components. Specification uncertainty is the most informative for detecting underspecified inputs, while residual aleatoric uncertainty is the most informative for detecting in-distribution prediction errors.
Create a lesson
Related papers
Nearly Linear-Time Follow-the-Perturbed-Leader for Weakly Observable Graph Bandits
Jongyeong Lee, Hyundam Yoo
How Risky Is Your Data-Driven Policy?
Omar Besbes, Alon Rieger
Two-Layer Random ReLU Networks Can Separate Disjoint Classes
Yichen Liu, Jianbin Yang
Point interpolation and distributional universality in flow-based generative models
Antonio Álvarez-López, Jingpu Cheng, Liyan Zhang et al.
Nonparametric GARCH: An Iterated Neural Estimator
Ruizhi Deng, Guohao Shen, Ngai Hang Chan
Error Accumulation in Second-Order Sequential Machine Unlearning
Chen Shang, Haolin Zou, Binghe Zhu et al.