Feedback graph regret bounds for Thompson Sampling and UCB

23 May 2019

Papers citing "Feedback graph regret bounds for Thompson Sampling and UCB"

11 / 11 papers shown

Title
Asymptotically-Optimal Gaussian Bandits with Side Observations Alexia Atsidakou Orestis Papadigenopoulos Constantine Caramanis Sujay Sanghavi Sanjay Shakkottai 19 4 0 15 May 2025
Graph Feedback Bandits on Similar Arms: With and Without Graph Structures Han Qi Fei-Yu Guo Li Zhu Qiaosheng Zhang Xiaochen Li 43 0 0 24 Jan 2025
Graph Neural Thompson Sampling Shuang Wu Arash A. Amini 56 0 0 15 Jun 2024
Graph Feedback Bandits with Similar Arms Han Qi Guo Fei Li Zhu 27 0 0 18 May 2024
Stochastic contextual bandits with graph feedback: from independence number to MAS number Yuxiao Wen Yanjun Han Zhengyuan Zhou 47 1 0 12 Feb 2024
Stochastic Graph Bandit Learning with Side-Observations Xueping Gong Jiheng Zhang 34 1 0 29 Aug 2023
Online Network Source Optimization with Graph-Kernel MAB Laura Toni P. Frossard 34 1 0 07 Jul 2023
Invariant Lipschitz Bandits: A Side Observation Approach Nam-Phuong Tran Long Tran-Thanh 51 1 0 14 Dec 2022
Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality T. V. Marinov M. Mohri Julian Zimmert 24 6 0 20 Jun 2022
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs Chloé Rouyer Dirk van der Hoeven Nicolò Cesa-Bianchi Yevgeny Seldin 28 15 0 01 Jun 2022
Online Learning with Abstention Corinna Cortes Giulia DeSalvo Claudio Gentile M. Mohri Scott Yang 14 47 0 09 Mar 2017