2022
On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization
AISTATS 2022poster
We prove lower bounds for higher-order methods in smooth non-convex finite-sum optimization. Our contribution is threefold: We first show that a deterministic algorithm cannot profit from the finite-sum structure of the objective and that simulating a pth-order regularized method on the whole functi…