47 citations · 327 across the 38 of their papers we have counts for
4 papers · 1 filter
Exploration-Enhanced POLITEX
Yasin Abbasi-Yadkori, Nevena Lazic, Csaba Szepesvari +1
We study algorithms for average-cost reinforcement learning problems with value function approximation. Our starting point is the recently proposed POLITEX algorithm, a version of…
Thompson Sampling with Approximate Inference
My Phan, Yasin Abbasi-Yadkori, Justin Domke
We study the effects of approximate inference on the performance of Thompson sampling in the -armed bandit problems. Thompson sampling is a successful algorithm for online decis…
Bootstrapping Upper Confidence Bound
Botao Hao, Yasin Abbasi-Yadkori, Zheng Wen +1
Upper Confidence Bound (UCB) method is arguably the most celebrated one used in online decision making with partial information feedback. Existing techniques for constructing confi…
Large-Scale Markov Decision Problems via the Linear Programming Dual
Yasin Abbasi-Yadkori, Peter L. Bartlett, Xi Chen +1
We consider the problem of controlling a fully specified Markov decision process (MDP), also known as the planning problem, when the state space is very large and calculating the o…