How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Binned expected and maximum calibration error
Definition
Let and let be a nonempty finite evaluation sample, where and . For each , let , , and . Fix before evaluating the sample a finite Borel partition of . For and , define The binned expected calibration error and binned maximum calibration error for this sample and partition are These are finite-sample, bin-dependent summaries, not the population expected calibration error. They compare observed top-label accuracy with average confidence within bins; log loss and Brier loss instead score probability forecasts directly and are strictly proper.
Definition references
Top-label calibration: fixes the top-confidence and smallest-index tie conventions used for each sample prediction.
The Borel sigma-algebra of a topological space: specifies the measurable sets used in the fixed partition of .
Probability calibration and calibration error: defines a population expected calibration error using a supplied calibration function and discrepancy, distinct from the empirical binned statistic here.
Strictly proper scoring rules on a finite label set: defines proper scoring rules and the finite-label log and Brier losses.
Log and Brier losses are strictly proper: proves strict propriety of the log and Brier losses.
Guo et al., full paper, Section 2: defines binned ECE and MCE from within-bin accuracy and confidence.
Depends on
Used by
Dependency tree · two levels
14 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Chuan Guo, Geoff Pleiss, Yu Sun, and Kilian Q. Weinberger, On Calibration of Modern Neural Networks, ICML 2017, Section 2 (standard reference, not scraped)