Fetching the paper…
Reading the bibliography…
State-of-the-art methods in convex and non-convex optimization employ higher-order derivative information, either implicitly or explicitly.
Problem complexity and method efficiency in optimization
Arkadi Nemirovsky and David Yudin · 1983
Earlier work this paper cites.
Convex optimization
Stephen Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Introductory lectures on convex optimization
Yurii Nesterov · 2004
Earlier work this paper cites.
Online convex optimization in the bandit setting: gradient descent without a gradient
Abraham D Flaxman, Adam Tauman Kalai, and H Brendan McMahan · 2005
Earlier work this paper cites.
Accelerating the cubic regularization of newton’s method on convex problems
Yurii Nesterov · 2008
Earlier work this paper cites.
Information-theoretic lower bounds on the oracle complexity of convex optimization
Alekh Agarwal, Martin J Wainwright, Peter L Bartlett, and Pradeep K Ravikumar · 2009
Earlier work this paper cites.
Estimate sequence methods: extensions and approximations
Michel Baes · 2009
Earlier work this paper cites.
Adaptive subgradient methods for online learning and stochastic optimization
John Duchi, Elad Hazan, and Yoram Singer · 2011
Earlier work this paper cites.
Sublinear optimization for machine learning
Kenneth L. Clarkson, Elad Hazan, and David P. Woodruff · 2012
Cited alongside, same era.
Sublinear optimization for machine learning
Kenneth L Clarkson, Elad Hazan, and David P Woodruff · 2012
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Cited alongside, same era.
An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
Renato DC Monteiro and Benar Fux Svaiter · 2013
Cited alongside, same era.
On lower and upper bounds for smooth and strongly convex optimization problems
Yossi Arjevani, Shai Shalev-Shwartz, and Ohad Shamir · 2015
Cited alongside, same era.
Second order stochastic optimization for machine learning in linear time
Accelerated methods for non-convex optimization
Yair Carmon, John C. Duchi, Oliver Hinder, and Aaron Sidford · 2016
Later among the works it cites.
Tight Complexity Bounds for Optimizing Composite Objectives
Blake Woodworth and Nati Srebro · 2016
Later among the works it cites.
Tight complexity bounds for optimizing composite objectives
Blake E Woodworth and Nati Srebro · 2016
Later among the works it cites.
Sub-sampled newton methods with non-uniform sampling
Peng Xu, Jiyan Yang, Farbod Roosta-Khorasani, Christopher Ré, and Michael W Mahoney · 2016
Later among the works it cites.
Finding approximate local minima for nonconvex optimization in linear time
Naman Agarwal, Zeyuan Allen-Zhu, Brian Bullins, Elad Hazan, and Tengyu Ma · 2017
Closest in time.
Oracle complexity of second-order methods for smooth convex optimization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Naman Agarwal, Brian Bullins, and Elad Hazan · 2016
Cited alongside, same era.
Oracle complexity of second-order methods for finite-sum problems
Yossi Arjevani and Ohad Shamir · 2016
Cited alongside, same era.
Exact and inexact subsampled newton methods for optimization
Raghu Bollapragada, Richard Byrd, and Jorge Nocedal · 2016
Cited alongside, same era.
Yossi Arjevani, Ohad Shamir, and Ron Shiff · 2017
Closest in time.
Natasha: Faster stochastic non-convex optimization via strongly non-convex parameter
Zeyuan Allen-Zhu · 2017
Closest in time.
Yair Carmon, Oliver Hinder, John C Duchi, and Aaron Sidford · 2017
Closest in time.