Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal.
Moïse BlanchardJunhui ZhangPatrick JailletPublished in: COLT (2023)
Keyphrases
- pareto optimal
- convex optimization
- query complexity
- multi objective
- multi objective optimization
- multiple objectives
- total variation
- nash equilibrium
- optimal solution
- nsga ii
- image restoration
- dynamic programming
- worst case
- pairwise
- exact learning
- objective function
- image compression
- genetic algorithm
- evolutionary algorithm
- multi agent systems
- membership queries
- resource consumption