AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization

Aniket Das, Bernhard Schölkopf, Michael Muehlebach

NeurIPS 2022 · Optimization › Nonconvex and smooth optimization · approach: Proximal finite-sum methods · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 random reshuffling instead of uniform samplingGDA, PPM, and AGDA · SC-SC quadratic minimax gamesrelative distance to minimax pointImproved
Allow an adversary to choose the data order each epoch instead of using random reshufflingGDA and PPM · Strongly monotone finite-sum variational inequalitiesconvergence rate: 1/nK^2 -> 1/K^2Hurt
Allow an adversary to choose the data order instead of random reshufflingAGDA · Two-sided PL minimax objectivesconvergence rate: 1/nK^2 -> 1/K^2Hurt

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