56 citations · 161 across the 22 of their papers we have counts for
35 papers
Locally Optimal Descent for Dynamic Stepsize Scheduling
Gilad Yehudai, Alon Cohen, Amit Daniely +3
We introduce a novel dynamic learning-rate scheduling scheme grounded in theory with the goal of simplifying the manual and time-consuming tuning of schedules in practice. Our appr…
Dueling Convex Optimization with General Preferences
Aadirupa Saha, Tomer Koren, Yishay Mansour
We address the problem of \emph{convex optimization with dueling feedback}, where the goal is to minimize a convex function given a weaker form of \emph{dueling} feedback. Each que…
Best-of-All-Worlds Bounds for Online Learning with Feedback Graphs
Liad Erez, Tomer Koren
We study the online learning with feedback graphs framework introduced by Mannor and Shamir (2011), in which the feedback received by the online learner is specified by a graph …
Never Go Full Batch (in Stochastic Convex Optimization)
Idan Amir, Yair Carmon, Tomer Koren +1
We study the generalization performance of optimization algorithms for stochastic convex optimization: these are first-order methods that only access the exact…
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…
Stochastic Multi-Armed Bandits with Unrestricted Delay Distributions
Tal Lancewicki, Shahar Segal, Tomer Koren +1
We study the stochastic Multi-Armed Bandit (MAB) problem with random delays in the feedback received by the algorithm. We consider two settings: the reward-dependent delay setting,…