536 citations · 905 across the 15 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.LG2013★ 7 cited
Bandits with Switching Costs: T^{2/3} Regret
Ofer Dekel, Jian Ding, Tomer Koren +1
We study the adversarial multi-armed bandit problem in a setting where the player incurs a unit cost each time he switches actions. We prove that the player's -round minimax reg…
cs.LG2013★ 50 cited
Online Learning with Switching Costs and Other Adaptive Adversaries
Nicolo Cesa-Bianchi, Ofer Dekel, Ohad Shamir
We study the power of different types of adaptive (nonoblivious) adversaries in the setting of prediction with expert advice, under both full-information and bandit feedback. We me…