Adaptive Gradient Quantization for Efficient Federated Learning with Buffered Asynchronous Aggregation
摘要
Asynchronous federated learning (AFL) mitigates scalability and straggler issues in federated training but exacerbates communication bottlenecks due to frequent high-dimensional gradient transmissions. While gradient quantization techniques reduce communication overhead, existing static compression strategies fail to adapt to the dynamic nature of training phases, leading to suboptimal trade-offs between convergence performance and communication budget. This paper proposes FedBuff_AGQ, an asynchronous FL framework that integrates adaptive gradient quantization with buffered aggregation to enhance communication efficiency while preserving convergence guarantees. We theoretically analyze the impact of quantization errors and develop an adaptive quantization strategy using Recursive Least Squares (RLS) estimation and rolling-horizon optimization to balance convergence efficiency and communication constraints. Experiments on benchmark FL datasets demonstrate that FedBuff_AGQ achieves superior accuracy under the same communication budget, highlighting its effectiveness in improving both communication efficiency and model performance.