# Explicit Asymptotic Bounds for Sequential Calibration Beyond T2/3

arXiv: https://arxiv.org/abs/2610.07623 · HTML: https://mlsanity.com/paper/2610.07623/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 11 references that are in the map.
- First posted on arXiv 6 Oct 2026.

## Builds on (most cited first, 1 of 1)

- [Efficient Sequential Calibration with O(T2/3-ε) Error Bound](https://mlsanity.com/paper/2607.12928/) (2026)

## Abstract (arXiv)

Probability forecasts are calibrated when predicted probabilities match empirical outcome frequencies: among events assigned a probability p, we'd hope that the fraction of positive outcomes is close to p. We study the problem of sequential forecasting of binary outcomes. The classical O(T2/3) bound on expected cumulative ℓ1-calibration error established by Foster and Vohra stood for over two decades until Dagan et al. reduced the exponent 2/3 by an unspecified constant. We establish a new two-phase recursive labeling strategy for the sign-preservation-with-reuse game that yields the bound O(nαtβ) for all choices of space and time. We then sharpen the reduction from upper bounds on sign preservation to calibration by modifying the equivalence of Dagan et al. to use only O(log T) instances of the sign-preservation-with-reuse game. This lets us establish an explicit bound of O(T0.662942288), the first explicit exponent below 2/3 for sequential calibration, by combining both improvements and choosing explicit feasible parameters.