GHTO: Improving Byzantine Robustness in Distributed Machine Learning Through Gradient Heterogeneity Twofold Optimization
Heterogeneous datasets induce local gradient variance and global gradient variance in distributed learning, collectively referred to as gradient heterogeneity. Gradient heterogeneity increases the system's vulnerability to Byzantine attacks, affecting performance. To address this issue, the paper proposes a Gradient Heterogeneity Twofold Optimization (GHTO) algorithm to enhance the Byzantine robustness of the system in non-independent and identically distributed environments. Specifically, a Local Gradient Correction (LGC) algorithm is proposed, which aims to reduce the local gradient variance. By further integrating LGC with momentum and bucketing techniques to achieve dual optimization of local and global gradient variance. Experimental results demonstrate the proposed LGC algorithm diminishes local gradient variance, and the GHTO method optimizes both local and global gradient variance, which further strengthens the robustness of the system against Byzantine attacks.
Authors
- Ming Yang (ORCID: https://orcid.org/0000-0002-8662-2438)
- Yunpeng He (ORCID: https://orcid.org/0000-0001-9672-7615)
- Xin Wang (ORCID: https://orcid.org/0009-0006-7119-1205)
- Caiyun Li (ORCID: https://orcid.org/0000-0002-2791-1686)
- Xiaoming Wu (ORCID: https://orcid.org/0000-0002-5129-1210)
- Jian Cao (ORCID: https://orcid.org/0009-0003-2282-094X)
Institutions
- Qilu University of Technology (CN)
- Shandong University (CN)
- Shandong Academy of Sciences (CN)
Publication Details
- Published
- 2024-12-13
- DOI
- https://doi.org/10.1109/icftic64248.2024.10913272
- Primary Topic
- Machine Learning and ELM
- Type
- article
- Field-Weighted Citation Impact
- 0.00