Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems.
Moïse BlanchardPublished in: CoRR (2024)
Keyphrases
- pareto optimal
- computational complexity
- memory requirements
- optimization problems
- optimal solution
- trade off
- multi objective
- worst case
- np complete
- computationally efficient
- decision problems
- multiobjective optimization
- pareto optimal set
- neural network
- pareto optimality
- polynomial hierarchy
- heuristic methods
- cost function
- reinforcement learning