Complexity-Based Approach to Calibration with Checking Rules


We consider the problem of forecasting a sequence of outcomes from an unknown source. The quality of the forecaster is measured by a family of checking rules. We prove upper bounds on the value of the associated game, thus certifying the existence of a calibrated strategy for the forecaster. We show that complexity of the family of checking rules can be… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.