Efficient Algorithms for Adversarial Contextual LearningDownload PDFOpen Website

2016 (modified: 11 Nov 2022)ICML 2016Readers: Everyone
Abstract: We provide the first oracle efficient sublinear regret algorithms for adversarial versions of the contextual bandit problem. In this problem, the learner repeatedly makes an action on the basis of ...
0 Replies

Loading