26 citations · 58 across the 10 of their papers we have counts for
9 papers · 1 filter
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…
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…
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…
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…
On the Properties of Convex Functions over Open Sets
Yoel Drori
We consider the class of smooth convex functions defined over an open convex set. We show that this class is essentially different than the class of smooth convex functions defined…
Efficient First-order Methods for Convex Minimization: a Constructive Approach
Yoel Drori, Adrien B. Taylor
We describe a novel constructive technique for devising efficient first-order methods for a wide range of large-scale convex minimization settings, including smooth, non-smooth, an…
The exact information-based complexity of smooth convex minimization
Yoel Drori
We obtain a new lower bound on the information-based complexity of first-order minimization of smooth and convex functions. We show that the bound matches the worst-case performanc…
An optimal variant of Kelley's cutting-plane method
Yoel Drori, Marc Teboulle
We propose a new variant of Kelley's cutting-plane method for minimizing a nonsmooth convex Lipschitz-continuous function over the Euclidean space. We derive the method through a c…
Performance of first-order methods for smooth convex minimization: a novel approach
Yoel Drori, Marc Teboulle
We introduce a novel approach for analyzing the performance of first-order black-box optimization methods. We focus on smooth unconstrained convex minimization over the Euclidean s…