On the Iteration Complexity of Oblivious First-Order Optimization Algorithms

11 May 2016

Papers citing "On the Iteration Complexity of Oblivious First-Order Optimization Algorithms"

7 / 7 papers shown

Title
Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization Haochuan Li Yi Tian Jingzhao Zhang Ali Jadbabaie 24 40 0 18 Apr 2021
Why Are Convolutional Nets More Sample-Efficient than Fully-Connected Nets? Zhiyuan Li Yi Zhang Sanjeev Arora BDL MLT 11 39 0 16 Oct 2020
Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations Yossi Arjevani Y. Carmon John C. Duchi Dylan J. Foster Ayush Sekhari Karthik Sridharan 87 53 0 24 Jun 2020
Complexity Guarantees for Polyak Steps with Momentum Mathieu Barré Adrien B. Taylor Alexandre d’Aspremont 22 26 0 03 Feb 2020
Accelerating Smooth Games by Manipulating Spectral Shapes Waïss Azizian Damien Scieur Ioannis Mitliagkas Simon Lacoste-Julien Gauthier Gidel 33 48 0 02 Jan 2020
Optimal algorithms for smooth and strongly convex distributed optimization in networks Kevin Scaman Francis R. Bach Sébastien Bubeck Y. Lee Laurent Massoulié 18 325 0 28 Feb 2017
Dimension-Free Iteration Complexity of Finite Sum Optimization Problems Yossi Arjevani Ohad Shamir 18 24 0 30 Jun 2016