Nonconvex-Nonconcave Min-Max Optimization with a Small Maximization Domain

arXiv:2110. 03950v3 Announce Type: replace-cross Abstract: We study the problem of finding approximate first-order stationary points in optimization problems of the form $\min_{x \in X} \max_{y \in Y} f(x,y)$, where the sets $X,Y$ are convex and $Y$ is compact.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.