Asynchronous Federated Learning with Bidirectional Quantized Communications and Buffered Aggregation
원문 초록
Asynchronous Federated Learning with Buffered Aggregation (FedBuff) is a state-of-the-art algorithm known for its efficiency and high scalability. However, it has a high communication cost, which has not been examined with quantized communications. To tackle this problem, we present a new algorithm (QAFeL), with a quantization scheme that establishes a shared "hidden" state between the server and clients to avoid the error propagation caused by direct quantization. This approach allows for high precision while significantly reducing the data transmitted during client-server interactions. We provide theoretical convergence guarantees for QAFeL and corroborate our analysis with experiments on a standard benchmark.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
OLALa: Online Learned Adaptive Lattice Codes for Heterogeneous Federated Learning
Quantized Rank Reduction: A Communications-Efficient Federated Learning Scheme for Network-Critical Applications
Lightweight Federated Learning over Wireless Edge Networks
Enhancing Convergence, Privacy and Fairness for Wireless Personalized Federated Learning: Quantization-Assisted Min-Max Fair Scheduling
FLsim: A Modular and Library-Agnostic Simulation Framework for Federated Learning
MGVQ: Could VQ-VAE Beat VAE? A Generalizable Tokenizer with Multi-group Quantization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.