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
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use random reshuffling instead of uniform sampling | GDA, PPM, and AGDA · SC-SC quadratic minimax games | relative distance to minimax point | Improved |
| Allow an adversary to choose the data order each epoch instead of using random reshuffling | GDA and PPM · Strongly monotone finite-sum variational inequalities | convergence rate: 1/nK^2 -> 1/K^2 | Hurt |
| Allow an adversary to choose the data order instead of random reshuffling | AGDA · Two-sided PL minimax objectives | convergence rate: 1/nK^2 -> 1/K^2 | Hurt |
Closest papers by meaning
- Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization (ICML 2025 · similarity 0.91)
- Stochastic Optimization with Arbitrary Recurrent Data Sampling (ICML 2024 · similarity 0.89)
- Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization (NeurIPS 2024 · similarity 0.89)
- The Sample Complexity of Gradient Descent in Stochastic Convex Optimization (NeurIPS 2024 · similarity 0.88)
- Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization (ICML 2025 · similarity 0.88)
- Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity (NeurIPS 2024 · similarity 0.88)
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.
