← Search

Yasin Abbasi Yadkori

7 accepted papers

2020

Model Selection in Contextual Stochastic Bandit Problems

NeurIPS 2020poster

We study bandit model selection in stochastic environments. Our approach relies on a master algorithm that selects between candidate base algorithms. We develop a master-base algorithm abstraction that can work with general classes of base algorithms and different type of adversarial master algorith…

Cited by 117SourcePDFScholar
2017

Conservative Contextual Linear Bandits

NeurIPS 2017poster

Safety is a desirable property that can immensely increase the applicability of learning algorithms in real-world decision-making problems. It is much easier for a company to deploy an algorithm that is safe, i.e., guaranteed to perform at least as well as a baseline. In this paper, we study the iss…

Cited by 131SourcePDFScholar
2017

Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem

NeurIPS 2017poster

We study minimax strategies for the online prediction problem with expert advice. It has been conjectured that a simple adversary strategy, called COMB, is near optimal in this game for any number of experts. Our results and new insights make progress in this direction by showing that, up to a small…

Cited by 17SourcePDFScholar