FedBDQB: Communication Efficient Federated Learning via Bidirectional Dynamic Quantization and Bitmap

In this paper, we propose a novel framework for communication efficient federated learning, FedBDQB, by employing bidirectional dynamic quantization for model updates and bitmap-based lossless compression, and provide its descending analysis and convergence proof. The performance of FedBDQB is evaluated and compared against the classic FedAvg and a state-of-the-art method FedDQ across various experimental scenarios, including two widely-adopted datasets MNIST and CIFAR-10, as well as both IID and non-IID data partitioning. Experimental results demonstrate that our proposed FedBDQB can significantly reduce the data communication volume, achieving compression rates of up to 24.21 and 12.87 times over FedAvg and FedDQ, respectively. The substantial improvement in communication efficiency is attained with a negligible decrease in model accuracy (with the maximum error remaining below 1.5% across all experiments) and an acceptable increase in computational time (less than two times over FedAvg and FedDQ across all experiments).

Authors

Institutions

Publication Details

Published
2025-03-24
DOI
https://doi.org/10.1109/wcnc61545.2025.10978684
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

FedBDQB: Communication Efficient Federated Learning via Bidirectional Dynamic Quantization and Bitmap

Yayu Gao, Chengwei Zhang, Guohui Zhong, Bo Liu
Privacy-Preserving Technologies in Data
article

FedBDQB: Communication Efficient Federated Learning via Bidirectional Dynamic Quantization and Bitmap

Yayu Gao, Chengwei Zhang, Guohui Zhong, Bo Liu
article en

Abstract

In this paper, we propose a novel framework for communication efficient federated learning, FedBDQB, by employing bidirectional dynamic quantization for model updates and bitmap-based lossless compression, and provide its descending analysis and convergence proof. The performance of FedBDQB is evaluated and compared against the classic FedAvg and a state-of-the-art method FedDQ across various experimental scenarios, including two widely-adopted datasets MNIST and CIFAR-10, as well as both IID and non-IID data partitioning. Experimental results demonstrate that our proposed FedBDQB can significantly reduce the data communication volume, achieving compression rates of up to 24.21 and 12.87 times over FedAvg and FedDQ, respectively. The substantial improvement in communication efficiency is attained with a negligible decrease in model accuracy (with the maximum error remaining below 1.5% across all experiments) and an acceptable increase in computational time (less than two times over FedAvg and FedDQ across all experiments).

Huazhong University of Science and Technology (CN)
Openalex Percentile: Top 96%
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.