Min-Max Optimization Requires Exponentially Many Queries
DGX agentarXiv:2605.13806v1 Announce Type: cross Abstract: We study the query complexity of min-max optimization of a nonconvex-nonconcave function f over [0,1]^d imes [0,1]^d. We show that, given oracle acces