activity
20122026
most citedEfficient First-order Methods for Convex Minimization: a Constructive Approach

26 citations · 58 across the 10 of their papers we have counts for

collaborators

13 papers

math.OC2026

Exact oracle complexity for function-value suboptimality under weighted initial conditions

Yoel Drori

We determine the exact worst-case function-value suboptimality after first-order oracle calls on -smooth, -strongly convex functions under a nonnegative weighted combinat…

cs.LG2023

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…

cs.LG2023★ 12 cited

Improving Training Stability for Multitask Ranking Models in Recommender Systems

Jiaxi Tang, Yoel Drori, Daryl Chang +6

Recommender systems play an important role in many content platforms. While most recommendation research is dedicated to designing better models to improve user experience, we foun…

math.OC2021★ 1 cited

Asynchronous Stochastic Optimization Robust to Arbitrary Delays

Alon Cohen, Amit Daniely, Yoel Drori +2

We consider stochastic optimization with delayed gradients where, at each time step , the algorithm makes an update using a stale stochastic gradient from step for som…

math.OC2021★ 1 cited

An optimal gradient method for smooth strongly convex minimization

Adrien Taylor, Yoel Drori

We present an optimal gradient method for smooth strongly convex optimization. The method is optimal in the sense that its worst-case bound on the distance to an optimal point exac…

math.OC2021

On the oracle complexity of smooth strongly convex minimization

Yoel Drori, Adrien Taylor

We construct a family of functions suitable for establishing lower bounds on the oracle complexity of first-order minimization of smooth strongly-convex functions. Based on this co…