On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization.
Nicolas EmmeneggerRasmus KyngAhad N. ZehmakanPublished in: AISTATS (2022)
Keyphrases
- higher order
- convex optimization problems
- worst case
- optimization algorithm
- global optimization
- convex optimization
- risk minimization
- natural images
- auxiliary variables
- efficient optimization
- convex relaxation
- optimization process
- convex programming
- computational complexity
- convex hull
- optimization method
- evolutionary algorithm
- pairwise
- oracle database
- logic programs
- optimization problems
- multi objective
- polynomial hierarchy