Sub-sampling for Efficient Non-Parametric Bandit Exploration

27 October 2020

Papers citing "Sub-sampling for Efficient Non-Parametric Bandit Exploration"

8 / 8 papers shown

Title
Batch Ensemble for Variance Dependent Regret in Stochastic Bandits Asaf B. Cassel Orin Levy Yishay Mansour OffRL 50 2 0 13 Sep 2024
Approximate information maximization for bandit games A. Barbier–Chebbah Christian L. Vestergaard Jean-Baptiste Masson Etienne Boursier 47 0 0 19 Oct 2023
A General Recipe for the Analysis of Randomized Multi-Armed Bandit Algorithms Dorian Baudry Kazuya Suzuki Junya Honda 60 5 0 10 Mar 2023
Efficient Algorithms for Extreme Bandits Dorian Baudry Yoan Russac E. Kaufmann 51 3 0 21 Mar 2022
Bregman Deviations of Generic Exponential Families Sayak Ray Chowdhury Patrick Saux Odalric-Ambrym Maillard Aditya Gopalan 71 12 0 18 Jan 2022
From Optimality to Robustness: Dirichlet Sampling Strategies in Stochastic Bandits Dorian Baudry Patrick Saux Odalric-Ambrym Maillard 65 7 0 18 Nov 2021
On Limited-Memory Subsampling Strategies for Bandits Dorian Baudry Yoan Russac Olivier Cappé 114 8 0 21 Jun 2021
$Stochastic Bandits with Vector Losses: Minimizing $\ell^\infty$-Norm of Relative Losses$ Stochastic Bandits with Vector Losses: Minimizing $\ell^\infty$ -Norm of Relative Losses Xuedong Shang Han Shao Jian Qian 54 0 0 15 Oct 2020