Pursuing Overall Welfare in Federated Learning through Sequential Decision Making

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Hahn, Seok-Ju, Kim, Gi-Soo, Lee, Junghye
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916995136487424
author Hahn, Seok-Ju
Kim, Gi-Soo
Lee, Junghye
author_facet Hahn, Seok-Ju
Kim, Gi-Soo
Lee, Junghye
contents In traditional federated learning, a single global model cannot perform equally well for all clients. Therefore, the need to achieve the client-level fairness in federated system has been emphasized, which can be realized by modifying the static aggregation scheme for updating the global model to an adaptive one, in response to the local signals of the participating clients. Our work reveals that existing fairness-aware aggregation strategies can be unified into an online convex optimization framework, in other words, a central server's sequential decision making process. To enhance the decision making capability, we propose simple and intuitive improvements for suboptimal designs within existing methods, presenting AAggFF. Considering practical requirements, we further subdivide our method tailored for the cross-device and the cross-silo settings, respectively. Theoretical analyses guarantee sublinear regret upper bounds for both settings: $\mathcal{O}(\sqrt{T \log{K}})$ for the cross-device setting, and $\mathcal{O}(K \log{T})$ for the cross-silo setting, with $K$ clients and $T$ federation rounds. Extensive experiments demonstrate that the federated system equipped with AAggFF achieves better degree of client-level fairness than existing methods in both practical settings. Code is available at https://github.com/vaseline555/AAggFF
format Preprint
id arxiv_https___arxiv_org_abs_2405_20821
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Pursuing Overall Welfare in Federated Learning through Sequential Decision Making
Hahn, Seok-Ju
Kim, Gi-Soo
Lee, Junghye
Machine Learning
Distributed, Parallel, and Cluster Computing
In traditional federated learning, a single global model cannot perform equally well for all clients. Therefore, the need to achieve the client-level fairness in federated system has been emphasized, which can be realized by modifying the static aggregation scheme for updating the global model to an adaptive one, in response to the local signals of the participating clients. Our work reveals that existing fairness-aware aggregation strategies can be unified into an online convex optimization framework, in other words, a central server's sequential decision making process. To enhance the decision making capability, we propose simple and intuitive improvements for suboptimal designs within existing methods, presenting AAggFF. Considering practical requirements, we further subdivide our method tailored for the cross-device and the cross-silo settings, respectively. Theoretical analyses guarantee sublinear regret upper bounds for both settings: $\mathcal{O}(\sqrt{T \log{K}})$ for the cross-device setting, and $\mathcal{O}(K \log{T})$ for the cross-silo setting, with $K$ clients and $T$ federation rounds. Extensive experiments demonstrate that the federated system equipped with AAggFF achieves better degree of client-level fairness than existing methods in both practical settings. Code is available at https://github.com/vaseline555/AAggFF
title Pursuing Overall Welfare in Federated Learning through Sequential Decision Making
topic Machine Learning
Distributed, Parallel, and Cluster Computing
url https://arxiv.org/abs/2405.20821