Online EXP3 Learning in Adversarial Bandits with Delayed Feedback

Part of Advances in Neural Information Processing Systems 32 (NeurIPS 2019)

AuthorFeedback »Bibtex »Bibtex »MetaReview »Metadata »Paper »Reviews »Supplemental »


Ilai Bistritz, Zhengyuan Zhou, Xi Chen, Nicholas Bambos, Jose Blanchet


<p>Consider a player that in each of T rounds chooses one of K arms. An adversary chooses the cost of each arm in a bounded interval, and a sequence of feedback delays \left{ d<em>{t}\right} that are unknown to the player. After picking arm a</em>{t} at round t, the player receives the cost of playing this arm d<em>{t} rounds later. In cases where t+d</em>{t}&gt;T, this feedback is simply missing. We prove that the EXP3 algorithm (that uses the delayed feedback upon its arrival) achieves a regret of O\left(\sqrt{\ln K\left(KT+\sum<em>{t=1}^{T}d</em>{t}\right)}\right). For the case where \sum<em>{t=1}^{T}d</em>{t} and T are unknown, we propose a novel doubling trick for online learning with delays and prove that this adaptive EXP3 achieves a regret of O\left(\sqrt{\ln K\left(K^{2}T+\sum<em>{t=1}^{T}d</em>{t}\right)}\right). We then consider a two player zero-sum game where players experience asynchronous delays. We show that even when the delays are large enough such that players no longer enjoy the “no-regret property”, (e.g., where d<em>{t}=O\left(t\log t\right)) the ergodic average of the strategy profile still converges to the set of Nash equilibria of the game. The result is made possible by choosing an adaptive step size \eta</em>{t} that is not summable but is square summable, and proving a “weighted regret bound” for this general case.</p>