atlas

Research map / Optimization / Nonconvex and smooth optimization

Efficient Mirror Descent Ascent Methods for Nonsmooth Minimax Problems

NeurIPS 2021 · Optimization › Nonconvex and smooth optimization · approach: Nonconvex minimax and constrained methods · 12 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 variance reduction (VR-SMDA) on top of SMDA (ablation)stochastic mirror descent ascent · robust NN training, Fashion-MNIST and MNISTloss vs epochHelped
mirror descent ascent with adaptive preconditioning (Adam-type H_t, G_t) instead of proximal GDA baselinesMDA/SMDA/VR-SMDA · fair classifier, Fashion-MNIST, MNIST, CIFAR-10lossHelped
mirror methods vs PASGDA/PAGDA/MAPGDAMDA/SMDA/VR-SMDA · robust NN traininglossHelped
MDA vs PAGDA deterministic complexityMDA · nonsmooth minimax theorygradient complexity in kappa: O(κ2ϵ−2) -> O(√κϵ−2)Helped
SMDA vs PASGDA stochastic complexitySMDA · nonsmooth minimax theorygradient complexity: O(κ3ϵ−4) vs O(κ3ϵ−4)No clear effect

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