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

In three linesTheoretical study on multiclass classifier calibration. Authors characterize elicitation complexity for discrete orderable properties (mode, rankings) using Lipschitz continuous properties as intermediary, solving exponential complexity blowup in number of classes.

Summary generated by Claude — human-verified