47 citations · 327 across the 38 of their papers we have counts for
Showing 2019 · cs.LGShow all
2 papers · 2 filters
cs.LG2019★ 19 cited
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…
cs.LG2019★ 9 cited
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…