125 citations · 237 across the 22 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.OC2016★ 4 cited
Oracle Complexity of Second-Order Methods for Finite-Sum Problems
Yossi Arjevani, Ohad Shamir
Finite-sum optimization problems are ubiquitous in machine learning, and are commonly solved using first-order methods which rely on gradient computations. Recently, there has been…
math.OC2016★ 2 cited
Dimension-Free Iteration Complexity of Finite Sum Optimization Problems
Yossi Arjevani, Ohad Shamir
Many canonical machine learning problems boil down to a convex optimization problem with a finite sum structure. However, whereas much progress has been made in developing faster a…
math.OC2016★ 19 cited
On the Iteration Complexity of Oblivious First-Order Optimization Algorithms
Yossi Arjevani, Ohad Shamir
We consider a broad class of first-order optimization algorithms which are \emph{oblivious}, in the sense that their step sizes are scheduled regardless of the function under consi…