Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback

30 September 2014

Papers citing "Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback"

35 / 35 papers shown

Title
Adversarial Combinatorial Semi-bandits with Graph Feedback Yuxiao Wen 80 0 0 26 Feb 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
Improved Regret Bounds for Bandits with Expert Advice Nicolò Cesa-Bianchi Khaled Eldowa Emmanuel Esposito Julia Olkhovskaya 40 0 0 24 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
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
New Guarantees for Learning Revenue Maximizing Menus of Lotteries and Two-Part Tariffs Maria-Florina Balcan Hedyeh Beyhaghi 23 3 0 22 Feb 2023
Repeated Bilateral Trade Against a Smoothed Adversary Nicolò Cesa-Bianchi Tommaso Cesari Roberto Colomboni Federico Fusco S. Leonardi 41 16 0 21 Feb 2023
Invariant Lipschitz Bandits: A Side Observation Approach Nam-Phuong Tran Long Tran-Thanh 53 1 0 14 Dec 2022
Learning on the Edge: Online Learning with Stochastic Feedback Graphs Emmanuel Esposito Federico Fusco Dirk van der Hoeven Nicolò Cesa-Bianchi 24 14 0 09 Oct 2022
Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs Haipeng Luo Hanghang Tong Mengxiao Zhang Yuheng Zhang 24 5 0 04 Oct 2022
Online Learning in Supply-Chain Games Nicolò Cesa-Bianchi Tommaso Cesari Takayuki Osogami M. Scarsini Segev Wasserkrug 43 3 0 08 Jul 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
Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs Shinji Ito Taira Tsuchiya Junya Honda 35 24 0 02 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
Graph-Assisted Communication-Efficient Ensemble Federated Learning P. M. Ghari Yanning Shen FedML 27 4 0 27 Feb 2022
Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits Suprovat Ghoshal Aadirupa Saha 25 11 0 23 Feb 2022
Versatile Dueling Bandits: Best-of-both-World Analyses for Online Learning from Preferences Aadirupa Saha Pierre Gaillard 41 8 0 14 Feb 2022
Online Learning with Uncertain Feedback Graphs P. M. Ghari Yanning Shen 19 3 0 15 Jun 2021
Experts with Lower-Bounded Loss Feedback: A Unifying Framework Eyal Gofer Guy Gilboa OffRL 16 0 0 17 Dec 2020
Policy Optimization as Online Learning with Mediator Feedback Alberto Maria Metelli Matteo Papini P. DÓro Marcello Restelli OffRL 27 10 0 15 Dec 2020
Information Directed Sampling for Linear Partial Monitoring Johannes Kirschner Tor Lattimore Andreas Krause 24 46 0 25 Feb 2020
A Closer Look at Small-loss Bounds for Bandits with Graph Feedback Chung-Wei Lee Haipeng Luo Mengxiao Zhang 17 23 0 02 Feb 2020
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio Julian Zimmert Tor Lattimore 30 34 0 28 May 2019
Feedback graph regret bounds for Thompson Sampling and UCB Thodoris Lykouris Éva Tardos Drishti Wali 19 29 0 23 May 2019
Almost Boltzmann Exploration Harsh Gupta Seo Taek Kong R. Srikant Weina Wang 19 1 0 25 Jan 2019
Contextual Bandits with Cross-learning S. Balseiro Negin Golrezaei Mohammad Mahdian Vahab Mirrokni Jon Schneider 21 50 0 25 Sep 2018
Multi-Armed Bandits on Partially Revealed Unit Interval Graphs Xiao Xu Sattar Vakili Qing Zhao A. Swami 18 5 0 12 Feb 2018
Online Learning with Abstention Corinna Cortes Giulia DeSalvo Claudio Gentile M. Mohri Scott Yang 17 47 0 09 Mar 2017
Horde of Bandits using Gaussian Markov Random Fields Sharan Vaswani Mark Schmidt L. Lakshmanan 26 14 0 07 Mar 2017
Delay and Cooperation in Nonstochastic Bandits Nicolò Cesa-Bianchi Claudio Gentile Yishay Mansour Alberto Minora 17 144 0 15 Feb 2016
Regret Guarantees for Item-Item Collaborative Filtering Guy Bresler Devavrat Shah L. Voloch 23 28 0 20 Jul 2015
Explore no more: Improved high-probability regret bounds for non-stochastic bandits Gergely Neu 30 181 0 10 Jun 2015
Online Learning with Feedback Graphs: Beyond Bandits N. Alon Nicolò Cesa-Bianchi O. Dekel Tomer Koren 24 156 0 26 Feb 2015