ANear-Optimal Algorithm for Decentralized Convex-Concave Finite-Sum Minimax Optimization

Neural Information Processing Systems 

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 sizes (DIVERSE) is proposed.

Duplicate Docs Excel Report

Title
None found

Similar Docs  Excel Report  more

TitleSimilaritySource
None found