Calibrated Probabilistic Forecasts for Arbitrary Sequences

Charles Marx, Volodymyr Kuleshov, Stefano Ermon
9/27/2024
cs.LGstat.ML

No confident code implementation found for this paper.

Abstract

Real-world data streams can change unpredictably due to distribution shifts, feedback loops and adversarial actors, which challenges the validity of forecasts. We present a forecasting framework ensuring valid uncertainty estimates regardless of how data evolves. Leveraging the concept of Blackwell approachability from game theory, we introduce a forecasting framework that guarantees calibrated uncertainties for outcomes in any compact space (e.g., classification or bounded regression). We extend this framework to recalibrate existing forecasters, guaranteeing calibration without sacrificing predictive performance. We implement both general-purpose gradient-based algorithms and algorithms optimized for popular special cases of our framework. Empirically, our algorithms improve calibration and downstream decision-making for energy systems.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{marx2024calibrated,
  title  = {Calibrated Probabilistic Forecasts for Arbitrary Sequences},
  author = {Charles Marx and Volodymyr Kuleshov and Stefano Ermon},
  year   = {2024},
  eprint = {2409.19157},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.19157v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.19157.svg)](https://codeofpaper.com/paper/2409.19157)

Discussion