REVIEW 2 cited by
Solving Nonconvex-Nonconcave Min-Max Problems exhibiting Weak Minty Solutions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We investigate a structured class of nonconvex-nonconcave min-max problems exhibiting so-called \emph{weak Minty} solutions, a notion which was only recently introduced, but is able to simultaneously capture different generalizations of monotonicity. We prove novel convergence results for a generalized version of the optimistic gradient method (OGDA) in this setting, matching the $1/k$ rate for the best iterate in terms of the squared operator norm recently shown for the extragradient method (EG). In addition we propose an adaptive step size version of EG, which does not require knowledge of the problem parameters.
Forward citations
Cited by 2 Pith papers
-
Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions
PMC-regularized LSTD solved by FRBS outperforms L1 sparse RL methods on noisy features, with new Lyapunov and weak-MVI guarantees for non-monotone FRBS.
-
A first-order method for constrained nonconvex-nonconcave minimax optimization
Under a local Kurdyka-Łojasiewicz condition, the constrained nonconvex-nonconcave minimax value function is locally generalized Hölder smooth, and an interleaved SCP/proximal-gradient method achieves Õ(ε^{−max{1/(1−θ)...
Discussion (0). Continue with ORCID to comment.