On Lower and Upper Bounds for Smooth and Strongly Convex Optimization Problems

23 March 2015

Papers citing "On Lower and Upper Bounds for Smooth and Strongly Convex Optimization Problems"

11 / 11 papers shown

Title
Tight last-iterate convergence rates for no-regret learning in multi-player games Noah Golowich S. Pattathil C. Daskalakis 121 82 0 26 Oct 2020
Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems Noah Golowich S. Pattathil C. Daskalakis Asuman Ozdaglar 70 105 0 31 Jan 2020
Towards Riemannian Accelerated Gradient Methods Hongyi Zhang S. Sra 78 53 0 07 Jun 2018
Parametrized Accelerated Methods Free of Condition Number Chaoyue Liu M. Belkin 27 2 0 28 Feb 2018
Lower Bounds for Higher-Order Convex Optimization Naman Agarwal Elad Hazan 78 46 0 27 Oct 2017
Dimension-Free Iteration Complexity of Finite Sum Optimization Problems Yossi Arjevani Ohad Shamir 61 24 0 30 Jun 2016
Adversarial Delays in Online Strongly-Convex Optimization Daniel Khashabi Kent Quanrud Amirhossein Taghvaei 49 2 0 20 May 2016
On the Iteration Complexity of Oblivious First-Order Optimization Algorithms Yossi Arjevani Ohad Shamir 82 33 0 11 May 2016
A Variational Perspective on Accelerated Methods in Optimization Andre Wibisono Ashia Wilson Michael I. Jordan 95 575 0 14 Mar 2016
SDCA without Duality, Regularization, and Individual Convexity Shai Shalev-Shwartz 63 104 0 04 Feb 2016
Semantics, Representations and Grammars for Deep Learning David Balduzzi GNN 39 1 0 29 Sep 2015