Variance-reduced accelerated methods for decentralized stochastic double-regularized nonconvex strongly-concave minimax problems

arXiv:2307.07113 · math.OC, cs.LG · Submitted 2023-07-14 · Read on arXiv

math.OC, cs.LG

Submitted: 2023-07-14

Updated: 2026-10-02

Terminology

• Sample Complexity — 2× in this paper · explained in 17 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• Convergence Guarantees — 1× in this paper · explained in 3 episodes
• Regularization — 1× in this paper · explained in 3 episodes

Related papers

• Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
• Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
• Incremental Learning in Mirror Flows
• Online Control via Counterfactual Tracking
• Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
• Petrov-Galerkin operator inference with application to stability-encouraging identification