Online Learning with Switching Costs and Other Adaptive Adversaries

18 February 2013

Papers citing "Online Learning with Switching Costs and Other Adaptive Adversaries"

23 / 73 papers shown

Title
Collaborative Top Distribution Identifications with Limited Interaction Nikolai Karpov Qin Zhang Yuanshuo Zhou 17 27 0 20 Apr 2020
Double Explore-then-Commit: Asymptotic Optimality and Beyond Tianyuan Jin Pan Xu Xiaokui Xiao Quanquan Gu 39 25 0 21 Feb 2020
Blind Network Revenue Management and Bandits with Knapsacks under Limited Switches D. Simchi-Levi Yunzong Xu Jinglong Zhao 4 2 0 04 Nov 2019
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition Lin Chen Qian-long Yu Hannah Lawrence Amin Karbasi 24 20 0 24 Oct 2019
Regret Bounds for Batched Bandits Hossein Esfandiari Amin Karbasi Abbas Mehrabian Vahab Mirrokni 36 61 0 11 Oct 2019
Stochastic Bandits with Delay-Dependent Payoffs Leonardo Cella Nicolò Cesa-Bianchi 6 37 0 07 Oct 2019
Bandits with Feedback Graphs and Switching Costs R. Arora T. V. Marinov M. Mohri 19 22 0 29 Jul 2019
Provably Efficient Q-Learning with Low Switching Cost Yu Bai Tengyang Xie Nan Jiang Yu Wang 21 92 0 30 May 2019
Phase Transitions in Bandits with Switching Constraints D. Simchi-Levi Yunzong Xu 14 9 0 26 May 2019
Competitive ratio versus regret minimization: achieving the best of both worlds Amit Daniely Yishay Mansour 6 2 0 07 Apr 2019
Batched Multi-armed Bandits Problem Zijun Gao Yanjun Han Zhimei Ren Zhengqing Zhou 16 138 0 03 Apr 2019
Improved Path-length Regret Bounds for Bandits Sébastien Bubeck Yuanzhi Li Haipeng Luo Chen-Yu Wei 11 46 0 29 Jan 2019
Online learning with graph-structured feedback against adaptive adversaries Zhili Feng Po-Ling Loh 11 7 0 01 Apr 2018
Online learning over a finite action set with limited switching Jason M. Altschuler Kunal Talwar 19 38 0 05 Mar 2018
Cooperating with Machines J. Crandall Mayada Oudah Tennom Chenlinangjia Fatimah Ishowo-Oloko Sherief Abdallah Jean‐François Bonnefon Manuel Cebrian A. Shariff M. Goodrich Iyad Rahwan 15 204 0 17 Mar 2017
Achieving Privacy in the Adversarial Multi-Armed Bandit Aristide C. Y. Tossou Christos Dimitrakakis 19 55 0 16 Jan 2017
A Survey of Online Experiment Design with the Stochastic Multi-Armed Bandit Giuseppe Burtini Jason L. Loeppky Ramon Lawrence 39 119 0 02 Oct 2015
Cheap Bandits M. Hanawal Venkatesh Saligrama Michal Valko Rémi Munos 20 30 0 15 Jun 2015
Batched bandit problems Vianney Perchet Philippe Rigollet Sylvain Chassang E. Snowberg OffRL 42 199 0 02 May 2015
Non-myopic learning in repeated stochastic games J. Crandall 24 6 0 30 Sep 2014
Online Learning with Composite Loss Functions O. Dekel Jian Ding Tomer Koren Yuval Peres 29 2 0 18 May 2014
$Bandits with Switching Costs: T^{2/3} Regret$ Bandits with Switching Costs: T^{2/3} Regret O. Dekel Jian Ding Tomer Koren Yuval Peres 27 96 0 11 Oct 2013
Online Convex Optimization Against Adversaries with Memory and Application to Statistical Arbitrage Oren Anava Elad Hazan Shie Mannor 32 8 0 27 Feb 2013