Smoothed Elicitation Complexity for Approximate $\Gamma$-calibration of Discrete Classification Tasks

# Smoothed Elicitation Complexity for Approximate $Γ$-calibration of Discrete Classification Tasks
Source: [https://arxiv.org/abs/2605.23017](https://arxiv.org/abs/2605.23017)
[View PDF](https://arxiv.org/pdf/2605.23017)

> Abstract:One prominent method of evaluating machine learning model trustworthiness is the notion of calibration\. In the binary outcome setting, a probabilistic predictor is calibrated if outcomes are realized according to a model's distributional prediction, conditioned on this prediction\. Straightforward extensions of binary calibration definitions to probabilistic multiclass classifiers suffer from an exponential complexity blowup as the space of predictions grows exponentially in the number of classes $n$\. As a remedy, Noarov and Roth \(2023\) propose multiclass calibration with predictions that are properties of the outcome distribution, reducing complexity from growing in the number of classes $n$ to the dimension $d$ of the property, called its elicitation complexity\. Previous work on approximate property calibration is generally limited to continuous scalar properties, despite many relevant properties of interest being discrete, like the mode or rankings\. We characterize the approximate property calibration of discrete properties which are strongly orderable by using Lipschitz continuous properties as an intermediary\. This work is the first to our knowledge to provide approximate calibration results for discrete properties\. Along the way, we characterize the Lipschitz elicitation complexity of strongly orderable discrete properties by constructing algorithms for designing these Lipschitz properties, which we prove can be post\-processed to obtain the original discrete property\.

## Submission history

From: Jessica Finocchiaro \[[view email](https://arxiv.org/show-email/774eb2b1/2605.23017)\] **\[v1\]**Thu, 21 May 2026 20:39:20 UTC \(136 KB\)