Improved Path-length Regret Bounds for Bandits

Improved Path-length Regret Bounds for Bandits

29 January 2019

Sébastien Bubeck

Papers citing "Improved Path-length Regret Bounds for Bandits"

12 / 12 papers shown

Title
Near Optimal Memory-Regret Tradeoff for Online Learning Binghui Peng A. Rubinstein CLL 34 10 0 03 Mar 2023
A Blackbox Approach to Best of Both Worlds in Bandits and Beyond Christoph Dann Chen-Yu Wei Julian Zimmert 31 22 0 20 Feb 2023
Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds Shinji Ito Taira Tsuchiya Junya Honda AAML 23 16 0 14 Jun 2022
Decentralized, Communication- and Coordination-free Learning in Structured Matching Markets C. Maheshwari Eric Mazumdar S. Shankar Sastry 29 11 0 06 Jun 2022
Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed Bandits Jiatai Huang Yan Dai Longbo Huang 27 14 0 28 Jan 2022
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition Liyu Chen Haipeng Luo Chen-Yu Wei 34 32 0 07 Dec 2020
Bandits with adversarial scaling Thodoris Lykouris Vahab Mirrokni R. Leme 14 14 0 04 Mar 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
Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processes Chen-Yu Wei Mehdi Jafarnia-Jahromi Haipeng Luo Hiteshi Sharma R. Jain 107 100 0 15 Oct 2019
Bandit Convex Optimization in Non-stationary Environments Peng Zhao G. Wang Lijun Zhang Zhi-Hua Zhou 36 41 0 29 Jul 2019
Exploration by Optimisation in Partial Monitoring Tor Lattimore Csaba Szepesvári 33 38 0 12 Jul 2019
Equipping Experts/Bandits with Long-term Memory Kai Zheng Haipeng Luo Ilias Diakonikolas Liwei Wang OffRL 22 15 0 30 May 2019