Research map / Optimization / Nonconvex and smooth optimization
A Faster Decentralized Algorithm for Nonconvex Minimax Problems
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 changed | Where | Measured | Effect |
|---|---|---|---|
| replace SGDA, SREDA, DPOSG, SGTDA with DM-HSGD (hybrid stochastic gradient plus gradient tracking) | decentralized minimax solvers · robust logistic regression (a9a, covtype, ijcnn1, phishing, rcv1, w8a) | Phi(x) vs gradient oracles | Helped |
| replace baselines with DM-HSGD | decentralized minimax solvers · policy evaluation on Mountaincar | Phi(theta) vs gradient oracles | Helped |
| use single-loop algorithm instead of nested-loop (double-loop) algorithms | minimax optimization · policy evaluation | gradient complexity | Helped |
Closest papers by meaning
- Jointly Improving the Sample and Communication Complexities in Decentralized Stochastic Minimax Optimization (AAAI 2024 · similarity 0.92)
- Decentralized Sum-of-Nonconvex Optimization (AAAI 2024 · similarity 0.90)
- An Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization (ICML 2024 · similarity 0.90)
- Enhancing Parallelism in Decentralized Stochastic Convex Optimization (ICML 2025 · similarity 0.89)
- Hybrid Decentralized Optimization: Leveraging Both First- and Zeroth-Order Optimizers for Faster Convergence (AAAI 2025 · similarity 0.89)
- Faster Adaptive Decentralized Learning Algorithms (ICML 2024 · similarity 0.89)
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.