Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs

2 June 2022

Papers citing "Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs"

10 / 10 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
$A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $Θ(T^{2/3})$ and its Application to Best-of-Both-Worlds$ A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $Θ(T^{2/3})$ and its Application to Best-of-Both-Worlds Taira Tsuchiya Shinji Ito 26 0 0 30 May 2024
LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits Masahiro Kato Shinji Ito 36 0 0 05 Mar 2024
Best-of-Both-Worlds Linear Contextual Bandits Masahiro Kato Shinji Ito 53 0 0 27 Dec 2023
On the Minimax Regret for Online Learning with Feedback Graphs Khaled Eldowa Emmanuel Esposito Tommaso Cesari Nicolò Cesa-Bianchi 33 8 0 24 May 2023
A Blackbox Approach to Best of Both Worlds in Bandits and Beyond Christoph Dann Chen-Yu Wei Julian Zimmert 24 22 0 20 Feb 2023
Learning on the Edge: Online Learning with Stochastic Feedback Graphs Emmanuel Esposito Federico Fusco Dirk van der Hoeven Nicolò Cesa-Bianchi 13 14 0 09 Oct 2022
A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback Saeed Masoudian Julian Zimmert Yevgeny Seldin 31 18 0 29 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 21 15 0 01 Jun 2022
On Optimal Robustness to Adversarial Corruption in Online Decision Problems Shinji Ito 42 22 0 22 Sep 2021