Non-Asymptotic Calibration and Resolution
Abstract
We analyze a new algorithm for probability forecasting of binary observations on the basis of the available data, without making any assumptions about the way the observations are generated. The algorithm is shown to be well-calibrated and to have good resolution for long enough sequences of observations and for a suitable choice of its parameter, a kernel on the Cartesian product of the forecast space [0, 1] and the data space. Our main results are non-asymptotic: we establish explicit inequalities, shown to be tight, for the performance of the algorithm.
Cite
Text
Vovk. "Non-Asymptotic Calibration and Resolution." International Conference on Algorithmic Learning Theory, 2005. doi:10.1007/11564089_33Markdown
[Vovk. "Non-Asymptotic Calibration and Resolution." International Conference on Algorithmic Learning Theory, 2005.](https://mlanthology.org/alt/2005/vovk2005alt-nonasymptotic/) doi:10.1007/11564089_33BibTeX
@inproceedings{vovk2005alt-nonasymptotic,
title = {{Non-Asymptotic Calibration and Resolution}},
author = {Vovk, Vladimir},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2005},
pages = {429-443},
doi = {10.1007/11564089_33},
url = {https://mlanthology.org/alt/2005/vovk2005alt-nonasymptotic/}
}