Table of Contents
Fetching ...

Performance Estimation in Binary Classification Using Calibrated Confidence

Juhani Kivimäki, Jakub Białek, Wojtek Kuberski, Jukka K. Nurminen

TL;DR

CBPE presents a framework for unsupervised performance estimation of binary classifiers across multiple confusion-matrix metrics by leveraging calibrated confidence scores. It treats confusion-matrix elements as random variables to derive the full distribution—and thus confidence intervals—for $Accuracy$, $Precision$, $Recall$, and $F_1$, while offering fast point-estimate shortcuts. The method provides coverage guarantees under perfect calibration and demonstrates practical effectiveness via synthetic experiments and the TableShift benchmark, highlighting strengths and limitations under distribution shifts. This work enables uncertainty-aware monitoring of deployed classifiers without access to ground-truth labels, supporting better detection of performance changes in real-world settings with class imbalance and varying costs.

Abstract

Model monitoring is a critical component of the machine learning lifecycle, safeguarding against undetected drops in the model's performance after deployment. Traditionally, performance monitoring has required access to ground truth labels, which are not always readily available. This can result in unacceptable latency or render performance monitoring altogether impossible. Recently, methods designed to estimate the accuracy of classifier models without access to labels have shown promising results. However, there are various other metrics that might be more suitable for assessing model performance in many cases. Until now, none of these important metrics has received similar interest from the scientific community. In this work, we address this gap by presenting CBPE, a novel method that can estimate any binary classification metric defined using the confusion matrix. In particular, we choose four metrics from this large family: accuracy, precision, recall, and F$_1$, to demonstrate our method. CBPE treats the elements of the confusion matrix as random variables and leverages calibrated confidence scores of the model to estimate their distributions. The desired metric is then also treated as a random variable, whose full probability distribution can be derived from the estimated confusion matrix. CBPE is shown to produce estimates that come with strong theoretical guarantees and valid confidence intervals.

Performance Estimation in Binary Classification Using Calibrated Confidence

TL;DR

CBPE presents a framework for unsupervised performance estimation of binary classifiers across multiple confusion-matrix metrics by leveraging calibrated confidence scores. It treats confusion-matrix elements as random variables to derive the full distribution—and thus confidence intervals—for , , , and , while offering fast point-estimate shortcuts. The method provides coverage guarantees under perfect calibration and demonstrates practical effectiveness via synthetic experiments and the TableShift benchmark, highlighting strengths and limitations under distribution shifts. This work enables uncertainty-aware monitoring of deployed classifiers without access to ground-truth labels, supporting better detection of performance changes in real-world settings with class imbalance and varying costs.

Abstract

Model monitoring is a critical component of the machine learning lifecycle, safeguarding against undetected drops in the model's performance after deployment. Traditionally, performance monitoring has required access to ground truth labels, which are not always readily available. This can result in unacceptable latency or render performance monitoring altogether impossible. Recently, methods designed to estimate the accuracy of classifier models without access to labels have shown promising results. However, there are various other metrics that might be more suitable for assessing model performance in many cases. Until now, none of these important metrics has received similar interest from the scientific community. In this work, we address this gap by presenting CBPE, a novel method that can estimate any binary classification metric defined using the confusion matrix. In particular, we choose four metrics from this large family: accuracy, precision, recall, and F, to demonstrate our method. CBPE treats the elements of the confusion matrix as random variables and leverages calibrated confidence scores of the model to estimate their distributions. The desired metric is then also treated as a random variable, whose full probability distribution can be derived from the estimated confusion matrix. CBPE is shown to produce estimates that come with strong theoretical guarantees and valid confidence intervals.
Paper Structure (31 sections, 7 theorems, 38 equations, 3 figures, 4 tables, 3 algorithms)

This paper contains 31 sections, 7 theorems, 38 equations, 3 figures, 4 tables, 3 algorithms.

Key Result

Theorem 1

Let $f$ be a calibrated and confidence-consistent model operating on some target distribution $p_t(\boldsymbol{x}, y)$. Then, $\bar{S}^+$, $\bar{S}^-$, $1-\bar{S}^+$, and $1-\bar{S}^-$ are unbiased and consistent estimators for $\operatorname{TPF}_t(f)$, $\operatorname{FPF}_t(f)$, $\operatorname{TNF

Figures (3)

  • Figure 1: Mean approximation error (the difference of true and approximated expectations) of the shortcut estimators in 10,000 trials for each monitoring window size from 10 to 1,000. The shaded area depicts one standard deviation.
  • Figure 2: The fraction of times the actual value of a metric was within the predicted confidence interval over 10,000 trials.
  • Figure 3: Vizualization of our synthetic dataset for the 2-dimensional case.

Theorems & Definitions (16)

  • Definition 1
  • Definition 2
  • Theorem 1
  • Lemma 2
  • Definition 3
  • Theorem 3
  • proof
  • Lemma 4
  • proof
  • Corollary 5
  • ...and 6 more