Open Problem: The Oracle Complexity of Convex Optimization with Limited Memory

Blake E. Woodworth, Nathan Srebro. Open Problem: The Oracle Complexity of Convex Optimization with Limited Memory. 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 3202-3210, PMLR, 2019. [doi]

Abstract

Abstract is missing.