Efficient Calibration for Decision Making

Read full text
Authors: Parikshit Gopalan, Konstantinos Stavropoulos, Kunal Talwar, Pranay Tankala
Cited by: 0

Abstract

A decision-theoretic characterization of perfect calibration is that an agent seeking to minimize a proper loss in expectation cannot improve their outcome by post-processing a perfectly calibrated predictor. Hu and Wu (FOCS’24) use this to define an approximate calibration measure called calibration decision loss (CDL), which measures the maximal improvement achievable by any post-processing over any proper loss. Unfortunately, CDL turns out to be intractable to even weakly approximate in the offline setting, given black-box access to the predictions and labels.

Fields of Study & Subjects

Machine Learning and Algorithms Advanced Bandit Algorithms Research Adversarial Robustness in Machine Learning

Publication details

Pages
2164–2175
Publication date
9 June 2026