"Calibeating": Beating Forecasters at Their Own Game

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Foster, Dean P., Hart, Sergiu
Format: Preprint
Veröffentlicht: 2022
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866917352986116096
author Foster, Dean P.
Hart, Sergiu
author_facet Foster, Dean P.
Hart, Sergiu
contents In order to identify expertise, forecasters should not be tested by their calibration score, which can always be made arbitrarily small, but rather by their Brier score. The Brier score is the sum of the calibration score and the refinement score; the latter measures how good the sorting into bins with the same forecast is, and thus attests to "expertise." This raises the question of whether one can gain calibration without losing expertise, which we refer to as "calibeating." We provide an easy way to calibeat any forecast, by a deterministic online procedure. We moreover show that calibeating can be achieved by a stochastic procedure that is itself calibrated, and then extend the results to simultaneously calibeating multiple procedures, and to deterministic procedures that are continuously calibrated.
format Preprint
id arxiv_https___arxiv_org_abs_2209_04892
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle "Calibeating": Beating Forecasters at Their Own Game
Foster, Dean P.
Hart, Sergiu
Theoretical Economics
Computer Science and Game Theory
Machine Learning
In order to identify expertise, forecasters should not be tested by their calibration score, which can always be made arbitrarily small, but rather by their Brier score. The Brier score is the sum of the calibration score and the refinement score; the latter measures how good the sorting into bins with the same forecast is, and thus attests to "expertise." This raises the question of whether one can gain calibration without losing expertise, which we refer to as "calibeating." We provide an easy way to calibeat any forecast, by a deterministic online procedure. We moreover show that calibeating can be achieved by a stochastic procedure that is itself calibrated, and then extend the results to simultaneously calibeating multiple procedures, and to deterministic procedures that are continuously calibrated.
title "Calibeating": Beating Forecasters at Their Own Game
topic Theoretical Economics
Computer Science and Game Theory
Machine Learning
url https://arxiv.org/abs/2209.04892