6 citations · 6 across the 2 of their papers we have counts for
4 papers · 1 filter
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…