The reviewed record of science sign in
Pith

arxiv: 2311.00959 · v1 · pith:QFEKD23C · submitted 2023-11-02 · cs.LG · cs.CY· cs.IT· math.IT

Dynamic Fair Federated Learning Based on Reinforcement Learning

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:QFEKD23Crecord.jsonopen to challenge →

classification cs.LG cs.CYcs.ITmath.IT
keywords learningfairnessfederatedaggregationdqffldynamicglobalreinforcement
0
0 comments X
read the original abstract

Federated learning enables a collaborative training and optimization of global models among a group of devices without sharing local data samples. However, the heterogeneity of data in federated learning can lead to unfair representation of the global model across different devices. To address the fairness issue in federated learning, we propose a dynamic q fairness federated learning algorithm with reinforcement learning, called DQFFL. DQFFL aims to mitigate the discrepancies in device aggregation and enhance the fairness of treatment for all groups involved in federated learning. To quantify fairness, DQFFL leverages the performance of the global federated model on each device and incorporates {\alpha}-fairness to transform the preservation of fairness during federated aggregation into the distribution of client weights in the aggregation process. Considering the sensitivity of parameters in measuring fairness, we propose to utilize reinforcement learning for dynamic parameters during aggregation. Experimental results demonstrate that our DQFFL outperforms the state-of-the-art methods in terms of overall performance, fairness and convergence speed.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.