Federated learning has been identified as an efficient decentralized training
paradigm for scaling the machine learning model training on a large number of
devices while guaranteeing the data privacy of the trainers. FedAvg has become
a foundational parameter update strategy for federated learning, which has been
promising to eliminate the effect of the heterogeneous data across clients and
guarantee convergence. However, the synchronization parameter update barriers
for each communication round during the training significant time on waiting,
slowing down the training procedure. Therefore, recent state-of-the-art
solutions propose using semi-asynchronous approaches to mitigate the waiting
time cost with guaranteed convergence. Nevertheless, emerging semi-asynchronous
approaches are unable to eliminate the waiting time completely.
We propose a full asynchronous training paradigm, called FedFa, which can
guarantee model convergence and eliminate the waiting time completely for
federated learning by using a few buffered results on the server for parameter
updating. Further, we provide theoretical proof of the convergence rate for our
proposed FedFa. Extensive experimental results indicate our approach
effectively improves the training performance of federated learning by up to 6x
and 4x speedup compared to the state-of-the-art synchronous and
semi-asynchronous strategies while retaining high accuracy in both IID and
Non-IID scenarios.

FedFa 是一种完全异步的训练范式，通过在服务器上使用少量缓冲结果进行参数更新，可以确保联邦学习的模型收敛并完全消除等待时间，实验证明该方法在 IID 和 Non-IID 场景下相较于同步和半异步策略提高了 6 倍和 4 倍的训练性能，并且保持了较高的准确性。

FedFa：一种用于联邦学习的完全异步训练范式

FedFa: A Fully Asynchronous Training Paradigm for Federated Learning

Due to the necessary security for the airport and flight, passengers are
required to have strict security check before getting aboard. However, there
are frequent complaints of wasting huge amount of time while waiting for the
security check. This paper presents a potential solution aimed at optimizing
gate setup procedures specifically tailored for Chicago OHare International
Airport. By referring to queueing theory and performing Monte Carlo
simulations, we propose an approach to significantly diminish the average
waiting time to a more manageable level. Additionally, our study meticulously
examines and identifies the influential factors contributing to this
optimization, providing a comprehensive understanding of their impact.

针对芝加哥奥黑尔国际机场，本研究通过排队论和蒙特卡洛模拟提出了一种优化登机门设置程序的潜在解决方案，显著缩短了平均等待时间，并对影响这一优化的因素进行了细致的研究，全面理解了其影响。