The Complexity of Making the Gradient Small in Stochastic Convex Optimization - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Dylan J. Foster' in GoogleThis author has not been identified. Look up 'Ayush Sekhari' in GoogleThis author has not been identified. Look up 'Ohad Shamir' in GoogleThis author has not been identified. Look up 'Nathan Srebro' in GoogleThis author has not been identified. Look up 'Karthik Sridharan' in GoogleThis author has not been identified. Look up 'Blake E. Woodworth' in Google

runs on WebDSL