RCEFL: Reputation-based Communication-aware Optimization of Federated Learning

Federated learning (FL) is a privacy-preserving distributed machine learning paradigm, where multiple devices holding local datasets collaborate to train a general global model without disclosing data. Instead of submitting raw data as in centralized training, devices send local gradients to the server for aggregation, which introduces the challenge of communication overhead. In each aggregation round, the server broadcasts the global model to all devices, while the devices train the model using local data and submit gradients to the server, which may lead to server congestion. Several works in communication optimization design device selection strategies to optimize model convergence efficiency, but they usually only consider the impact of the number of aggregation devices on the model convergence rate and communication cost, ignoring the impact of data heterogeneity on convergence rate. In this paper, we propose a reputation-based communication-aware federated learning optimization scheme named RCEFL. In RCEFL, we design a reputation evluation algorithm to predict the influence of device gradients on model convergence. Leveraging the reputation, we propose an efficient device selection and bandwidth allocation scheme to reduce model convergence time. Experiments demonstrate that our proposed RCEFL effectively reduces the convergence time of FL.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icct62411.2024.10946362
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

RCEFL: Reputation-based Communication-aware Optimization of Federated Learning

Wenke Yuan, Xun Liu, Jian Yang, Xiaofeng Jiang et al.
1 links
Privacy-Preserving Technologies in Data
article

RCEFL: Reputation-based Communication-aware Optimization of Federated Learning

Wenke Yuan, Xun Liu, Jian Yang, Xiaofeng Jiang, Feng Yang, Yunpeng Hou
article en

Abstract

Federated learning (FL) is a privacy-preserving distributed machine learning paradigm, where multiple devices holding local datasets collaborate to train a general global model without disclosing data. Instead of submitting raw data as in centralized training, devices send local gradients to the server for aggregation, which introduces the challenge of communication overhead. In each aggregation round, the server broadcasts the global model to all devices, while the devices train the model using local data and submit gradients to the server, which may lead to server congestion. Several works in communication optimization design device selection strategies to optimize model convergence efficiency, but they usually only consider the impact of the number of aggregation devices on the model convergence rate and communication cost, ignoring the impact of data heterogeneity on convergence rate. In this paper, we propose a reputation-based communication-aware federated learning optimization scheme named RCEFL. In RCEFL, we design a reputation evluation algorithm to predict the influence of device gradients on model convergence. Leveraging the reputation, we propose an efficient device selection and bandwidth allocation scheme to reduce model convergence time. Experiments demonstrate that our proposed RCEFL effectively reduces the convergence time of FL.

University of Science and Technology of China (CN)
Youth Innovation Promotion Association
Openalex Percentile: Top 73%
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.