Asynchronous SGD on Graphs: a Unified Framework for Asynchronous Decentralized and Federated Optimization

Mathieu Even, Anastasia Koloskova, Laurent Massoulié
11/1/2023
math.OCcs.DCcs.LG

No confident code implementation found for this paper.

Abstract

Decentralized and asynchronous communications are two popular techniques to speedup communication complexity of distributed machine learning, by respectively removing the dependency over a central orchestrator and the need for synchronization. Yet, combining these two techniques together still remains a challenge. In this paper, we take a step in this direction and introduce Asynchronous SGD on Graphs (AGRAF SGD) -- a general algorithmic framework that covers asynchronous versions of many popular algorithms including SGD, Decentralized SGD, Local SGD, FedBuff, thanks to its relaxed communication and computation assumptions. We provide rates of convergence under much milder assumptions than previous decentralized asynchronous works, while still recovering or even improving over the best know results for all the algorithms covered.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

First Provably Optimal Asynchronous SGD for Homogeneous and Heterogeneous Data

86% match2026

Asynchronous Decentralized SGD under Non-Convexity: A Block-Coordinate Descent Framework

86% match2025

AsGrad: A Sharp Unified Analysis of Asynchronous-SGD Algorithms

85% match2023

Accelerating Decentralized Optimization via Overlapping Local Steps

85% match2026

Ringleader ASGD: The First Asynchronous SGD with Optimal Time Complexity under Data Heterogeneity

85% match2025

Do We Need Asynchronous SGD? On the Near-Optimality of Synchronous Methods

84% match2026

Cite this paper

@article{even2023asynchronous,
  title  = {Asynchronous SGD on Graphs: a Unified Framework for Asynchronous Decentralized and Federated Optimization},
  author = {Mathieu Even and Anastasia Koloskova and Laurent Massoulié},
  year   = {2023},
  eprint = {2311.00465},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2311.00465v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2311.00465.svg)](https://codeofpaper.com/paper/2311.00465)

Discussion