81 citations · 673 across the 80 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2014
Online Learning with Composite Loss Functions
Ofer Dekel, Jian Ding, Tomer Koren +1
We study a new class of online learning problems where each of the online algorithm's actions is assigned an adversarial value, and the loss of the algorithm at each step is a know…
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…