title | abstract | layout | series | publisher | issn | id | month | tex_title | firstpage | lastpage | page | order | cycles | bibtex_author | author | date | address | container-title | volume | genre | issued | extras | ||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Faster online calibration without randomization: interval forecasts and the power of two choices |
We study the problem of making calibrated probabilistic forecasts for a binary sequence generated by an adversarial nature. Following the seminal paper of Foster and Vohra (1998), nature is often modeled as an adaptive adversary who sees all activity of the forecaster except the randomization that the forecaster may deploy. A number of papers have proposed randomized forecasting strategies that achieve an |
inproceedings |
Proceedings of Machine Learning Research |
PMLR |
2640-3498 |
gupta22b |
0 |
Faster online calibration without randomization: interval forecasts and the power of two choices |
4283 |
4309 |
4283-4309 |
4283 |
false |
Gupta, Chirag and Ramdas, Aaditya |
|
2022-06-28 |
Proceedings of Thirty Fifth Conference on Learning Theory |
178 |
inproceedings |
|