On the complexity of finding stationary points of smooth functions in one dimension

Sinho Chewi, Sébastien Bubeck, Adil Salim

Abstract: We characterize the query complexity of finding stationary points of one-dimensional non-convex but smooth functions. We consider four settings, based on whether the algorithms under consideration ...