Optimization Trade-offs in Asynchronous Federated Learning: A Stochastic Networks Approach

TL;DR

This paper develops a stochastic queueing-network model for asynchronous federated learning, providing closed-form expressions for throughput, convergence, and energy trade-offs, and proposes optimization strategies to improve efficiency.

Contribution

It introduces a novel analytical framework that captures queueing dynamics in asynchronous federated learning, enabling explicit trade-off analysis and optimization.

Findings

Closed-form expression for update throughput.

Quantified trade-offs between staleness, convergence speed, and energy.

Experimental results show significant reductions in convergence time and energy consumption.

Abstract

Synchronous federated learning scales poorly due to the straggler effect. Asynchronous algorithms increase the update throughput by processing updates upon arrival, but they introduce two fundamental challenges: gradient staleness, which degrades convergence, and bias toward faster clients under heterogeneous data distributions. Although algorithms such as AsyncSGD and Generalized AsyncSGD mitigate this bias via client-side task queues, most existing analyses neglect the underlying queueing dynamics and lack closed-form characterizations of the update throughput and gradient staleness. To close this gap, we develop a stochastic queueing-network framework for Generalized AsyncSGD that jointly models random computation times at the clients and the central server, as well as random uplink and downlink communication delays. Leveraging product-form network theory, we derive a closed-form expression for the update throughput, alongside closed-form upper bounds for both the communication round complexity and the expected wall-clock time required to reach an $\epsilon$-stationary point. These results formally characterize the trade-off between gradient staleness and wall-clock convergence speed. We further extend the framework to quantify energy consumption under stochastic timing, revealing an additional trade-off between convergence speed and energy efficiency. Building on these analytical results, we propose gradient-based optimization strategies to jointly optimize routing and concurrency. Experiments on EMNIST demonstrate reductions of 29%--46% in convergence time and 36%--49% in energy consumption compared to AsyncSGD.