R$^{2}$Fed: Resilient Reinforcement Federated Learning for Industrial Applications
Weishan Zhang, Yu Fa, Xiao Wang, Xingjie Zeng, Hongwei Zhao, Yonglin Tian, Fei–Yue Wang, Longfei Li, Zengxiang Li
Abstract
Federated learning has become an emerging hot research field in industry because of its ability to perform large-scale distributed learning while preserving data privacy. However, recent studies have shown that in the actual use of federated learning, there are device heterogeneity and data not identically and independently distributed (Non-IID) characteristics between client nodes, which will affect the effect of federated learning. In this work, we propose resilient reinforcement federated learning (R <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$^{2}$</tex-math></inline-formula> Fed), a R <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$^{2}$</tex-math></inline-formula> Fed method, which applies reinforcement learning to federated learning and uses reinforcement learning for weighted fusion of client models instead of average fusion. We conduct experiments on object detection, object classification, and sentiment classification tasks in the context of Non-IID and heterogeneity, and the experimental results show that the R <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$^{2}$</tex-math></inline-formula> Fed method outperforms traditional federated learning, increasing the average accuracy by 4.7%. Experiments also demonstrate that R <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$^{2}$</tex-math></inline-formula> Fed is resilient to federation attacks.