A Closer Look at Small-loss Bounds for Bandits with Graph Feedback

2 February 2020

Papers citing "A Closer Look at Small-loss Bounds for Bandits with Graph Feedback"

9 / 9 papers shown

Title
uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs Yu Chen Jiatai Huang Yan Dai Longbo Huang 34 0 0 04 Oct 2024
Graph Neural Thompson Sampling Shuang Wu Arash A. Amini 56 0 0 15 Jun 2024
Online Network Source Optimization with Graph-Kernel MAB Laura Toni P. Frossard 29 1 0 07 Jul 2023
Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression Junfan Li Shizhong Liao 27 0 0 14 Jun 2023
Regret Minimization and Convergence to Equilibria in General-sum Markov Games Liad Erez Tal Lancewicki Uri Sherman Tomer Koren Yishay Mansour 42 25 0 28 Jul 2022
Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality T. V. Marinov M. Mohri Julian Zimmert 16 6 0 20 Jun 2022
Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits Haipeng Luo Mengxiao Zhang Peng Zhao Zhi-Hua Zhou 34 17 0 12 Feb 2022
The best of both worlds: stochastic and adversarial episodic MDPs with unknown transition Tiancheng Jin Longbo Huang Haipeng Luo 27 40 0 08 Jun 2021
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition Liyu Chen Haipeng Luo Chen-Yu Wei 29 32 0 07 Dec 2020