FedPID: An Aggregation Method for Federated Learning
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912104537128960 |
|---|---|
| author | Mächler, Leon Grimberg, Gustav Ezhov, Ivan Nickel, Manuel Shit, Suprosanna Naccache, David Paetzold, Johannes C. |
| author_facet | Mächler, Leon Grimberg, Gustav Ezhov, Ivan Nickel, Manuel Shit, Suprosanna Naccache, David Paetzold, Johannes C. |
| contents | This paper presents FedPID, our submission to the Federated Tumor Segmentation Challenge 2024 (FETS24). Inspired by FedCostWAvg and FedPIDAvg, our winning contributions to FETS21 and FETS2022, we propose an improved aggregation strategy for federated and collaborative learning. FedCostWAvg is a method that averages results by considering both the number of training samples in each group and how much the cost function decreased in the last round of training. This is similar to how the derivative part of a PID controller works. In FedPIDAvg, we also included the integral part that was missing. Another challenge we faced were vastly differing dataset sizes at each center. We solved this by assuming the sizes follow a Poisson distribution and adjusting the training iterations for each center accordingly. Essentially, this part of the method controls that outliers that require too much training time are less frequently used. Based on these contributions we now adapted FedPIDAvg by changing how the integral part is computed. Instead of integrating the loss function we measure the global drop in cost since the first round. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_02152 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | FedPID: An Aggregation Method for Federated Learning Mächler, Leon Grimberg, Gustav Ezhov, Ivan Nickel, Manuel Shit, Suprosanna Naccache, David Paetzold, Johannes C. Machine Learning Cryptography and Security This paper presents FedPID, our submission to the Federated Tumor Segmentation Challenge 2024 (FETS24). Inspired by FedCostWAvg and FedPIDAvg, our winning contributions to FETS21 and FETS2022, we propose an improved aggregation strategy for federated and collaborative learning. FedCostWAvg is a method that averages results by considering both the number of training samples in each group and how much the cost function decreased in the last round of training. This is similar to how the derivative part of a PID controller works. In FedPIDAvg, we also included the integral part that was missing. Another challenge we faced were vastly differing dataset sizes at each center. We solved this by assuming the sizes follow a Poisson distribution and adjusting the training iterations for each center accordingly. Essentially, this part of the method controls that outliers that require too much training time are less frequently used. Based on these contributions we now adapted FedPIDAvg by changing how the integral part is computed. Instead of integrating the loss function we measure the global drop in cost since the first round. |
| title | FedPID: An Aggregation Method for Federated Learning |
| topic | Machine Learning Cryptography and Security |
| url | https://arxiv.org/abs/2411.02152 |