A Near-Optimal Algorithm for Decentralized Convex-Concave Finite-Sum Minimax Optimization
NeurIPSSpotlight2025
TL;DR
In this paper, we study the distributed convex-concave finite-sum minimax optimization over the network, and a decentralized variance-reduced optimistic gradient method with stochastic mini-batch size…
Opening excerpt from the authors’ abstract. source
Read the paper
Topics
optimization
← All NeurIPS 2025 Spotlight papers · Browse the whole archive