Finite-Time Analysis of Kernelised Contextual Bandits

26 Sep 2013Michal ValkoNathaniel KordaRemi MunosIlias FlaounasNelo Cristianini

We tackle the problem of online reward maximisation over a large finite set of actions described by their contexts. We focus on the case when the number of actions is too big to sample all of them even once... (read more)

PDF Abstract


No code implementations yet. Submit your code now

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.