Fetching the paper…
Reading the bibliography…
Stochastic optimization algorithms have become indispensable in modern machine learning.
Inequalities
Hardy, G. H., Littlewood, J. E., and Pólya, G · 1952
Earlier work this paper cites.
On the singular values of a product of operators
Bhatia, R. and Kittaneh, F · 1990
Earlier work this paper cites.
A new Farkas lemma for positive semidefinite matrices
Lasserre, J. B · 1995
Earlier work this paper cites.
Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones
Sturm, J. F · 1999
Earlier work this paper cites.
Notes on matrix arithmetic-geometric mean inequalities
Bhatia, R. and Kittaneh, F · 2000
Earlier work this paper cites.
“Positive” noncommutative polynomials are sums of squares
Helton, J. W · 2002
Earlier work this paper cites.
Symmetry groups, semidefinite programs, and sums of squares
Gatermann, K. and Parrilo, P. A · 2004
Earlier work this paper cites.
Noncommutative geometric means
Bhatia, R. and Holbrook, J · 2006
Earlier work this paper cites.
The matrix arithmetic-geometric mean inequality revisited
Bhatia, R. and Kittaneh, F · 2008
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
Nemirovski, A., Juditsky, A., Lan, G., and Shapiro, A · 2008
Cited alongside, same era.
Curiously fast convergence of some stochastic gradient descent algorithms
Bottou, L · 2009
Cited alongside, same era.
A randomized Kaczmarz algorithm with exponential convergence
Strohmer, T. and Vershynin, R · 2009
Cited alongside, same era.
Large-scale machine learning with stochastic gradient descent
Bottou, L · 2010
Cited alongside, same era.
The convex Positivstellensatz in a free algebra
Helton, J. W., Klep, I., and McCullough, S · 2012
Cited alongside, same era.
Efficiency of coordinate descent methods on huge-scale optimization problems
Nesterov, Y · 2012
Cited alongside, same era.
An introduction to polynomial and semi-algebraic optimization , volume 52
Lasserre, J. B · 2015
Later among the works it cites.
Coordinate descent algorithms
Wright, S. J · 2015
Later among the works it cites.
An arithmetic-geometric mean inequality for products of three matrices
Israel, A., Krahmer, F., and Ward, R · 2016
Later among the works it cites.
Without-replacement sampling for stochastic gradient methods
Shamir, O · 2016
Later among the works it cites.
How to escape saddle points efficiently
Jin, C., Ge, R., Netrapalli, P., Kakade, S. M., and Jordan, M. I · 2017
Later among the works it cites.
Positivstellensätze for noncommutative rational expressions
Pascoe, J. E · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Toward a noncommutative arithmetic-geometric mean inequality: Conjectures, case-studies, and consequences
Recht, B. and Re, C · 2012
Cited alongside, same era.
On the convergence of block coordinate descent type methods
Beck, A. and Tetruashvili, L · 2013
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
Johnson, R. and Zhang, T · 2013
Cited alongside, same era.
A note on the matrix arithmetic-geometric mean inequality
Zhang, T · 2018
Later among the works it cites.
Sharp analysis for nonconvex sgd escaping from saddle points
Fang, C., Lin, Z., and Zhang, T · 2019
Later among the works it cites.
SGD without replacement: Sharper rates for general smooth convex functions
Nagaraj, D., Jain, P., and Netrapalli, P · 2019
Later among the works it cites.