On the Minimax Regret for Online Learning with Feedback Graphs

24 May 2023

Papers citing "On the Minimax Regret for Online Learning with Feedback Graphs"

8 / 8 papers shown

Title
Pure Exploration with Feedback Graphs Alessio Russo Yichen Song Aldo Pacchiano 38 0 0 10 Mar 2025
Adversarial Combinatorial Semi-bandits with Graph Feedback Yuxiao Wen 78 0 0 26 Feb 2025
A Near-optimal, Scalable and Corruption-tolerant Framework for Stochastic Bandits: From Single-Agent to Multi-Agent and Beyond Zicheng Hu Cheng Chen 72 0 0 11 Feb 2025
Improved Regret Bounds for Bandits with Expert Advice Nicolò Cesa-Bianchi Khaled Eldowa Emmanuel Esposito Julia Olkhovskaya 25 0 0 24 Jun 2024
Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds Shinji Ito Taira Tsuchiya Junya Honda 38 3 0 01 Mar 2024
Learning Thresholds with Latent Values and Censored Feedback Jiahao Zhang Tao Lin Weiqiang Zheng Zhe Feng Yifeng Teng Xiaotie Deng 25 2 0 07 Dec 2023
Pure Exploration under Mediators' Feedback Riccardo Poiani Alberto Maria Metelli Marcello Restelli 11 1 0 29 Aug 2023
On Interpolating Experts and Multi-Armed Bandits Houshuang Chen Yuchen He Chihao Zhang 22 4 0 14 Jul 2023