The Computational Complexity of Finding Stationary Points in Non-Convex Optimization

Alexandros Hollender, Emmanouil Zampetakis. The Computational Complexity of Finding Stationary Points in Non-Convex Optimization. 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 5571-5572, PMLR, 2023. [doi]

Abstract

Abstract is missing.