On Thompson Sampling for Smoother-than-Lipschitz Bandits

v1v2 (latest)

On Thompson Sampling for Smoother-than-Lipschitz Bandits

8 January 2020

James A. Grant

David S. Leslie

ArXiv (abs)PDF HTML

Papers citing "On Thompson Sampling for Smoother-than-Lipschitz Bandits"

8 / 8 papers shown

Title
Introduction to Multi-Armed Bandits Aleksandrs Slivkins 673 1,024 0 15 Apr 2019
Thompson Sampling for Combinatorial Semi-Bandits Siwei Wang Wei Chen 64 130 0 13 Mar 2018
Variational inference for the multi-armed contextual bandit Iñigo Urteaga C. Wiggins 80 29 0 10 Sep 2017
Ensemble Sampling Xiuyuan Lu Benjamin Van Roy 152 121 0 20 May 2017
Bandits and Experts in Metric Spaces Robert D. Kleinberg Aleksandrs Slivkins E. Upfal 183 125 0 04 Dec 2013
Thompson Sampling: An Asymptotically Optimal Finite Time Analysis E. Kaufmann N. Korda Rémi Munos 187 588 0 18 May 2012
Lipschitz Bandits without the Lipschitz Constant Sébastien Bubeck Gilles Stoltz Jia Yuan Yu 168 89 0 25 May 2011
Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design Niranjan Srinivas Andreas Krause Sham Kakade Matthias Seeger 186 1,626 0 21 Dec 2009