Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2208.12932 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929282354249728 |
|---|---|
| author | Bao, Wenxuan Wu, Jun He, Jingrui |
| author_facet | Bao, Wenxuan Wu, Jun He, Jingrui |
| contents | In federated learning, most existing robust aggregation rules (AGRs) combat Byzantine attacks in the IID setting, where client data is assumed to be independent and identically distributed. In this paper, we address label skewness, a more realistic and challenging non-IID setting, where each client only has access to a few classes of data. In this setting, state-of-the-art AGRs suffer from selection bias, leading to significant performance drop for particular classes; they are also more vulnerable to Byzantine attacks due to the increased variation among gradients of honest clients. To address these limitations, we propose an efficient two-stage method named BOBA. Theoretically, we prove the convergence of BOBA with an error of the optimal order. Our empirical evaluations demonstrate BOBA's superior unbiasedness and robustness across diverse models and datasets when compared to various baselines. Our code is available at https://github.com/baowenxuan/BOBA . |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2208_12932 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | BOBA: Byzantine-Robust Federated Learning with Label Skewness Bao, Wenxuan Wu, Jun He, Jingrui Machine Learning In federated learning, most existing robust aggregation rules (AGRs) combat Byzantine attacks in the IID setting, where client data is assumed to be independent and identically distributed. In this paper, we address label skewness, a more realistic and challenging non-IID setting, where each client only has access to a few classes of data. In this setting, state-of-the-art AGRs suffer from selection bias, leading to significant performance drop for particular classes; they are also more vulnerable to Byzantine attacks due to the increased variation among gradients of honest clients. To address these limitations, we propose an efficient two-stage method named BOBA. Theoretically, we prove the convergence of BOBA with an error of the optimal order. Our empirical evaluations demonstrate BOBA's superior unbiasedness and robustness across diverse models and datasets when compared to various baselines. Our code is available at https://github.com/baowenxuan/BOBA . |
| title | BOBA: Byzantine-Robust Federated Learning with Label Skewness |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2208.12932 |