Blackwell Approachability and No-Regret Learning Are Equivalent
Abstract
We consider the celebrated Blackwell Approachability Theorem for two-player games with vector payoffs. Blackwell himself previously showed that the theorem implies the existence of a “no-regret” algorithm for a simple online learning problem. We show that this relationship is in fact much stronger, that Blackwell’s result is equivalent to, in a very strong sense, the problem of regret minimization for Online Linear Optimization. We show that any algorithm for one such problem can be efficiently converted into an algorithm for the other. We provide one novel application of this reduction: the first efficient algorithm for calibrated forecasting.
Cite
Text
Abernethy et al. "Blackwell Approachability and No-Regret Learning Are Equivalent." Proceedings of the 24th Annual Conference on Learning Theory, 2011.Markdown
[Abernethy et al. "Blackwell Approachability and No-Regret Learning Are Equivalent." Proceedings of the 24th Annual Conference on Learning Theory, 2011.](https://mlanthology.org/colt/2011/abernethy2011colt-blackwell/)BibTeX
@inproceedings{abernethy2011colt-blackwell,
title = {{Blackwell Approachability and No-Regret Learning Are Equivalent}},
author = {Abernethy, Jacob and Bartlett, Peter L. and Hazan, Elad},
booktitle = {Proceedings of the 24th Annual Conference on Learning Theory},
year = {2011},
pages = {27-46},
volume = {19},
url = {https://mlanthology.org/colt/2011/abernethy2011colt-blackwell/}
}