Dimension-free Complexity Bounds for High-order Nonconvex Finite-sum Optimization

Very common in machine learning! NP-hard to solve in general (Hillar and Lim, 2013) First-Order Stationary Points We aim to find a first-order stationary point x, where Why stationary points? In some cases, stationary points are global minima! For instance, gradient dominant functions!