A Decentralized Federated Learning Model Based on Global Channel Selection

With the increasing challenges of data privacy protection and computational resource constraints, Decentralized Federated Learning has gained widespread attention as an emerging distributed learning framework. However, frequent communication and model updates in decentralized environments significantly increase the communication overhead of the system. To address this problem, this paper proposes a decentralized federated learning scheme with a global channel selection algorithm. In this scheme, nodes dynamically decide which channels should be shared by locally training and evaluating the importance of model channels and aggregating global channel scores through a voting mechanism of neighboring nodes. During the aggregation process, we pass only the parameters of the important channels to reduce the communication burden, and introduce a Learn-to-Rank regularization strategy in the channel selection optimization to further improve the accuracy and performance of the sparse model. Experimental results show that the proposed scheme is effective in reducing communication overhead and maintaining high model performance across multiple datasets and model architectures, especially in resource-constrained distributed environments, demonstrating strong adaptability and scalability. The approach provides new ideas and effective technical support for the application of decentralized federated learning in large-scale, heterogeneous environments.

Authors

Institutions

Publication Details

Published
2024-12-13
DOI
https://doi.org/10.1109/icftic64248.2024.10912898
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

A Decentralized Federated Learning Model Based on Global Channel Selection

Jia Zhao, Yang Cao, Yongli Yang, Shiqiang Zhang et al.
Privacy-Preserving Technologies in Data
article

A Decentralized Federated Learning Model Based on Global Channel Selection

Jia Zhao, Yang Cao, Yongli Yang, Shiqiang Zhang, Yipeng Cai, Jin-quan Cheng
article en

Abstract

With the increasing challenges of data privacy protection and computational resource constraints, Decentralized Federated Learning has gained widespread attention as an emerging distributed learning framework. However, frequent communication and model updates in decentralized environments significantly increase the communication overhead of the system. To address this problem, this paper proposes a decentralized federated learning scheme with a global channel selection algorithm. In this scheme, nodes dynamically decide which channels should be shared by locally training and evaluating the importance of model channels and aggregating global channel scores through a voting mechanism of neighboring nodes. During the aggregation process, we pass only the parameters of the important channels to reduce the communication burden, and introduce a Learn-to-Rank regularization strategy in the channel selection optimization to further improve the accuracy and performance of the sparse model. Experimental results show that the proposed scheme is effective in reducing communication overhead and maintaining high model performance across multiple datasets and model architectures, especially in resource-constrained distributed environments, demonstrating strong adaptability and scalability. The approach provides new ideas and effective technical support for the application of decentralized federated learning in large-scale, heterogeneous environments.

Beijing Wuzi University (CN)
Openalex Percentile: Top 74%
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.