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 Non-IID (Not Identically and Independently Distributed) characteristics between client nodes, which will affect the effect of federated learning. In this work we propose 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 (Resilient Reinforcement Federated Learning), a resilient reinforcement federated learning 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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have