mlsanityData to 14 Oct 2026

Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms

arXiv 2010.13112 ↗First posted 25 Oct 2020cs.LG cs.DC math.OCcited by 14

Not on the map. Why?

Abstract (arXiv)

This paper focuses on the distributed optimization of stochastic saddle point problems. The first part of the paper is devoted to lower bounds for the centralized and decentralized distributed methods for smooth (strongly) convex-(strongly) concave saddle point problems, as well as the near-optimal algorithms by which these bounds are achieved. Next, we present a new federated algorithm for centralized distributed saddle-point problems - Extra Step Local SGD. The theoretical analysis of the new method is carried out for strongly convex-strongly concave and non-convex-non-concave problems. In the experimental part of the paper, we show the effectiveness of our method in practice. In particular, we train GANs in a distributed manner.

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Oct 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 4; 2023: 5; 2024: 0; 2025: 3; 2026: 1.

14 papers.

Sort: