The Complexity of Making the Gradient Small in Stochastic Convex Optimization

Dylan J. Foster, Ayush Sekhari, Ohad Shamir, Nathan Srebro, Karthik Sridharan, Blake E. Woodworth. The Complexity of Making the Gradient Small in Stochastic Convex Optimization. In Alina Beygelzimer, Daniel Hsu 0001, editors, Conference on Learning Theory, COLT 2019, 25-28 June 2019, Phoenix, AZ, USA. Volume 99 of Proceedings of Machine Learning Research, pages 1319-1345, PMLR, 2019. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.