Uncertainty Quantification for Regression using Proper Scoring Rules
Alexander Fishkov, Kajetan Schweighofer, Mykyta Ielanskyi, Nikita Kotelevskii, Mohsen Guizani, Maxim Panov
TL;DR
The paper extends uncertainty quantification to regression by grounding measures in proper scoring rules, enabling a principled decomposition into aleatoric and epistemic uncertainty. It develops a unified framework that yields total, Bayes, and excess risks and provides closed-form or Gaussian-surrogate estimators under ensemble assumptions. The approach recovers and generalizes existing variance- and entropy-based regression UQ methods while offering new measures based on CRPS and quadratic scores. Extensive experiments on synthetic and real data demonstrate robust, task-aligned behavior across selective prediction, OOD detection, and active learning, guiding practitioners on which uncertainty measures to use in practice.
Abstract
Quantifying uncertainty of machine learning model predictions is essential for reliable decision-making, especially in safety-critical applications. Recently, uncertainty quantification (UQ) theory has advanced significantly, building on a firm basis of learning with proper scoring rules. However, these advances were focused on classification, while extending these ideas to regression remains challenging. In this work, we introduce a unified UQ framework for regression based on proper scoring rules, such as CRPS, logarithmic, squared error, and quadratic scores. We derive closed-form expressions for the resulting uncertainty measures under practical parametric assumptions and show how to estimate them using ensembles of models. In particular, the derived uncertainty measures naturally decompose into aleatoric and epistemic components. The framework recovers popular regression UQ measures based on predictive variance and differential entropy. Our broad evaluation on synthetic and real-world regression datasets provides guidance for selecting reliable UQ measures.
