Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal

Moïse Blanchard, Junhui Zhang, Patrick Jaillet. Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal. In Gergely Neu, Lorenzo Rosasco, editors, The Thirty Sixth Annual Conference on Learning Theory, 12-15 July 2023, Bangalore, India. Volume 195 of Proceedings of Machine Learning Research, pages 4696-4736, PMLR, 2023. [doi]

Authors

Moïse Blanchard

This author has not been identified. Look up 'Moïse Blanchard' in Google

Junhui Zhang

This author has not been identified. Look up 'Junhui Zhang' in Google

Patrick Jaillet

This author has not been identified. Look up 'Patrick Jaillet' in Google