2 citations · 4 across the 10 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021
Optimal Rates for Random Order Online Optimization
Uri Sherman, Tomer Koren, Yishay Mansour
We study online convex optimization in the random order model, recently proposed by \citet{garber2020online}, where the loss functions may be chosen by an adversary, but are then p…
cs.LG2021★ 1 cited
Lazy OCO: Online Convex Optimization on a Switching Budget
Uri Sherman, Tomer Koren
We study a variant of online convex optimization where the player is permitted to switch decisions at most times in expectation throughout rounds. Similar problems have bee…