Accelerating Distributed Optimization: A Primal-Dual Perspective on Local Steps
Junchi Yang, Murat Yildirim, Qiu Feng

TL;DR
This paper introduces a primal-dual method for distributed optimization that inherently incorporates local updates, achieving linear convergence and nearly optimal communication complexity without large minibatches across various convexity settings.
Contribution
It demonstrates that a primal-dual approach with local updates can achieve optimal communication complexity and linear convergence in distributed optimization, even for non-strongly convex objectives.
Findings
Achieves linear convergence in strongly convex settings.
Requires no inter-agent communication during local primal updates.
Attains nearly optimal communication complexity across different convexity regimes.
Abstract
In distributed machine learning, efficient training across multiple agents with different data distributions poses significant challenges. Even with a centralized coordinator, current algorithms that achieve optimal communication complexity typically require either large minibatches or compromise on gradient complexity. In this work, we tackle both centralized and decentralized settings across strongly convex, convex, and nonconvex objectives. We first demonstrate that a basic primal-dual method, (Accelerated) Gradient Ascent Multiple Stochastic Gradient Descent (GA-MSGD), applied to the Lagrangian of distributed optimization inherently incorporates local updates, because the inner loops of running Stochastic Gradient Descent on the primal variable require no inter-agent communication. Notably, for strongly convex objectives, (Accelerated) GA-MSGD achieves linear convergence in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Optimization Algorithms · Modular Robots and Swarm Intelligence · Metaheuristic Optimization Algorithms Research
