AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Stochastic Recursive Gradient Descent Ascent for Stochastic Nonconvex-Strongly-Concave Minimax Problems

NeurIPS 2020 · Optimization › Nonconvex and smooth optimization · approach: Nonconvex minimax and constrained methods · 40 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use recursive variance-reduced gradient estimates with the multi-step concave maximizerSGDA for stochastic nonconvex-strongly-concave minimax · Stochastic minimaxstochastic gradient evaluations: \fO(\kappa^3{\varepsilon}^{-4}) -> \fO(\kappa^3{\varepsilon}^{-3})Helped
Use finite-sum SREDA instead of Minimax PPA when n≥κ²Finite-sum nonconvex-strongly-concave minimax · Finite-sum minimax, n≥κ²stochastic gradient evaluations: \tilde\fO(\kappa^{1/2}n{\varepsilon}^{-2}) -> \tilde\fO\left(n + \kappa^2n^{1/2}{\varepsilon}^{-2}\right)Helped
Apply SREDA to the six robust-optimization datasetsSREDA and baseline algorithms · a9a, w8a, gisette, mushrooms, sido0, rcv1convergence speedHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy