A Matching Lower Bound for Online Smooth Calibration
Organizations: Department of Computer Science, University of California, Los Angeles, CA 90095, USA
Abstract
We study smooth calibration error in sequential binary prediction, a measure of how far probabilistic forecasts are from being calibrated that is robust to small perturbations of the forecasts. The minimax smooth calibration error is known to lie between and (Qiao and Zheng, 2024), where is the number of rounds. We close this gap for both adaptive and oblivious adversaries. We construct an adaptive adversary whose outcome mean moves with the forecaster's cumulative residual, which makes compensating for past residuals costly and forces every forecaster to incur expected smooth calibration error. Simulating this adversary against the forecaster's average prediction yields an oblivious adversary with the same guarantee. These lower bounds match the known upper bound up to universal constants, and are therefore minimax optimal. Our results also imply matching bounds for calibration distance and lower calibration distance. The proof ideas are partially developed by GPT-6 Astra under the authors' guidance.
Figures & tables
| Type | Reference | |||
| Upper Bound | Qiao and Zheng (2024) | |||
| Qiao and Zheng (2024) | ||||
| Lower Bound | This Work |