Fetching the paper…
Reading the bibliography…
We propose a Riemannian version of Nesterov's Accelerated Gradient algorithm (RAGD), and show that for geodesically smooth and strongly convex problems, within a neighborhood of the minimizer whose radius depends on the condition number as well as the sectional curvature of the manifold, RAGD converges to the minimizer with acceleration.
Gradient methods for the minimisation of functionals
B. Polyak · 1963
Earlier work this paper cites.
Polynomial algorithms in linear programming
L. G. Khachiyan · 1980
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. S. Nemirovsky and D. B. Yudin · 1983
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate O ( 1 / k 2 ) {O}(1/k^{2})
Y. Nesterov · 1983
Earlier work this paper cites.
A new polynomial-time algorithm for linear programming
N. Karmarkar · 1984
Earlier work this paper cites.
Toponogov’s theorem and applications
W. Meyer · 1989
Earlier work this paper cites.
Convex functions and optimization methods on Riemannian manifolds , volume 297
C. Udriste · 1994
Earlier work this paper cites.
A course in metric geometry , volume 33
D. Burago, Y. Burago, and S. Ivanov · 2001
Earlier work this paper cites.
Proximal point algorithm on Riemannian manifolds
O. Ferreira and P. Oliveira · 2002
Earlier work this paper cites.
Introductory lectures on convex optimization , volume 87
Y. Nesterov · 2004
Earlier work this paper cites.
Optimization algorithms on matrix manifolds
P.-A. Absil, R. Mahony, and R. Sepulchre · 2009
Earlier work this paper cites.
Riemannian Geometry and Geometric Analysis
J. Jost · 2011
Earlier work this paper cites.
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods
H. Attouch, J. Bolte, and B. F. Svaiter · 2013
Earlier work this paper cites.
Stochastic first-and zeroth-order methods for nonconvex stochastic programming
S. Ghadimi and G. Lan · 2013
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T. Zhang · 2013
Cited alongside, same era.
Minimizing finite sums with the stochastic average gradient
M. Schmidt, N. L. Roux, and F. Bach · 2013
Cited alongside, same era.
Linear coupling: An ultimate unification of gradient and mirror descent
Z. Allen-Zhu and L. Orecchia · 2014
Cited alongside, same era.
Metric measure spaces with Riemannian Ricci curvature bounded from below
L. Ambrosio, N. Gigli, G. Savaré, et al · 2014
Cited alongside, same era.
Accelerated methods for non-convex optimization
Y. Carmon, J. C. Duchi, O. Hinder, and A. Sidford · 2016
Later among the works it cites.
Riemannian stochastic variance reduced gradient on Grassmann manifold
H. Kasai, H. Sato, and B. Mishra · 2016
Later among the works it cites.
Deep learning without poor local minima
K. Kawaguchi · 2016
Later among the works it cites.
Analysis and design of optimization algorithms via integral quadratic constraints
L. Lessard, B. Recht, and A. Packard · 2016
Later among the works it cites.
Riemannian preconditioning
B. Mishra and R. Sepulchre · 2016
Later among the works it cites.
Stochastic variance reduction for nonconvex optimization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Convex analysis and optimization in Hadamard spaces , volume 22
M. Bacák · 2014
Cited alongside, same era.
SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives
A. Defazio, F. Bach, and S. Lacoste-Julien · 2014
Cited alongside, same era.
A differential equation for modeling Nesterov’s accelerated gradient method: Theory and insights
W. Su, S. Boyd, and E. Candes · 2014
Cited alongside, same era.
On lower and upper bounds for smooth and strongly convex optimization problems
Y. Arjevani, S. Shalev-Shwartz, and O. Shamir · 2015
Cited alongside, same era.
A geometric alternative to Nesterov’s accelerated gradient descent
S. Bubeck, Y. T. Lee, and M. Singh · 2015
Cited alongside, same era.
From averaging to acceleration, there is only a step-size
N. Flammarion and F. Bach · 2015
Cited alongside, same era.
A Stochastic PCA and SVD Algorithm with an Exponential Convergence Rate
O. Shamir · 2015
Cited alongside, same era.
S. J. Reddi, A. Hefny, S. Sra, B. Póczos, and A. J. Smola · 2016
Later among the works it cites.
A variational perspective on accelerated methods in optimization
A. Wibisono, A. C. Wilson, and M. I. Jordan · 2016
Later among the works it cites.
First-order methods for geodesically convex optimization
H. Zhang and S. Sra · 2016
Later among the works it cites.
Riemannian SVRG: Fast stochastic optimization on Riemannian manifolds
H. Zhang, S. J. Reddi, and S. Sra · 2016
Later among the works it cites.
Y. Carmon, O. Hinder, J. C. Duchi, and A. Sidford · 2017
Later among the works it cites.
No spurious local minima in nonconvex low rank problems: A unified geometric analysis
R. Ge, C. Jin, and Y. Zheng · 2017
Later among the works it cites.
Accelerated first-order methods for geodesically convex optimization on Riemannian manifolds
Y. Liu, F. Shang, J. Cheng, H. Cheng, and L. Jiao · 2017
Later among the works it cites.
Complete dictionary recovery over the sphere I: Overview and the geometric picture
J. Sun, Q. Qu, and J. Wright · 2017
Later among the works it cites.