# Queuing dynamics of asynchronous Federated Learning

Source: [Queuing dynamics of asynchronous Federated Learning](<https://www.sota2.com/research/paper/68fa730b1e209131cea5a10b>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-26T02:40:28.783Z

Authors: Louis Leconte, Matthieu Jonckheere, Sergey Samsonov, Eric Moulines

Published: 2024-02-12T18:32:35.000Z

## Abstract

We study asynchronous federated learning mechanisms with nodes having potentially different computational speeds. In such an environment, each node is allowed to work on models with potential delays and contribute to updates to the central server at its own pace. Existing analyses of such algorithms typically depend on intractable quantities such as the maximum node delay and do not consider the underlying queuing dynamics of the system. In this paper, we propose a non-uniform sampling scheme for the central server that allows for lower delays with better complexity, taking into account the closed Jackson network structure of the associated computational graph. Our experiments clearly show a significant improvement of our method over current state-of-the-art asynchronous algorithms on an image classification problem.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2405.00017>)

[PDF](<https://arxiv.org/pdf/2405.00017.pdf>)