Robust Federated Learning via Relevant Model Slicing

Federated Learning (FL) is a machine learning paradigm in which many nodes collaborate to learn shared global models using local datasets. Nowadays, Federated Learning is widely used in the explosion of data. However, in addition to the shortcomings of the models themselves in machine learning, Federated Learning is also more vulnerable to backdoor attacks due to its own open nature, i.e., it is public during the training process and generally involves a large number of participants, any of whom may have malicious behaviors. Reducing or even countering these attacks is very challenging, as existing methods increase the aggregation cost or drastically reduce the task accuracy. In this paper, we propose FedLRMS (Federated Learning via Relevant Model Slicing). Specifically, it computes model weights related to the respective client's data based on the effective neuron information obtained by analyzing the global model usage, and utilizes only the weights that are relevant to the client's data for fine-tuning the personalized Federated Learning model, while choosing to re-initialize and re-train the model weights for irrelevant ones. Through FedLRMS, we significantly mitigate the impact of backdoor attacks on the training process. In order to verify the performance of FedLRMS, the experiments utilize two datasets, MNIST, CIFAR-10, and use two models, ResNet18 and ResNet50. Two kinds of non-independent homogeneous distribution scenarios, data imbalance and category imbalance, as well as independent homogeneous distribution scenarios, are considered. In addition, the number of backdoor clients is increased from 40% to 60% in 10% increments, in order to realize the scenarios with a large number of backdoor clients, and the FedLRMS algorithm is also tested in the scenarios with fewer backdoor clients than normal clients, and the experimental results show that FedLRMS is able to resist the backdoor attacks in different scenarios completely, and the success rate of backdoor attacks is only about 0.2% (0% in some scenarios), and at the same time, it obtains a better accuracy of the main task, in contrast, several existing classical algorithms fail completely, and the success rate of the backdoor attack is only about 2%. In contrast, several existing classical algorithms fail completely, mostly making the success rate of backdoor attacks 100%, which demonstrate the superiority of the FedLRMS algorithm.

Authors

Institutions

Publication Details

Published
2025-02-21
DOI
https://doi.org/10.1145/3732365.3732417
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

Robust Federated Learning via Relevant Model Slicing

Jiakai Hao, Shaoyong Guo, Chao Yang, Guoming Yang et al.
Privacy-Preserving Technologies in Data
article

Robust Federated Learning via Relevant Model Slicing

Jiakai Hao, Shaoyong Guo, Chao Yang, Guoming Yang, X. H. Mo
article en

Abstract

Federated Learning (FL) is a machine learning paradigm in which many nodes collaborate to learn shared global models using local datasets. Nowadays, Federated Learning is widely used in the explosion of data. However, in addition to the shortcomings of the models themselves in machine learning, Federated Learning is also more vulnerable to backdoor attacks due to its own open nature, i.e., it is public during the training process and generally involves a large number of participants, any of whom may have malicious behaviors. Reducing or even countering these attacks is very challenging, as existing methods increase the aggregation cost or drastically reduce the task accuracy. In this paper, we propose FedLRMS (Federated Learning via Relevant Model Slicing). Specifically, it computes model weights related to the respective client's data based on the effective neuron information obtained by analyzing the global model usage, and utilizes only the weights that are relevant to the client's data for fine-tuning the personalized Federated Learning model, while choosing to re-initialize and re-train the model weights for irrelevant ones. Through FedLRMS, we significantly mitigate the impact of backdoor attacks on the training process. In order to verify the performance of FedLRMS, the experiments utilize two datasets, MNIST, CIFAR-10, and use two models, ResNet18 and ResNet50. Two kinds of non-independent homogeneous distribution scenarios, data imbalance and category imbalance, as well as independent homogeneous distribution scenarios, are considered. In addition, the number of backdoor clients is increased from 40% to 60% in 10% increments, in order to realize the scenarios with a large number of backdoor clients, and the FedLRMS algorithm is also tested in the scenarios with fewer backdoor clients than normal clients, and the experimental results show that FedLRMS is able to resist the backdoor attacks in different scenarios completely, and the success rate of backdoor attacks is only about 0.2% (0% in some scenarios), and at the same time, it obtains a better accuracy of the main task, in contrast, several existing classical algorithms fail completely, and the success rate of the backdoor attack is only about 2%. In contrast, several existing classical algorithms fail completely, mostly making the success rate of backdoor attacks 100%, which demonstrate the superiority of the FedLRMS algorithm.

Beijing University of Posts and Telecommunications (CN), State Grid Corporation of China (China) (CN), Shanghai Electric (China) (CN)
Openalex Percentile: Top 93%
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.