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"

6 / 6 papers shown

Title
$Federated $\mathcal{X}$-armed Bandit with Flexible Personalisation$ Federated $\mathcal{X}$ -armed Bandit with Flexible Personalisation Ali Arabzadeh James A. Grant David S. Leslie FedML 37 0 0 11 Sep 2024
No-Regret Reinforcement Learning in Smooth MDPs Davide Maran Alberto Maria Metelli Matteo Papini Marcello Restell 57 4 0 06 Feb 2024
Apple Tasting Revisited: Bayesian Approaches to Partially Monitored Online Binary Classification James A. Grant David S. Leslie 75 3 0 29 Sep 2021
Policy Optimization as Online Learning with Mediator Feedback Alberto Maria Metelli Matteo Papini P. DÓro Marcello Restelli OffRL 49 10 0 15 Dec 2020
Smooth Bandit Optimization: Generalization to Hölder Space Yusha Liu Yining Wang Aarti Singh 47 10 0 11 Dec 2020
Continuum-Armed Bandits: A Function Space Perspective Shashank Singh 38 10 0 15 Oct 2020