DeepAI AI Chat
Log In Sign Up

A Geometric Proof of Calibration

12/18/2009
by   Shie Mannor, et al.
Cole Normale Suprieure
Technion
0

We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and simple and it follows from a direct application of Blackwell's approachability theorem to carefully chosen vector-valued payoff function and convex target set. Our proof captures the essence of existing proofs based on approachability (e.g., the proof by Foster, 1999 in case of binary outcomes) and highlights the intrinsic connection between approachability and calibration.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/13/2022

Calibrated Forecasts: The Minimax Proof

A formal write-up of the simple proof (1995) of the existence of calibra...
03/21/2021

Formal verification of Zagier's one-sentence proof

We comment on two formal proofs of Fermat's sum of two squares theorem, ...
12/18/2021

A Machine-Checked Direct Proof of the Steiner-Lehmus Theorem

A direct proof of the Steiner-Lehmus theorem has eluded geometers for ov...
05/02/2021

A structured proof of the Kolmogorov superposition theorem

We present a well-structured detailed exposition of a well-known proof o...
01/20/2022

Several Coercivity Proofs of First-Order System Least-Squares Methods for Second-Order Elliptic PDEs

In this paper, we present three versions of proofs of the coercivity for...
11/15/2021

Birkhoff's Completeness Theorem for Multi-Sorted Algebras Formalized in Agda

This document provides a formal proof of Birkhoff's completeness theorem...
01/03/2022

Online Generation of Proofs Without Words

Understanding geometric relationships with little mathematical knowledge...