Refined Lower Bounds for Adversarial Bandits

24 May 2016

Papers citing "Refined Lower Bounds for Adversarial Bandits"

10 / 10 papers shown

Title
Information-Theoretic Regret Bounds for Bandits with Fixed Expert Advice Khaled Eldowa Nicolò Cesa-Bianchi Alberto Maria Metelli Marcello Restelli 16 3 0 14 Mar 2023
Pareto Regret Analyses in Multi-objective Multi-armed Bandit Mengfan Xu Diego Klabjan 27 7 0 01 Dec 2022
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
Quantum circuit architecture search for variational quantum algorithms Yuxuan Du Tao Huang Shan You Min-hsiu Hsieh Dacheng Tao 51 134 0 20 Oct 2020
Information Directed Sampling for Linear Partial Monitoring Johannes Kirschner Tor Lattimore Andreas Krause 24 46 0 25 Feb 2020
Exploration by Optimisation in Partial Monitoring Tor Lattimore Csaba Szepesvári 31 38 0 12 Jul 2019
Differential Privacy for Multi-armed Bandits: What Is It and What Is Its Cost? D. Basu Christos Dimitrakakis Aristide C. Y. Tossou 16 43 0 29 May 2019
More Adaptive Algorithms for Adversarial Bandits Chen-Yu Wei Haipeng Luo 19 179 0 10 Jan 2018
The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear Bandits Tor Lattimore Csaba Szepesvári 16 103 0 14 Oct 2016
Bounded regret in stochastic multi-armed bandits Sébastien Bubeck Vianney Perchet Philippe Rigollet 71 91 0 06 Feb 2013